A High Speed Scalar Multiplier for Binary Edwards Curves

Binary Edwards Curves (BEC) constitute an exciting elliptic curve variation that has very interesting benefits when it comes to side channel attack resistance. However, BECs require more GF(2k) operations for a single scalar multiplication and this acts as a deterring factor for their wide adoption and standardization. In this paper, a high speed BEC scalar multiplication architecture and implementation is proposed based on a parallel design strategy of the GF(2k) operations that provides power analysis attack resistance against a variety of attacks.

[1]  Jean-Sébastien Coron,et al.  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems , 1999, CHES.

[2]  M. Anwar Hasan,et al.  A survey of some recent bit-parallel GF(2n) multipliers , 2015, Finite Fields Their Appl..

[3]  Frédéric Valette,et al.  The Doubling Attack - Why Upwards Is Better than Downwards , 2003, CHES.

[4]  Siva Sai Yerubandi,et al.  Differential Power Analysis , 2002 .

[5]  Indranil Sengupta,et al.  FPGA implementation of extended reconfigurable Binary Edwards Curve based processor , 2012, 2012 International Conference on Computing, Networking and Communications (ICNC).

[6]  JaeCheol Ha,et al.  Relative Doubling Attack Against Montgomery Ladder , 2005, ICISC.

[7]  Ming Gu,et al.  Overlap-free Karatsuba-Ofman polynomial multiplication algorithms , 2010 .

[8]  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.

[9]  Apostolos P. Fournaris,et al.  Comparing design approaches for elliptic curve point multiplication over GF(2k) with polynomial basis representation , 2015, Microprocess. Microsystems.

[10]  Benoit Feix,et al.  Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms , 2007, Selected Areas in Cryptography.

[11]  Indranil Sengupta,et al.  Design of a high performance Binary Edwards Curve based processor secured against side channel analysis , 2012, Integr..

[12]  Qasem Abu Al-Haija,et al.  Cost-effective design for binary Edwards elliptic curves crypto-processor over GF (2N) using parallel multipliers and architectures , 2013, Int. J. Inf. Comput. Secur..

[13]  Tanja Lange,et al.  Binary Edwards Curves , 2008, CHES.

[14]  Reza Azarderakhsh,et al.  Parallel and High-Speed Computations of Elliptic Curve Cryptography Using Hybrid-Double Multipliers , 2015, IEEE Transactions on Parallel and Distributed Systems.

[15]  Benoit Feix,et al.  Side-Channel Analysis on Blinded Regular Scalar Multiplications , 2014, INDOCRYPT.

[16]  Chester Rebeiro,et al.  Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs , 2012, CHES.

[17]  Éliane Jaulmes,et al.  Horizontal collision correlation attack on elliptic curves , 2014, Cryptography and Communications.

[18]  Marc Joye,et al.  The Montgomery Powering Ladder , 2002, CHES.

[19]  Guillaume Fumaroli,et al.  Blinded Fault Resistant Exponentiation , 2006, FDTC.