Abstract
We proposed a fast parallel algorithm of Montgomery multiplication based on Residue Number Systems (RNS). An implementation of RSA cryptosystem using the RNS Montgomery multiplication is described in this paper. We discuss how to choose the base size of RNS and the number of parallel processing units. An implementation method using the Chinese Remainder Theorem (CRT) is also presented. An LSI prototype adopting the proposed Cox-Rower Architecture achieves 1024-bit RSA transactions in 4.2 msec without CRT and 2.4 msec with CRT, when the operating frequency is 80 MHz and the total number of logic gates is 333 KG for 11 parallel processing units.
Chapter PDF
Similar content being viewed by others
References
S. Kawamura, M. Koike, F. Sano, and A. Shimbo, “Cox-Rower Architecture for Fast Montgomery Multiplication,” EUROCRYPT 2000, pp. 523–538 (2000).
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).
J.-C. Bajard, L.-S. Didier, and P. Kornerup, “An RNS Montgomery Multiplication Algorithm,” Proceedings of ARITH13, IEEE Computer Society, pp. 234–239 (1997).
P. Paillier, “Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor,” PKC99, pp. 223–234 (1999).
E. Kranakis, “Primality and Cryptography,” Wiley-Teubner Series in Computer Science, John Willy & Sons (1986).
RSA Laboratories, “PKCS#1 Ver.2.0: RSA Cryptography Standard,” Oct. 1 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nozaki, H., Motoyama, M., Shimbo, A., Kawamura, S. (2001). Implementation of RSA Algorithm Based on RNS Montgomery Multiplication. In: Koç, Ç.K., Naccache, D., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2001. CHES 2001. Lecture Notes in Computer Science, vol 2162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44709-1_30
Download citation
DOI: https://doi.org/10.1007/3-540-44709-1_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42521-2
Online ISBN: 978-3-540-44709-2
eBook Packages: Springer Book Archive