A Review of Techniques for Implementing Elliptic Curve Point Multiplication on Hardware

Cryptography is considered indispensable among security measures applied to data concerning insecure means of transmission. Among various existent algorithms on asymmetric cryptography, we may cite Elliptic Curve Cryptography (ECC), which has been widely used due to its security level and reduced key sizes. When compared to Rivest, Shamir and Adleman (RSA), for example, ECC can maintain security levels with a shorter key. Elliptic Curve Point Multiplication (ECPM) is the main function in ECC, and is the component with the highest hardware cost. Lots of ECPM implementations have been applied on hardware targeting the acceleration of its calculus. This article presents a systematic review of literature on ECPM implementations on both Field-Programmable Gate Array (FPGA) and Application-Specific Integrated Circuit (ASIC). The obtained results show which methods and technologies have been used to implement ECPM on hardware and present some findings of the choices available to the hardware designers.

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

[2]  J. Silverman.  Advanced Topics in the Arithmetic of Elliptic Curves , 1994 .

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

[4]  Sheetal Kalra,et al.  Elliptic curve cryptography for real time embedded systems in IoT networks , 2016, 2016 5th International Conference on Wireless Networks and Embedded Systems (WECON).

[5]  Chengqing Li,et al.  When an attacker meets a cipher-image in 2018: A Year in Review , 2019, J. Inf. Secur. Appl..

[6]  Henk Corporaal,et al.  Embedded System Design , 2006 .

[7]  Ingrid Verbauwhede,et al.  Implementation of binary edwards curves for very-constrained devices , 2010, ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors.

[8]  Marc Joye,et al.  Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults , 2005, Des. Codes Cryptogr..

[9]  Mohammed Benaissa,et al.  Throughput/Area-efficient ECC Processor Using Montgomery Point Multiplication on FPGA , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

[10]  Patrick Schaumont,et al.  State-of-the-art of secure ECC implementations: a survey on known side-channel attacks and countermeasures , 2010, 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST).

[11]  Faisal,et al.  Text Encryption in Android Chat Applications using Elliptical Curve Cryptography (ECC) , 2018 .

[12]  Moath Jarrah,et al.  FPGA Implementation of the ECC Over GF(2m) for Small Embedded Applications , 2019, ACM Trans. Embed. Comput. Syst..

[13]  Yinan Kong,et al.  Parallel point-multiplication architecture using combined group operations for high-speed cryptographic applications , 2017, PloS one.

[14]  R.K. Pateriya,et al.  Elliptic Curve Cryptography in Constrained Environments: A Review , 2011, 2011 International Conference on Communication Systems and Network Technologies.

[15]  Bahram Rashidi,et al.  High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems , 2016, Microelectron. J..

[16]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[18]  Emilia Käsper.  Fast Elliptic Curve Cryptography in OpenSSL , 2011, Financial Cryptography Workshops.

[19]  Vivek Kapoor,et al.  Elliptic curve cryptography , 2008, UBIQ.

[20]  FarashahiReza Rezaeian,et al.  High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems , 2016 .

[21]  Marc Joye,et al.  Efficient Arithmetic on Hessian Curves , 2010, Public Key Cryptography.

[22]  Marc Joye,et al.  Binary Huff Curves , 2011, CT-RSA.

[23]  Dhiraj K. Pradhan,et al.  On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography , 2007, TQC.

[24]  Mohammed Benaissa,et al.  High-Speed and Low-Latency ECC Processor Implementation Over GF( $2^{m})$ on FPGA , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[25]  Divya Kiran,et al.  Design of speed and power efficient multipliers using vedic mathematics with VLSI implementation , 2014, 2014 International Conference on Advances in Electronics Computers and Communications.

[26]  Seok-Bum Ko,et al.  Flexible elliptic curve cryptography coprocessor using scalable finite field arithmetic blocks on FPGAs , 2018, Microprocess. Microsystems.

[27]  Turki F. Al-Somani,et al.  High-Performance Generic-Point Parallel Scalar Multiplication , 2017 .

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

[29]  Alfred Menezes,et al.  Elliptic curve cryptosystems and their implementation , 1993, Journal of Cryptology.

[30]  Zhe Li,et al.  Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves , 2019, IEEE Access.

[31]  Shuguo Li,et al.  High-Performance Pipelined Architecture of Point Multiplication on Koblitz Curves , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[32]  Motilal Singh Khoirom,et al.  Cryptanalysis of multimedia encryption using elliptic curve cryptography , 2018, Optik.

[33]  Raziyeh Salarifard,et al.  A Low-Latency and Low-Complexity Point-Multiplication in ECC , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[34]  N. P. Kumar,et al.  An area-efficient ECC architecture over GF(2m) for resource-constrained applications , 2020 .

[35]  San C. Vo.  A Survey of Elliptic Curve Cryptosystems, Part I: Introductory , 2003 .

[36]  Zilong Liu,et al.  An Efficient and Flexible Hardware Implementation of the Dual-Field Elliptic Curve Cryptographic Processor , 2017, IEEE Transactions on Industrial Electronics.

[37]  Gaurav Kumar Tak,et al.  Secure Medical Data Transmission by Using ECC with Mutual Authentication in WSNs , 2015 .

[38]  B. K. Kipkirui.  Elliptic Curve Digital Signatures and Their Application in the Bitcoin Crypto-currency Transactions , 2017 .

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

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

[42]  Muhammad Najam-ul-Islam,et al.  ACryp-Proc: Flexible Asymmetric Crypto Processor for Point Multiplication , 2018, IEEE Access.

[43]  J. Pollard.  A monte carlo method for factorization , 1975 .

[44]  Najlae Falah Hameed Al Saffar,et al.  Improved arithmetic on elliptic curves over prime field , 2014 .