Fast Modular Division for Application in ECC on Reconfigurable Logic

Elliptic Curve Public Key Cryptosystems are becoming increasingly popular for use in mobile devices and applications where bandwidth and chip area are limited. They provide much higher levels of security per key length than established public key systems such as RSA. The underlying operation of elliptic curve point multiplication requires modular multiplication, division/inversion and addition/subtraction. Division is by far the most costly operation in terms of speed. This paper proposes a new divider architecture and implementation on FPGA for use in an ECC processor.

[1]  Sorin A. Huss,et al.  A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n) , 2002, CHES.

[2]  S. C. Shantz.  From Euclid's GCD to Montgomery Multiplication to the Great Divide , 2001 .

[3]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

[4]  Erkay Savas,et al.  Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2) , 2002, CHES.

[5]  Christof Paar,et al.  A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware , 2001, CHES.

[6]  Adnan Abdul-Aziz Gutub,et al.  Scalable VLSI architecture for GF(p) Montgomery modular inverse computation , 2002, Proceedings IEEE Computer Society Annual Symposium on VLSI. New Paradigms for VLSI Systems Design. ISVLSI 2002.

[7]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[8]  William P. Marnane,et al.  Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic , 2002, FPGA '02.

[9]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[10]  Hikaru Morita,et al.  Fast Modular Inversion Algorithm to Match Any Operation Unit , 1999 .

[11]  Erkay Savas,et al.  The Montgomery Modular Inverse-Revisited , 2000, IEEE Trans. Computers.

[12]  Burton S. Kaliski,et al.  The Montgomery Inverse and Its Applications , 1995, IEEE Trans. Computers.

[13]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[14]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[15]  Tim Kerins,et al.  Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2) , 2002, FPL.