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.

• Type: Conference
• Year: 2007
• Where: IOLTS
• Authors: Osama Al-Khaleel, Christos A. Papachristou, Francis G. Wolff, Kiamal Z. Pekmestzi
• Keywords: 256-bit Modular Multiplications, IOLTS 2007, Large Bit-length Multiplications, Modular Multiplications, Software Engineering