GF (2m) Based Low Complexity Multiplier for Elliptic Curve Cryptography Systems
K. Rajadurga, Sanjay Kumar · CiiT international journal of networking and communication engineering · 2014
This study presents a low complexity multiplier for elliptic curve cryptography system over the GF (2m). One of the basis of polynomial basis in Galois field is used to design the cryptography system. This paper presents an area-time efficient systolic structure for multiplication to the elliptic curve cryptography (ECC). Elliptic curve cryptography requires smaller key size, high speed and low bandwidth. It is provide the same security level like RSA in public key cryptography. Systolic structures are used to design the proposed multipliers. This proposed multipliers have low hardware requirements and regular structures; and they are suitable for VLSI implementations. The proposed design provides less area-delay and power-delay complexities over the existing designs. This low complexity multiplier based elliptic curve cryptography will be implemented using FPGA device.