A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
High-Performance FPGA Implementation of Elliptic Curve Cryptography Processor over Binary Field GF(2^163)
2016
Proceedings of the 2nd International Conference on Information Systems Security and Privacy
Elliptic curve cryptography (ECC) plays a vital role in passing secure information among different wireless devices. This paper presents a fast, high-performance hardware implementation of an ECC processor over binary field GF(2 m ) using a polynomial basis. A high-performance elliptic curve point multiplier (ECPM) is designed using an efficient finite-field arithmetic unit in affine coordinates, where ECPM is the key operation of an ECC processor. It has been implemented using the National
doi:10.5220/0005741604150422
dblp:conf/icissp/HossainSK16
fatcat:uzy4g275nzf2xpg3fv3uup6o2m