FPGA implementation of high performance elliptic curve cryptographic processor over GF(2163)

Authors:
Chang Hoon Kim;Soonhak Kwon;Chun Pyo Hong
Affiliations:
School of Computer and Information Technology, Daegu University, Jinryang, Kyungsan 712-714, Republic of Korea;Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea;School of Computer and Communication Engineering, Daegu University, Jinryang, Kyungsan 712-714, Republic of Korea
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2008

Citing 9
Cited 6

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Implementing elliptic curve cryptography

Implementing elliptic curve cryptography
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
An End-to-End Systems Approach to Elliptic Curve Cryptography

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable Dual-Field Elliptic Curve Cryptographic Processor

IEEE Transactions on Computers
A High Performance VLIW Processor for Finite Field Arithmetic

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Area Efficient High Speed Elliptic Curve Cryptoprocessor for Random Curves

ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
Design of flexible GF(2m) elliptic curve cryptography processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

A high performance ECC hardware implementation with instruction-level parallelism over GF(2163)

Microprocessors & Microsystems
A modified low complexity digit-level Gaussian normal basis multiplier

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Hardware architectures for elliptic curve cryptoprocessors using polynomial and Gaussian normal basis over GF(2233)

Transactions on computational science XI
Pushing the limits of high-speed GF(2m) elliptic curve scalar multiplication on FPGAs

CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Area-efficient architectures for double precision multiplier on FPGA, with run-time-reconfigurable dual single precision support

Microelectronics Journal
Efficient FPGA implementations of point multiplication on binary Edwards and generalized Hessian curves using Gaussian normal basis

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a high performance elliptic curve cryptographic processor over GF(2^1^6^3), one of the five binary fields recommended by National Institute of Standards and Technology (NIST) for Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed architecture is based on the Lopez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis for GF(2^1^6^3) field arithmetic. To achieve high throughput rates, we design two new word-level arithmetic units over GF(2^1^6^3) and derive parallelized elliptic curve point doubling and point addition algorithms with uniform addressing based on the Lopez-Dahab method. We implement our design using Xilinx XC4VLX80 FPGA device which uses 24,263 slices and has a maximum frequency of 143MHz. Our design is roughly 4.8 times faster with two times increased hardware complexity compared with the previous hardware implementation proposed by Shu et al. Therefore, the proposed elliptic curve cryptographic processor is well suited to elliptic curve cryptosystems requiring high throughput rates such as network processors and web servers.