Brief Abstract
We review the issues involved in building a special-purpose chip for performing RSA encryption/decryption, and review a few of the current implementation efforts.
This rescarch was supportcd by NSF grant MCS-80-06938.
Chapter PDF
References
Alexi, W., B. Chor, O. Goldreich, and C. P. Schnor, “RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure,” Proc. 25th Annual IEEE Symposium on Foundations of Computer Science, (Singer Island, 1984).
Brickell, E. F., “A Fast Modular Multiplication Algorithm with Applications to Two-Key Cryptography,” Advances in Cryptology — Proceedings of CRYPTO 82, (ed. by Chaum et. al) (Plenum 1983), 51–60.
Denning, D. CRYPTOGRAPHY AND DATA SECURITY, (Addison-Wesley, Reading, Mass., 1982).
Diffie, W. and M. E. Hellman, “New Directions in Cryptography”, IEEE Trans. Info. Theory IT-22 (Nov. 1976), 644–654.
Diffie, W. and M. E. Hellman, “Privacy and Authentication: An Introduction to Cryptography, Proc. of the IEEE 67,3 (March 1979), 397–427.
Knuth, Donald E., SEMINUMERICAL ALGORITHMS — The Art of Computer Programming (Vol. 2 — Second Edition), (Addison-Wesley 1981).
Miyaguchi, S., “Fast Encryption Algorithm for the RSA Cryptographic System,” Proceedings COMPCON 82.
Rabin, Michael. “Digitalized Signatures as Intractable as Factorization,” MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-212 (Jan. 1979).
Rivest, R. L., “A Description of a Single-Chip Implementation of the RSA Cipher,” Lambda 1 (Fourth Quarter 1980), 14–18.
Rivest, R., A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. of the ACM (Feb. 1978), 120–126.
RSA Security, Inc. (1717 Karameos Drive, Sunnyvale, CA 94087) “Preliminary Data Sheet for the RSA Cryptochip,” (1984).
Rieden, R. F., J. B. Snyder, R. J. Widman, and W. J. Barnard, “A Two-Chip Implementation of the RSA Public-Key Encryption Algorithm,” Digest of Papers for the 1982 Government Microciruit Applications Conference (November 1982), 24–27.
Williams, H. C., “A Modification of the RSA Public-Key Cryptosystem,” IEEE Trans. Info. Theory IT-26 (Nov. 1980), 726–729.
Williams, H. C., “Some Public-Key Crypto-Functions as Intractable as Factorization,” Proceedings of CRYPTO 84 (Springer 1984).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rivest, R.L. (1985). RSA Chips (Past/Present/Future) (Extended abstract). In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive