An Energy-Efficient Reconfigurable Public-Key

The ever-increasing demand for security in portable energy-constrained environments that lack a coherent security architecture has resulted in the need to provide energy-effi- cient algorithm-agile cryptographic hardware. Domain-specific reconfigurability is utilized to provide the required flexibility, without incurring the high overhead costs associated with generic reprogrammable logic. The resulting implementation is capable of performing an entire suite of cryptographic primitives over the integers modulo , binary Galois Fields and nonsupersingular elliptic curves over GF , with fully programmable moduli, field polynomials and curve parameters ranging in size from 8 to 1024 bits. The resulting processor consumes a maximum of 75 mW when operating at a clock rate of 50 MHz and a 2-V supply voltage. In ultralow-power mode (3 MHz at 0.7 V) the processor consumes at most 525 W. Measured performance and energy efficiency indicate a comparable level of performance to previously reported dedicated hardware implementations, while providing all of the flexibility of a software-based implementation. In addition, the processor is two to three orders of magnitude more energy efficient than optimized software and reprogrammable logic-based implementations.

[1]  G. Seroussi,et al.  Elliptic curve cryptography , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).

[2]  Cheng-Wen Wu,et al.  A systolic RSA public key cryptosystem , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[3]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[4]  Paul C. Kocher,et al.  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[5]  An-Yeu Wu,et al.  A scalable low-complexity digit-serial VLSI architecture for RSA cryptosystem , 1999, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461).

[6]  Martin Christopher Rosner,et al.  Elliptic Curve Cryptosystems on Reconfigurable Hardware , 1999 .

[7]  Christer Svensson,et al.  High-speed CMOS circuit technique , 1989 .

[8]  Wang Tao,et al.  Implementation of RSA cryptoprocessor based on Montgomery algorithm , 1998, 1998 5th International Conference on Solid-State and Integrated Circuit Technology. Proceedings (Cat. No.98EX105).

[9]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[10]  H. Garner.  The residue number system , 1959, IRE-AIEE-ACM '59 (Western).

[11]  Holger Orup,et al.  VICTOR an Efficient RSA Hardware Implementation , 1991, EUROCRYPT.

[12]  K. Ohyama,et al.  A single-chip RSA processor implemented in a 0.5 /spl mu/m rule gate array , 1994, Proceedings Seventh Annual IEEE International ASIC Conference and Exhibit.

[13]  Etienne Vanzieleghem,et al.  A Single Chip 1024 Bits RSA Processor , 1990, EUROCRYPT.

[14]  Thomas Blum,et al.  Modular Exponentiation on Reconfigurable Hardware , 1999 .

[15]  Akashi Satoh,et al.  A High-Speed Small RSA Encryption LSI with Low Power Dissipation , 1997, ISW.

[16]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[17]  Tian-Sheuan Chang,et al.  A new RSA cryptosystem hardware design based on Montgomery's algorithm , 1998 .

[18]  S. Davidson,et al.  An Ultra-high Speed Public Key Encryption Processor , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[19]  Jan M. Rabaey,et al.  Low-energy embedded FPGA structures , 1998, Proceedings. 1998 International Symposium on Low Power Electronics and Design (IEEE Cat. No.98TH8379).

[20]  Mark Shand,et al.  Fast implementations of RSA cryptography , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[21]  Chin-Liang Wang,et al.  Design and implementation of an RSA public-key cryptosystem , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).