Abstract
This paper proposes two novel implementation methods for the RSA cryptographic scheme. (1) The most efficient RSA implementation known to the present authors. This implementation achieves 50 Kbps at about 25 Kgates for a 512-bit exponent e and a 512-bit modulus N. Thus the efficiency is 2.0 bps/gate. (2) A systolic architecture useful for high-speed and efficient and flexible chip implementation of the RSA scheme.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Rivest, A. Shamir, and L. Adleman, “A method of obtaining digital signatures and public key cryptosystems,” Comm. of ACM, Vol.21, No.2, pp.120–126, Feb. 1978.
E.F. Brickell, “A Survey of hardware implementation of RSA,” Advances in Cryptology — CRYPTO’89, pp.368–370, Springer-Verlag.
E.F. Brickell, “A fast modular multiplication algorithm with applications to two key cryptography,” Advances in Cryptology, Proc. of CRYPTO’82, pp.51–60, Plenum.
S.R. Dusse and B.S. Kaliski Jr., “A cryptographic library for the Motorola DSP56000,” Advances in cryptology — EUROCRYPT’90, pp.230–244, Springer-Verlag.
S. Even, “Systolic modular multiplication,” Advances in Cryptology — CRYPTO’90 pp.619–624, Springer-Verlag.
F. Hoornaert, M. Decroos, J. Vandewalle, and R. Govaerts, “Fast RSA-hardware: Dream or reality?” Advances in Cryptology — CRYPTO’88, pp.257–264, Springer-Verlag.
T. Hasebe, N. Torii, M. Azuma, and R. Akiyama, “Implementation of high speed modular exponentiation calculation,” Proc. IEICE Spring Conference, A-284, 1990.
P.A. Ivey, S.N. Walker, S. Davidson, and J.M. Stern, “A VLSI architecture for RSA encryption,” Secure Design and Test of Crypto-Chips, IFIP WG 10.5 Workshop, Oct. 1991.
S. Kawamura, “A modulo multiplication algorithm using a small size residue table,” Proc. Sympo. on Cryptography and Information Security, Session J, 1988.
Y. Kano, N. Matsuzaki, and M. Tatebayashi, “A modulo exponentiation LSI using high-order modified Booth’s algorithm,” Proc. Workshop on Cryptography and Information Security, WCIS87-11, 1987.
M. Kochanski, “Developing an RSA chip,” Advances in Cryptology — CRYPTO’85, pp.350–357, Springer-Verlag.
S. Miyaguchi, “A fast computing scheme for RSA public-key cryptosystem and its VLSI organization,” Trans. Info. Processing Soc. Japan, Vol.24, No.6, pp.764–771, Nov. 1983.
H. Morita, “A fast modular multiplication algorithm based on a radix 4 and its application,” Trans. IEICE, Vol.73, No.7, July 1990.
J.K. Omura, “A public key cell design for smart card chips,” Proc. 1990 Int. Symp. Info. Theory and Its Applications, 65–1, 1990.
G. Orton, M. Roy, P. Scott, L. Peppard, and S. Tavares, “VLSI implementation of public-key encryption algorithms,” Advances in Cryptology — CRYPTO’86, pp.277–301, Springer-Verlag.
H. Orup, E. Svendsen, and E. Andreasen, “VICTOR an efficient RSA hardware implementation,” Advances in Cryptology — EUROCRYPT’90, pp.245–252, Springer-Verlag.
E. Okamoto and K. Tanaka, “A realization of RSA cryptosystem using digital signal processor,” Proc. Sympo. on Cryptography and Information Security, Session J, 1988.
J.J. Quisquater and C. Couvreuer, “Fast decipherment algorithm for RSA public-key cryptosystem,” Electron. Letters Vol.18, No.21, pp.905–907, Oct. 1982.
R.L. Rivest, “RSA chips (past/present/future),” Advances in Cryptology — EUROCRYPT’84, pp.159–168, Springer-Verlag.
K. Takaragi, “Hardware of RSA encryption,” Proc. Sympo. on Cryptography and Information Security, Session J, 1988.
N. Torii, M. Azuma, and R. Akiyama, “A study on high speed RSA encryption LSI using parallel processing,” Proc. IEICE National Convention, p.1388, 1987.
N. Torii, T. Hasebe, M. Azuma, and R. Akiyama, “The hardware technologies for RSA encryption systems,” Proc. Sympo. on Cryptography and Information Security, Session J, 1988.
K. Takabayashi, S. Kawamura and A. Shinbo, “A modular exponentiation method using a fast constant multiplication algorithm,” Proc. IEICE Spring Conference, A-285, 1990.
C.D. Walter, “Fast modular multiplication by operand scaling,” Abstracts of CRYPTO’91, pp.8-1–8-6.
S. Waleffe and J.J. Quisquater, “CORSAIR: a smart card for public key cryptosystems,” Advances in Cryptology — CRYPTO’90, pp.475–487, Springer-Verlag.
Fujitsu Limited, “ASIC technical information,” GATI0172C, 1988.
Fujitsu Limited, “CMOS standard cell design manual,” MATI10702, 1988.
P.L. Montgomery, “Modular multiplication without trial division,” Math.of Computation, Vol.44, pp.519–521, 1985.
K. Iwamura, T. Matsumoto and H. Imai, “Systolic-arrays for modular exponentiation using Montgomery method,” presented in Rumpsession of Eurocrypt’92, May 24–28, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwamura, K., Matsumoto, T., Imai, H. (1993). High-Speed Implementation Methods for RSA Scheme. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive