A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves

Efficient implementation of double point multiplication is crucial for elliptic curve cryptographic systems. We revisit three recently proposed simultaneous double point multiplication algorithms. We propose hardware architectures for these algorithms, and provide a comparative analysis of their performance. We implement the proposed architectures on Xilinx Virtex-4 FPGA, and report on the area and time results . Our results indicate that differential addition chain based algorithms are better suited to compute double point multiplication over binary elliptic curves for both high performance and resource constrained applications. Index Terms Elliptic curve cryptography (ECC), differential addition chains, binary fields, double point multiplication, Field Programmable Gate Array (FPGA).

[1]  D. Bernstein.  Differential addition chains , 2006 .

[2]  Reza Azarderakhsh,et al.  A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms , 2014, IEEE Transactions on Computers.

[3]  Marc Joye,et al.  Exponent Recoding and Regular Exponentiation Algorithms , 2009, AFRICACRYPT.

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

[5]  Martijn Stam,et al.  On Montgomery-Like Representationsfor Elliptic Curves over GF(2k) , 2003, Public Key Cryptography.

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

[7]  C. Paar,et al.  Universal Exponentiation Algorithm – A First Step Towards Provable SPA-resistance – , 2001 .

[8]  Bodo Möller.  Algorithms for Multi-exponentiation , 2001, Selected Areas in Cryptography.

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

[10]  Toru Akishita,et al.  Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form , 2001, Selected Areas in Cryptography.

[11]  Kris Gaj,et al.  Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields , 2009, IEEE Transactions on Computers.

[12]  Scott A. Vanstone,et al.  Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms , 2001, CRYPTO.

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

[14]  Ramlan Mahmod,et al.  A New Addition Formula for Elliptic Curves over GF(2n) , 2002, IEEE Trans. Computers.

[15]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[16]  Michael Scott,et al.  Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves , 2009, Journal of Cryptology.

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

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

[19]  Reza Azarderakhsh,et al.  High-Performance Implementation of Point Multiplication on Koblitz Curves , 2013, IEEE Transactions on Circuits and Systems II: Express Briefs.

[20]  Alfred Menezes,et al.  Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields , 2009, IEEE Transactions on Computers.

[21]  Alfred Menezes,et al.  Field inversion and point halving revisited , 2004, IEEE Transactions on Computers.