Implementation of RSA algorithm based on RNS montgomery multiplication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2162, Issue , 2001, Pages 364-376

  Nozaki, Hanae ^a   Motoyama, Masahiko ^a   Shimbo, Atsushi ^a   Kawamura, Shinichi ^a  

^a TOSHIBA CORPORATION   (Japan)

Author keywords

Modular exponentiation; Montgomery multiplication; Residue number systems; RSA cryptography

Indexed keywords

CRYPTOGRAPHY; NUMBERING SYSTEMS;

CHINESE REMAINDER THEOREM; FAST PARALLEL ALGORITHMS; MODULAR EXPONENTIATION; MONTGOMERY MULTIPLICATION; OPERATING FREQUENCY; PARALLEL PROCESSING; RESIDUE NUMBER SYSTEM; RSA CRYPTOGRAPHY;

EMBEDDED SYSTEMS;

EID: 84944903023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44709-1_30     Document Type: Conference Paper

References (8)

1. S. Kawamura, M. Koike, F. Sano, and A. Shimbo, “Cox-Rower Architecture for Fast Montgomery Multiplication,” EUROCRYPT 2000, pp. 523-538 (2000).
2. K. C. Posch and R. Posch, “Modulo Reduction in Residue Number Systems,” IEEE Tr. Parallel and Distributed Systems, Vol. 6, No. 5, pp. 449-454 (1995).
3. J.-C. Bajard, L.-S. Didier, and P. Kornerup, “An RNS Montgomery Multiplication Algorithm,” Proceedings of ARITH13, IEEE Computer Society, pp. 234-239 (1997).
4. P. Paillier, “Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor,” PKC99, pp. 223-234 (1999).
5. E. Kranakis, “Primality and Cryptography,” Wiley-Teubner Series in Computer Science, John Willy & Sons (1986).
6. RSA Laboratories, “PKCS#1 Ver.2.0: RSA Cryptography Standard,” Oct. 1 (1998).
7. http://www.rainbow.com/cryptoswift.
8. http://www.pcc.pijnenburg.nl/pcc-ises.htm.