Analysis of Efficient Implementation of Elliptic Curve Cryptography Architecture for Resource Constraint Application
Kirit V. Patel1, Mihir V. Shah2

1Kirit V. Patel*, Department of Electronics and Communication, L.D. College of Engineering, Gujarat Technological University, Ahmedabad (Gujarat), India.
2Dr. Mihir V. Shah, Department of Electronics and Communication, L.D. College of Engineering, Gujarat Technological University, Ahmedabad (Gujarat), India.
Manuscript received on March 24, 2021. | Revised Manuscript received on October 18, 2021. | Manuscript published on October 30, 2021. | PP: 28-35 | Volume-10 Issue-12, October 2021. | Retrieval Number: 100.1/ijitee.F87010410621 | DOI: 10.35940/ijitee.F8701.10101221
Open Access | Ethics and  Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Elliptic Curve Cryptography is gaining attraction in providing a high security level in data transmission with low cost, small key size and smaller hardware realization. High-speed implementation is a significant factor in ECC applications such as smart cards, network servers, wireless sensor based networks, Internet of Things and Radio Frequency Identification. These applications require low-cost and lightweight implementations. In the resource constrain application, lightweight cryptography has emerged as the desired one because of limited energy in devices and the scarce computational resources. Design options and a wide range of parameters affect the overall implementation of the ECC system. Implementation target device, coordinate system, underlying finite fields and modular arithmetic algorithms are key design parameters that impact the overall implementation outcome. A statistical study is conducted on a large collection of published work based on the design parameters. The basic question that arises is how to select the appropriate flexibility-efficiency tradeoff. The subjects of generator, versatile, reconfigurable, dedicated and general purpose scalar multipliers are addressed. A review of various algorithms to perform scalar multiplication on prime and binary fields has been done more effectively. The results of ECC implementation on different FPGA platform is compared and analyzed with the various performance parameters. Besides, a classification of the previous works in terms of flexibility, performance, scalability and cost effectiveness is presented.
Keywords: Elliptic Curve Cryptography (ECC), Galois Field (GF), Discrete Logarithm Problem (DLP), Scalar multiplication, Public Key Cryptography (PKC), Field Programmable Gate Array (FPGA), Elliptic Curve Cryptography Processor (EECP), Elliptic Curve Scalar Multiplication (ECSM).