Energy-Adaptive Dual-Field Processor for High-Performance Elliptic Curve Cryptographic Applications
Authors:
- 6 May 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 19 (8) , 1512-1517
Abstract
We present an elliptic curve cryptographic (ECC) processor, capable of parallel and serial operation modes, with the unified architecture for both prime field and binary field cryptosystems, featuring comprehensive cryptographic functions to fulfill realistic security applications. An advanced field inversion method and the scheduler-controlled datapath are integrated into the processor to provide high-throughput and energy-adaptive security computing with power-performance trade off. Using 130-nm CMOS technology, the fabricated chip measures 4.97 mm2 with the core area of 1.35 mm2. A 160-bit point scalar multiplication with coordinate conversion can be done in 385 μ s at 141 MHz with core power of 80.4 mW over GF(p) and in 272 μs at 158 MHz with 79.6 mW over GF(2m). The comparison of throughput, area, power, and energy consumption among different ECC designs justifies that our high-throughput processor chip provides power- and energy-efficient implementation with the flexibility of dual-field ECC.Keywords
This publication has 12 references indexed in Scilit:
- A Highly Efficient Cipher Processor for Dual-Field Elliptic Curve CryptographyIEEE Transactions on Circuits and Systems II: Express Briefs, 2009
- Design of Scalable Hardware Architecture for Dual-field Montgomery Modular Inverse Computation2009
- On Parallelization of High-Speed Processors for Elliptic Curve CryptographyIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008
- High-Performance Architecture of Elliptic Curve Scalar MultiplicationIEEE Transactions on Computers, 2008
- Efficient unified Montgomery inversion with multibit shiftingIEE Proceedings - Computers and Digital Techniques, 2005
- Efficient scalable VLSI architecture for Montgomery inversion in (p)Integration, 2004
- Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic2004
- Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)1999
- The Montgomery inverse and its applicationsIEEE Transactions on Computers, 1995
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988