High-Speed, Area-Efficient, FPGA-Based Elliptic Curve Cryptographic Processor over NIST Binary Fields

In this paper we propose a high-performance FPGA-based implementation of an elliptic curve cryptographic (ECC) processor over binary field GF(2m) for modern cryptographic applications. A high-speed elliptic curve scalar multiplier (ECSM) is designed using an efficient finite-field arithmetic unit, where ECSM is the main operation of an ECC processor. It has been implemented in an affine coordinate system using a polynomial basis. The implemented design is synthesized in field-programmable gate array (FPGA) technology. The ECSM time in a modern Xilinx Kintex-7 FPGA is 2.66 ms at 255.66 MHz and 5.54 ms at 251.98 MHz for the field size of GF(2233) and GF(2283) respectively. Simulation results show that the implemented design is area-efficient, as it contains only 3016 slices for the field F2233 and 4625 slices for the field F2283. To the best of the authors' knowledge, the proposed ECC processor shows better performance than the available hardware implementations.

[1]  Braden Phillips,et al.  Fast Scaling in the Residue Number System , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Alfred Menezes,et al.  Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.

[3]  Christof Paar,et al.  A High Performance Reconfigurable Elliptic Curve Processor for GF(2m) , 2000, CHES.

[4]  Lotfi Kamoun,et al.  Elliptic curve cryptography for WSN and SPA attacks method for energy evaluation , 2014, J. Networks.

[5]  Yinan Kong,et al.  Highly parallel modular multiplication in the residue number system using sum of residues reduction , 2010, Applicable Algebra in Engineering, Communication and Computing.

[6]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[7]  Christof Paar,et al.  Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography , 2015, Journal of Cryptology.

[8]  Máire O'Neill,et al.  An Adaptable And Scalable Asymmetric Cryptographic Processor , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

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

[10]  Mohsen Machhout,et al.  Coupled FPGA/ASIC Implementation of Elliptic Curve Crypto-Processor , 2010, International journal of Network Security & Its Applications.

[11]  Johannes Wolkerstorfer,et al.  Dual-Field Arithmetic Unit for GF(p) and GF(2m) , 2002, CHES.

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

[13]  Tarek A. El-Ghazawi,et al.  Implementation of Elliptic Curve Cryptosystems on a reconfigurable computer , 2003, Proceedings. 2003 IEEE International Conference on Field-Programmable Technology (FPT) (IEEE Cat. No.03EX798).

[14]  Dong Xiang-Jun,et al.  FPGA Based Design of Elliptic Curve Cryptography Coprocessor , 2007, Third International Conference on Natural Computation (ICNC 2007).

[15]  Xiaoyang Zeng,et al.  A reconfigurable public-key cryptography coprocessor , 2004, Proceedings of 2004 IEEE Asia-Pacific Conference on Advanced System Integrated Circuits.

[16]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[17]  Chin-Liang Wang,et al.  Systolic Array Implementation o Euclid's Algorithm for Inversion and Division in GF(2m) , 1998, IEEE Trans. Computers.

[18]  Jean-Pierre Deschamps,et al.  Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations , 2013, IEEE Transactions on Industrial Electronics.

[19]  Mohammed Benaissa,et al.  Efficient Time-Area Scalable ECC Processor Using µ-Coding Technique , 2010, WAIFI.

[20]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.