An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding

In this paper we present an efficient design technique for implementing the elliptic curve cryptographic (ECC) scheme in FPGAs. Our technique is based on a novel and efficient implementation of modular multiplication which is the core operation of ECC. To implement large bit-length multiplications we used a novel partitioning and pipeline folding scheme to fit at least 256-bit modular multiplications on a single Virtex-4 FPGA. Comparisons to several other schemes are presented.

[1]  H. Thapliyal,et al.  A High Speed and Efficient Method of Elliptic Curve Encryption Using Ancient Indian Vedic Mathematics , 2005 .

[2]  Máire O'Neill,et al.  FPGA Montgomery modular multiplication architectures suitable for ECCs over GF(p) , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[3]  Tibor Juhas.  The use of elliptic curves in cryptography , 2007 .

[4]  Ingrid Verbauwhede,et al.  Fpga-Oriented Secure Data Path Design: Implementation of a Public Key Coprocessor , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[5]  Miguel Morales-Sandoval,et al.  On the hardware design of an elliptic curve cryptosystem , 2004, Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004..

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

[7]  Masaaki Shirase,et al.  An architecture for elliptic curve cryptograph computation , 2005, CARN.

[8]  Gang Quan,et al.  High-level synthesis for large bit-width multipliers on FPGAs: a case study , 2005, 2005 Third IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS'05).

[9]  Richard E. Crandall,et al.  Elliptic Curve Arithmetic , 2001 .