Abstract
Today, a dozen years after the discovery of the RSA encryption algorithm [12], there are many chips available for performing RSA encryption [1] [3] [4] [5] [8] [9] [13] [15]. The purpose of this paper is to briefly describe some of the different compu- tational algorithms that have been used in the chip designs and to provide a list of all of the currently available chips. In this abstract, we will simply mention some of these computational algorithms and give references. The full paper will contain more details of these algorithms and will appear in a book on survey articles in Cryptology which is being edited by Gus Simmons and will be published by IEEE in 1990.
This work performed at Sandia National Laboratories and supported by the U.S. Department of Energy under contract No. DE-AC04-76DP00789.
References
AT&T, T7002/t7003 bit slice multiplier. Product Announcement, 1987.
P. Bertin, D. Roncin, and J. Vuillemin, Introduction to programmable active memories. Internal Report, Digital Equipment Corporation, 1989.
E. F. Brickell, A fast modular multiplication algorithm with applications to two key cryptography, in Advances in Cryptology, Proceedings of Crypto 82, D. Chaum, R. L. Rivest, and A. T. Sherman, eds., New York, 1982, Plenum Press, pp. 51–60.
P. Gallay and E. Depret, A cryptography processor, in 1988 IEEE International Solid-State Circuits Conference Digest of Technical Papers, 1988, pp. 148–149.
F. Hoornaert, M. Decroos, J. Vandewalle, and R. Govaerts, Fast RSA-hardware: Dream or reality?, in Advances in Cryptology-EUROCRYPT’88, C. G. Günther, ed., 1988.
K. Hwang, Computer Arithmetic, John Wiley, New York, 1979.
D. Knuth, The art of computer programming, Vol. 2: Seminumerical algorithms, Addison-Wesley, Reading, MA, 1981.
M. Kochanski, Developing an RSA chip, in Advances in Cryptology-CRYPTO’85, H. C. Williams, ed., New York, 1985, Springer-Verlag, pp. 350–357.
S. Miyaguchi, Fast encryption algorithm for the RSA cryptographic system, in Proceedings of Compcon 82, Los Angeles, 1982, IEEE, pp. 672–678.
P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, 44 (1985), pp. 519–521.
G. Orton, M. Roy, P. Scott, L. Peppard, and S. Tavares, VLSI implementation of public-key encryption algorithms, in Advances in Cryptology-CRYPTO’86, A.M. Odlyzko, ed., New York, 1986, Springer-Verlag, pp. 277–301.
R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21 (1978), pp. 120–126.
R. L. Rivest, RSA chips (past/present/future), in Advances in Cryptology-EUROCRYPT’84, T. Beth, N. Cot, and I. Ingemarsson, eds., New York, 1984, Springer-Verlag, pp. 159–168.
H. Sedlak and U. Golze, An RSA cryptography processor, Microprocessing and Microprogramming, 18 (1986), pp. 583–590.
A. Vandemeulebroecke, E. Vanzieleghem, T. Denayer, and P. G. Jespers, A single chip 1024 bits RSA processor. to appear in Advances in Cryptology-EUROCRYPT’89.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brickell, E.F. (1990). A Survey of Hardware Implementations of RSA. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_34
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_34
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive