Tradeoff Design of Low-Cost and Low-Energy Elliptic Curve Crypto-Processor for Wireless Sensor Networks

In this paper, a low-cost and low-energy elliptic curves cryptography processor over GF(2m) based solution for security services such as key-distribution and authentication as required for wireless sensor networks was proposed. In order to obtain stronger cryptography as well as to minimize the energy and the cost, the architecture of coprocessor was optimized and implemented based on UMC 0.25μm CMOS technology in different digit size multiplication. The digit size of D is 4 is a reasonable tradeoff compared to the results of implementation. In this case, The coprocessor is able to perform one kP operation over the finite field GF(2^163) in 4.42ms, consuming 38.19μJ when operating frequency is 10MHz. The area is 26,156 equivalent gates. These results indicate that the proposed hardware implementation of ECC would meet the strict energy and cost constraint of a wireless sensor network node.

[1]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[2]  Guido Bertoni,et al.  Power aware design of an elliptic curve coprocessor for 8 bit platforms , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[3]  Berk Sunar,et al.  Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic , 2004, CHES.

[4]  Maurice Keller,et al.  Low Power Elliptic Curve Cryptography , 2007, PATMOS.

[5]  Adrian Perrig,et al.  Security and Privacy in Sensor Networks , 2003, Computer.

[6]  David A. Wagner,et al.  Security in wireless sensor networks , 2004, SASN '04.

[7]  Christof Paar,et al.  Are standards compliant Elliptic Curve Cryptosystems feasible on RFID ? , 2006 .

[8]  Huapeng Wu,et al.  Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis , 2002, IEEE Trans. Computers.

[9]  Ingrid Verbauwhede,et al.  Low-Cost Elliptic Curve Cryptography for Wireless Sensor Networks , 2006, ESAS.

[10]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[11]  Keshab K. Parhi,et al.  Low-Energy Digit-Serial/Parallel Finite Field Multipliers , 1998 .

[12]  Jean-Jacques Quisquater,et al.  High-speed hardware implementations of Elliptic Curve Cryptography: A survey , 2007, J. Syst. Archit..

[13]  Russell Miller,et al.  A Low-Power Design for an Elliptic Curve Digital Signature Chip , 2002, CHES.