Abstract
This paper describes some recently successful results in the CMOS VLSI implementation of public-key data encryption algorithms. Architectural details, circuits, and prototype test results are presented for RSA encryption and multiplication in the finite field GF(2m). These designs emphasize high throughput and modularity. An asynchronous modulo multiplier is described which permits a significant improvement in RSA encryption throughput relative to previously described synchronous implementations.
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.
8. References
W. Diffie and M. Hellman, “New Directions in Cryptography”, IEEE Trans. Info. Theory, Vol. IT-22(6), pp. 644–659, Nov. 1976.
R.L. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Comm. of the ACM, Vol. 21, No. 2, pp 120–126, Feb. 1978.
D. Denning, “Cryptography and Data Security”, Reading, Mass.: Addison-Wesley Publ. Co., 1982.
R.L. Rivest, “RSA Chips (Past/Present/Future)”, Advances in Cryptology, Proc. of EUROCRYPT 84, pp. 159–165, Springer-Verlag, Berlin, 1985.
M. Kochanski, “Developing an RSA Chip”, Proc. of CRYPTO 85, Santa Barbara, CA., Aug. 1985.
CYLINK, “Advance Data Sheet: CY1024 Key Management Processor”, CYLINK, 920 West Fremont Ave., Sunnyvale, California 94087, 1986.
E.F. Brickell, “A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography”, Proceedings of CRYPTO 82, Santa Barbara, California, pp. 51–60, August 1982.
G.A. Orton, L.E. Peppard, and S.E. Tavares, “A Fast Asynchronous RSA Chip”, IEEE Custom Integrated Circuits Conference, Rochester, N.Y., pp. 439–443, May 12–15, 1986.
W.W. Peterson and E.J. Weldon, “Error-Correcting Codes”, Cambridge, MA: MIT Press, 1972.
A.M. Odlyzko, “Discrete Logarithms in Finite Fields and Their Cryptographic Significance”, Advances in Cryptology, Proc. of EUROCRYPT 84, pp. 225–314, Springer-Verlag, Berlin, 1985.
I.F. Blake, R. Fuji-Hara, R. Mullin and S. Vanstone, “Computing Logarithms in Finite-Fields of Characteristic Two”, SIAM J. Alg. Discr. Methods, Vol. 5, pp. 276–285, 1984.
P.A. Scott, S.E. Tavares and L.E. Peppard, “A Fast VLSI Multiplier for GF(2m)”, IEEE Journal on Selected Areas in Comm., Vol. SAC-4, pp. 62–66, January 1986.
G.R. Blakely, “A Computer Algorithm for Calculating the Product AB Modulo M”, IEEE Trans. Computers, Vol. C-32, pp. 497–500, May 1983.
R.L. Rivest, “A Description of a Single-Chip Implementation of the RSA Cipher”, Lambda (Fourth Quarter 1980) pp. 14–18.
D. Simmons and S.E. Tavares, “An NMOS Implementation of a Large Number Multiplier for Data Encryption Systems”, Proc. 1983 Custom Integrated Circuits Conf., Rochester, N.Y., pp. 262–266, May 1983.
M.P. Roy, L.E. Peppard and S.E. Tavares, “A CMOS Bit-Slice Implementation of the RSA Public-Key Encryption Algorithm”, 1985 Canadian Conference on Yary Large Scale Integration, Toronto, Canada, pp. 52–56, November 1985.
S. Waser and A. Peterson, “Real-time Processing Gains Ground with Fast Digital Multiplier”, Electronics, pp. 93–99, September 29, 1977.
N. Weste and K. Eshraghian, “The Principles of CMOS VLSI Design: A Systems Perspective”, Addison-Wesley, 1985.
A.B. Hayes, “Self-Timed IC Design with PPL’s”, Third Caltech Conference on VLSI, Computer Science Press, Inc., Rockville, Maryland, 1983, pp. 257–274.
T.J. Chaney and F.U. Rosesenberger, “Characterization and Scaling Of MOS Flip Flop Performance in Synchronizer Applications”, Proceedings of the First Caltech Conference on VLSI, 1979.
C.L. Seitz, “Self-Timed VLSI Systems”, Proceedings of the First Caltech Conference on VLSI, pp. 345–354, January 1979.
D.R. Brown, “Optimization of On-Chip Input/Output Interfacing Circuitry for VLSI Systems”, M.Sc. Thesis, Department of Electrical Engineering, Queen’s University, July 1985.
K. Culik II, Jürgensen, K. Mak, “Systolic Tree Architecture for some Standard Functions”, Report 140, Dept. of Computer Science, University of Western Ontario.
T.C. Bartee and D.I. Schneider, “Computation with Finite Fields”, Inform. and Control 6, pp. 79–98, 1963.
C.S. Yeh, I.S. Reed, and T.K. Truong, “Systolic Multipliers for Finite Fields GF(2m)”, IEEE Trans. Comput., vol. C-33, pp. 357–360, April 1984.
C.C. Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura, and I.S. Reed, “VLSI Architectures for Computing Multiplications and Inverses in GF(2m)”, IEEE Trans. Comput., vol. C-34, pp. 709–717, Aug. 1985.
B.A. Laws, Jr. and C.K. Rushforth, “A Cellular-Array Multiplier for GF(2m)”, IEEE Trans. Comput., vol. C-20, pp. 1573–1578, Dec. 1971.
G.A. Orton, M.P. Roy, P.A. Scott, L.E. Peppard, and S.E. Tavares, “New Results in Mapping Data Encryption Algorithms into VLSI”, presented at the Fourth Int. Workshop on VLSI in Comm., Ottawa, Ont., June 1986.
T.W. Williams and K.P. Parker, “Design for Testability — a Survey”, Proc. IEEE, vol. 71, pp. 98–112, Jan. 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orton, G.A., Roy, M.P., Scott, P.A., Peppard, L.E., Tavares, S.E. (1987). VLSI implementation of public-key encryption algorithms. In: Odlyzko, A.M. (eds) Advances in Cryptology — CRYPTO’ 86. CRYPTO 1986. Lecture Notes in Computer Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47721-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-47721-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18047-0
Online ISBN: 978-3-540-47721-1
eBook Packages: Springer Book Archive