BROWSE
Detail
Journal Article
Hyperelliptic Curve Crypto-Coprocessor over Affine and Projective Coordinates
Cited 5 time in 
Download 7 time
Share 
Download 7 time
Share
- Authors
- Ho Won Kim, Thomas Wollinger, Doo Ho Choi, Dong Guk Han, Mun Kyu Lee
- Issue Date
- 2008-06
- Citation
- ETRI Journal, v.30, no.3, pp.365-376
- ISSN
- 1225-6463
- Publisher
- 한국전자통신연구원 (ETRI)
- Language
- English
- Type
- Journal Article
- Project Code
- 08MS2200, Development of security technology for secure RFID/USN service, Chung Kyo Il
- Abstract
- This paper presents the design and implementation of a hyperelliptic curve cryptography (HECC) coprocessor over affine and projective coordinates, along with measurements of its performance, hardware complexity, and power consumption. We applied several design techniques, including parallelism, pipelining, and loop unrolling, in designing field arithmetic units, group operation units, and scalar multiplication units to improve the performance and power consumption. Our affine and projective coordinate-based HECC processors execute in 0.436 ms and 0.531 ms, respectively, based on the underlying field GF(289). These results are about five times faster than those for previous hardware implementations and at least 13 times better in terms of area-time products. Further results suggest that neither case is superior to the other when considering the hardware complexity and performance. The characteristics of our proposed HECC coprocessor show that it is applicable to high-speed network applications as well as resource-constrained environments, such as PDAs, smart cards, and so on.
- KSP Keywords
- Design techniques, Hardware Implementation, Hardware complexity, High speed network, Hyperelliptic curve cryptography, Loop unrolling, Network applications, Power Consumption, Projective coordinates, Resource-Constrained Environments, Scalar multiplication