High-Speed and Low-Latency ECC Processor Implementation Over GF( $2^{m})$ on FPGA
- 14 June 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 25 (1), 165-176
- https://doi.org/10.1109/tvlsi.2016.2574620
Abstract
In this paper, a novel high-speed elliptic curve cryptography (ECC) processor implementation for point multiplication (PM) on field-programmable gate array (FPGA) is proposed. A new segmented pipelined full-precision multiplier is used to reduce the latency, and the Lopez-Dahab Montgomery PM algorithm is modified for careful scheduling to avoid data dependency resulting in a drastic reduction in the number of clock cycles (CCs) required. The proposed ECC architecture has been implemented on Xilinx FPGAs' Virtex4, Virtex5, and Virtex7 families. To the best of our knowledge, our single- and three-multiplier-based designs show the fastest performance to date when compared with reported works individually. Our one-multiplier-based ECC processor also achieves the highest reported speed together with the best reported area-time performance on Virtex4 (5.32 μs at 210 MHz), on Virtex5 (4.91 μs at 228 MHz), and on the more advanced Virtex7 (3.18 μs at 352 MHz). Finally, the proposed three-multiplier-based ECC implementation is the first work reporting the lowest number of CCs and the fastest ECC processor design on FPGA (450 CCs to get 2.83 μs on Virtex7).Keywords
This publication has 22 references indexed in Scilit:
- Throughput/Area-efficient ECC Processor Using Montgomery Point Multiplication on FPGAIEEE Transactions on Circuits and Systems II: Express Briefs, 2015
- A survey of some recent bit-parallelmultipliersFinite Fields and Their Applications, 2015
- High Performance FPGA Implementation of Elliptic Curve Cryptography over Binary FieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Low area ECC implementation on FPGAPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over ${\rm GF}(2^{163})$IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2013
- A high performance ECC hardware implementation with instruction-level parallelism over GF(2163)Microprocessors and Microsystems, 2010
- Use of Elliptic Curves in CryptographyPublished by Springer Science and Business Media LLC ,2000
- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputationLecture Notes in Computer Science, 1999
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- Elliptic curve cryptosystemsMathematics of Computation, 1987