Affiliation:
1. Siddhartha Institute of Engineering and Technology, Hyderabad, Telangana, India
Abstract
Elliptic curve cryptography processor implemented for point multiplication on field programmable gate array. Segmented pipelined full-precision multiplier is used to reduce the latency and also data dependency can be avoided by modifying Lopez-Dahab Montgomery PM Algorithm, results in drastic reduction in the number of clock cycles required. The proposed ECC processor is implemented on Xilinx FPGA families i.e. virtex-4, vitrtex-5, virtex-7.single and three multiplier based designs show the fastest performance compared with reported work individually. Our three multiplier based ECC processor implementation is taking the lowest number of clock cycles on FPGA based design processor.
Reference15 articles.
1. N. Koblitz, “Elliptic curve cryptosystems,” Math. Comput. vol. 48 no. 177, pp 203–209, Jan. 1987.
2. V. S. Miller, “Use of elliptic curves in cryptography,” in Advances in Cryptology. Berlin, Germany: Springer, 1986, pp. 417–426.
3. N. Koblitz, A. Menezes, and S. Vanstone, “The state of elliptic curve cryptography,” Designs, Codes Cryptogr., vol. 19, nos. 2–3, pp. 173–193, Mar. 2000.
4. D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. New York, NY, USA: Springer-Verlag, 2004.
5. National Institute of Standards and Technology (NIST), “Recommended elliptic curves for federal government use,” Jul. 1999. [online]. Available http://csrc.nist.gov/encryption