Higher radix nonrestoring modular multiplication algorithm and public-key LSI architecture with limited hardware resources

  • Masayuki Abe
  • Hikaru Morita
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 917)


Security applications to be installed in small size hardware such as cellular phones and smart cards need a small and practical LSI for key distribution or authentication. This paper describes an improved modular multiplication algorithm and LSI architecture for public-key schemes with the goal of limiting hardware resources. The algorithm, which employs higher radix arithmetic, eliminates the slow restoring which occurs in modular multiplication. The proposed architecture is based on the use of RAM and low operation frequency. The LSI is designed to calculate 512 bit modular exponentiation within 0.1 seconds at the frequency of 17 MHz. This requires only 13 Kgates and six 512bit RAMs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BC89]
    J. Bos and M. Coster: “Addition Chain Heuristics,” Advances in Cryptology-CRYPTO '89, LNCS 435, Springer-Verlag, pp.400–407, 1989Google Scholar
  2. [BGMW92]
    E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson: “Fast Exponentiation with Precomputation (Extended Abstract),” Advances in Cryptology-EUROCRYPT '92, LNCS 658, Springer-Verlag, pp.200–207, 1992Google Scholar
  3. [BGV93]
    A. Bosselaers, R. Govaerts, and J. Vandewalle: “Comparison of three modular reduction functions,” Advances in Cryptology-CRYPTO'93, LNCS 773, Springer-Verlag, pp.175–186, 1993Google Scholar
  4. [Bri89]
    E. F. Brickell: “A Survey of Hardware Implementations of RSA,” Advances in Cryptology-CRYPTO'89, LNCS 435, Springer-Verlag, pp.368–370, 1989Google Scholar
  5. [Bri82]
    E.F. Brickell: “A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography,” Advances in Cryptology-CRYPTO'82, pp.51–60,Plenum, 1982.Google Scholar
  6. [DH76]
    W. Diffie and M.E. Hellman: “New Directions in Cryptography,” IEEE Transaction of Information Theory, vol. IT-22, no.6,pp. 644–654, Nov. 1976Google Scholar
  7. [DK90]
    S.R. Dusse and B.S. Kaliski Jr.: “A Cryptographic Library for the Motorola DSP56000,” Advances in Cryptology-EUROCRYPT'90, LNCS473, pp.230–244, Springer-Verlag, 1991Google Scholar
  8. [HDVG88]
    F. Hoornaert, M. Decroos,J. Vandewalle, and R. Govaerts: “Fast RSA-Hardware: Dream or Reality?” Advances in Cryptology-EUROCRYPT '88, LNCS 330, Springer-Verlag, pp.257–264, 1988Google Scholar
  9. [Hw79]
    K.Hwang: Computer Arithmetic: Principles, Architecture and Design, John Wiley & Sons, 1979Google Scholar
  10. [IMI92]
    K. Iwamura, T. Matumoto, and H.Imai: “High-Speed Implementation Methods for RSA Scheme,” Advances in Cryptology-EUROCRYPT'92, LNCS 658, Springer-Verlag, pp.221–238Google Scholar
  11. [IWMD92]
    P. Ivey, S. Walker, J. Stern, and S. Davidson: “An Ultra-High Speed Public Key Encryption Processor,” IEEE 1992 Custom Integrated Circuits Conference, 1992Google Scholar
  12. [Knu81]
    D. E. Knuth: The Art of Computer Programming — Seminumerical Algorithms, vol.2, Addison — Westley, second edition, 1981.Google Scholar
  13. [MY93]
    H.Morita, C.H.Yang: “A Modular-Multiplication Algorithm Using Lookahead Determination,” IEICE Transaction of fundamentals, vol. E76-A, no.l, pp. 70–77, Jan. 1993Google Scholar
  14. [NONN90]
    Y.Nakamura, K.Oguri, A.Nagoya, and R.Nomura: “A Hierarchical Behavioral Description Based CAD System,” Proceedings of IFIP EURO ASIC '90, pp.282–287, May. 1990Google Scholar
  15. [RSA78]
    R.L. 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.Google Scholar
  16. [VLSI92]
    VLSI Technology, Inc. “VSC470 Library,” VSD13881, and “0.8-Micron Datapath Library (VCC4DP3),” VSD13940, 1992Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Masayuki Abe
    • 1
  • Hikaru Morita
    • 1
  1. 1.NTT Information and Communication Systems LaboratoriesKanagawaJapan

Personalised recommendations