Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware Resources

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.

[1]  Hikaru Morita,et al.  A Modular-Multiplication Algorithm using Lookahead Determination , 1993 .

[2]  Matthijs J. Coster,et al.  Addition Chain Heuristics , 1989, CRYPTO.

[3]  Ernest F. Brickell,et al.  Fast Exponentiation with Precomputation (Extended Abstract) , 1992, EUROCRYPT.

[4]  S. Davidson,et al.  An Ultra-high Speed Public Key Encryption Processor , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[5]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[6]  Ernest F. Brickell,et al.  A Survey of Hardware Implementation of RSA (Abstract) , 1989, CRYPTO.

[7]  Joos Vandewalle,et al.  Fast RSA-Hardware: Dream or Reality? , 1988, EUROCRYPT.

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  A. Nagoya,et al.  A hierarchical behavioural description based CAD system , 1990, [Proceedings] EURO ASIC `90.

[10]  Burton S. Kaliski,et al.  A Cryptographic Library for the Motorola DSP56000 , 1991, EUROCRYPT.

[11]  Ernest F. Brickell,et al.  A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography , 1982, CRYPTO.

[12]  Hikaru Morita,et al.  A Modular-Multiplication Algorithm Using Lookahead Determination (Special Section on Cryptography and Information Security) , 1993 .

[13]  Joos Vandewalle,et al.  Comparison of Three Modular Reduction Functions , 1993, CRYPTO.

[14]  Hideki Imai,et al.  High-Speed Implementation Methods for RSA Scheme , 1992, EUROCRYPT.