Hardware Elliptic Curve Cryptographic Processor Over$rm GF(p)$
Authors:
- C.J. McivorCMC.J. Mcivor
- M. MclooneMMM. Mcloone
- J.V. MccannyJMJ.V. Mccanny
- 18 September 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 53 (9) , 1946-1957
Abstract
A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applicationsKeywords
This publication has 23 references indexed in Scilit:
- A scalable dual-field elliptic curve cryptographic processorIEEE Transactions on Computers, 2003
- The Montgomery modular inverse-revisitedIEEE Transactions on Computers, 2000
- Montgomery exponentiation needs no final subtractionsElectronics Letters, 1999
- Efficient algorithms for elliptic curve cryptosystems1997
- Fast Key Exchange with Elliptic Curve Systems1995
- The Montgomery inverse and its applicationsIEEE Transactions on Computers, 1995
- An implementation of elliptic curve cryptosystems over F/sub 2/155IEEE Journal on Selected Areas in Communications, 1993
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978