Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs

In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High speeds are achieved by boosting the operating clock frequency while at the same time reducing the number of clock cycles required to do a scalar multiplication. To increase clock frequency, the design uses optimized implementations of the underlying field primitives and a mathematically analyzed pipeline design. To reduce clock cycles, a new scheduling scheme is presented that allows overlapped processing of scalar bits. The resulting scalar multiplier is the fastest reported implementation for generic curves over binary finite fields. Additionally, the optimized primitives leads to area requirements that is significantly lesser compared to other high-speed implementations. Detailed implementation results are furnished in order to support the claims.

[1]  Jianhua Huang,et al.  A Microcoded Elliptic Curve Processor for GF(2m) Using FPGA Technology , 2006, 2006 International Conference on Communications, Circuits and Systems.

[2]  Francisco Rodríguez-Henríquez,et al.  A parallel architecture for fast computation of elliptic curve scalar multiplication over GF(2/sup m/) , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  William M. Daley,et al.  Digital Signature Standard (DSS) , 2000 .

[4]  M. Anwar Hasan,et al.  High performance FPGA based elliptic curve cryptographic co-processor , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[5]  Chester Rebeiro,et al.  Revisiting the Itoh-Tsujii Inversion Algorithm for FPGA Platforms , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Vipul Gupta,et al.  An End-to-End Systems Approach to Elliptic Curve Cryptography , 2002, CHES.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[9]  Soonhak Kwon,et al.  FPGA implementation of high performance elliptic curve cryptographic processor over GF , 2008, J. Syst. Archit..

[10]  Kimmo Järvinen,et al.  On Repeated Squarings in Binary Fields , 2009, Selected Areas in Cryptography.

[11]  M. Anwar Hasan,et al.  High-Performance Architecture of Elliptic Curve Scalar Multiplication , 2008, IEEE Transactions on Computers.

[12]  Chester Rebeiro,et al.  Theoretical modeling of the Itoh-Tsujii Inversion algorithm for enhanced performance on k-LUT based FPGAs , 2011, 2011 Design, Automation & Test in Europe.

[13]  尚弘 島影.  National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[14]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[15]  Chester Rebeiro,et al.  High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms , 2008, INDOCRYPT.

[16]  Christof Paar,et al.  Cryptographic Hardware and Embedded Systems - CHES 2002 , 2003, Lecture Notes in Computer Science.

[17]  Christof Paar,et al.  Cryptographic Hardware and Embedded Systems - CHES 2006, 8th International Workshop, Yokohama, Japan, October 10-13, 2006, Proceedings , 2006, CHES.

[18]  Vincent Rijmen,et al.  Progress in Cryptology - INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India, December 14-17, 2008. Proceedings , 2008, INDOCRYPT.

[19]  Reza Azarderakhsh,et al.  Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[20]  Christof Paar,et al.  Security on FPGAs: State-of-the-art implementations and attacks , 2004, TECS.

[21]  ItohToshiya,et al.  A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases , 1988 .

[22]  Kimmo Järvinen,et al.  On Parallelization of High-Speed Processors for Elliptic Curve Cryptography , 2008, IEEE Trans. Very Large Scale Integr. Syst..

[23]  Chang Hoon Kim,et al.  High Performance Elliptic Curve Cryptographic Processor Over GF(2^163) , 2008, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008).

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

[25]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[26]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[27]  Mohammed Benaissa,et al.  Fast Elliptic Curve Cryptography on FPGA , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[28]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[29]  Jürgen Teich,et al.  Reconfigurable implementation of elliptic curve crypto algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[30]  Chester Rebeiro,et al.  Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier , 2008, 21st International Conference on VLSI Design (VLSID 2008).