The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2007 vol.56)
pp: 1308-1319
ABSTRACT
Large integer Modular Multiplication and Exponentiation (MM and ME) are the foundation of most publickey cryptosystems, specifically RSA, Diffie-Helleman, ElGamal and the Elliptic Curve Cryptosystems. Thus MM algorithms have been studied widely and extensively. Most of the work is based on the well known Montgomery Multiplication Method and its variants, which require standard multiplication operations. Despite their better complexity orders, Karatsuba and FFT algorithms seem to be rarely used for hardware implementation. In this paper, we review their hardware complexity and propose original implementations of MM and ME that become useful for 24-bit operators (Karatsuba algorithm) or 373-bit operators (FFT algorithm).
INDEX TERMS
Cryptography, Multiplication, Modular Arithmetic, Hardware Complexity
CITATION
Jean Pierre David, Kassem Kalach, Nicolas Tittley, "Hardware Complexity of Modular Multiplication and Exponentiation", IEEE Transactions on Computers, vol.56, no. 10, pp. 1308-1319, October 2007, doi:10.1109/TC.2007.1084
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool