VLSI design of RSA cryptosystem based on the Chinese remainder theorem

Journal of Information Science and Engineering

Volumn 17, Issue 6, 2001, Pages 967-980

  Wu, Chung Hsien ^a   Hong, Jin Hua ^a   Wu, Cheng Wen ^a  

^a DA YEH UNIVERSITY   (Taiwan)

Author keywords

Cellular array; Chinese remainder theorem (CRT); Modular multiplication; Montgomery algorithm; Public key cryptography; RSA

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; SYSTOLIC ARRAYS; VLSI CIRCUITS;

CHINESE REMAINDER THEOREM; MODULAR MULTIPLICATION; MONTGOMERY ALGORITHM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0035520704     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. A method for obtaining digital signatures and public-key cryptosystems
2. Bit-level systolic arrays for modular multiplication
3. RSA hardware implementation
4. Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem
5. Modular multiplication without trial division
6. A systolic, linear-array multiplier for a class of right-shift algorithms
7. Systolic modular multiplication
8. Fast implementation of RSA cryptography
9. A systolic RSA public key cryptosystem
10. A new RSA cryptosystem hardware design based on Montgomery's algorithm
11. An improved Montgomery algorithm for high-speed RSA public-key cryptosystem
12. The Chinese remainder theorem and its application in a high-speed RSA crypto chip
13. An RSA cryptosystem core based on the Chinese remainder theorem
14. Interleaving schemes for a systolic RSA public-key cryptosystem based on an improved Montgomery's algorithm
15. A 100Kbits/s single chip modular exponentiation
16. Design and implementation of an RSA public-key cryptosystem