Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing

The aim of Elliptic Curve Cryptosystems (ECC) is to achieve the same security level as RSA but with shorter key size. The basic operation in the ECC is scalar multiplication which is an expensive operation. In this paper, we focus on optimizing ECC scalar multiplication based on Non-Adjacent Form (NAF). A new algorithm is introduced that combines an Add-Subtract Scalar Multiplication Algorithm with NAF representation to accelerate the performance of the ECC calculation. Parallelizing the new algorithm shows an efficient method to calculate ECC. The proposed method has speed up the calculation up to 60% compared with the standard method.

[1]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[2]  Manju Sanghi,et al.  Speeding up Computation of Scalar Multiplication in , 2010 .

[3]  Randall K. Nichols.  ICSA guide to cryptography , 1998 .

[4]  Chin-Chen Chang,et al.  Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements , 2003, 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003..

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

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

[7]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[8]  Zhe Liu,et al.  Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for 8-bit AVR-Based Sensor Nodes , 2016, IEEE Transactions on Information Forensics and Security.

[9]  Yinan Kong,et al.  Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System , 2017, Circuits Syst. Signal Process..

[10]  Tsuyoshi Takagi,et al.  Signed Binary Representations Revisited , 2004, CRYPTO.

[11]  Adnan Abdul-Aziz Gutub,et al.  Remodeling of Elliptic Curve Cryptography Scalar Multiplication Architecture using Parallel Jacobian Coordinate System , 2010 .

[12]  Hsie-Chia Chang,et al.  A high-performance elliptic curve cryptographic processor over GF(p) with SPA resistance , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[13]  Hans Eberle,et al.  Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.

[14]  S. M. García,et al.  2014: , 2020, A Party for Lazarus.

[15]  P. Balasubramaniam,et al.  Elliptic curve scalar multiplication algorithm using complementary recoding , 2007, Appl. Math. Comput..

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

[17]  J. Solinas.  Low-Weight Binary Representations for Pairs of Integers , 2001 .

[18]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .

[19]  Jean-Marc Robert,et al.  Parallelized Software Implementation of Elliptic Curve Scalar Multiplication , 2014, Inscrypt.

[20]  Azman Samsudin,et al.  Parallel method for computing elliptic curve scalar multiplication based on MOF , 2014, Int. Arab J. Inf. Technol..

[21]  Xu Huang,et al.  Minimizing hamming weight based on 1's complement of binary numbers over GF(2m) , 2010, 2010 The 12th International Conference on Advanced Communication Technology (ICACT).

[22]  Christophe Nègre,et al.  Parallel approaches for efficient scalar multiplication over elliptic curve , 2015, 2015 12th International Joint Conference on e-Business and Telecommunications (ICETE).

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

[24]  Kazuhiro Yokoyama,et al.  Elliptic curve cryptosystem , 2000 .

[25]  Kittiphon Phalakarn,et al.  Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication , 2018, Int. J. Netw. Comput..

[26]  Tang Ming . Wei Lian. Si Tuo Lin Si,et al.  Cryptography and Network Security - Principles and Practice , 2015 .

[27]  Huapeng Wu,et al.  Parallel scalar multiplication for elliptic curve cryptosystems , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[28]  Patrick Schaumont,et al.  SIMD acceleration of modular arithmetic on contemporary embedded platforms , 2013, 2013 IEEE High Performance Extreme Computing Conference (HPEC).