Customizable elliptic curve cryptosystems (2005)
| Venue: | IEEE Transactions on Very Large Scale Integration (VLSI) Systems |
| Citations: | 8 - 0 self |
BibTeX
@ARTICLE{Cheung05customizableelliptic,
author = {Ray C. C. Cheung and Student Member and Nicolas Jean-baptiste Telle and Wayne Luk and Peter Y. K. Cheung and Senior Member},
title = {Customizable elliptic curve cryptosystems},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
year = {2005},
volume = {13},
pages = {1048--1059}
}
OpenURL
Abstract
Abstract—This paper presents a method for producing hardware designs for elliptic curve cryptography (ECC) systems over the finite field qp@P A, using the optimal normal basis for the representation of numbers. Our field multiplier design is based on a parallel architecture containing multiple-bit serial multipliers; by changing the number of such serial multipliers, designers can obtain implementations with different tradeoffs in speed, size and level of security. A design generator has been developed which can automatically produce a customised ECC hardware design that meets user-defined requirements. To facilitate performance characterization, we have developed a parametric model for estimating the number of cycles for our generic ECC architecture. The resulting hardware implementations are among the fastest reported: for a key size of 270 bits, a point multiplication in a Xilinx XC2V6000 FPGA at 35 MHz can run over 1000 times faster







