An Efficient General Purpose Elliptic Curve Cryptography Module for Ubiquitous Sensor Networks

Leif Uhsadel, Dipl.-Kfm. Axel Poschmann, Chris­tof Paar

Software Performance Enhancement for Encryption and Decryption (SPEED 2007), Amsterdam, NL Juni 11-12, 2007


Abstract

In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro-controller which are typically used in ubiquitous sensor networks (USN). The major part (77%) of the processing time for an elliptic curve operation such as ECDSA or EC Di?e-Hellman is spent on modular multiplication. We present an optimized arithmetic algorithm which signi?cantly speeds up ECC schemes. The reduced processing time also yields a signi?cantly lower energy consumption of ECC schemes. We show that a 160-bit modular multiplication can be performed in 0.37 ms on an 8-bit AVR processor clocked at 8 MHz. This brings the vision of asymmetric cryptography in the ?eld of USNs with all its bene?ts for key-distribution and authentication a step closer to reality.

[pdf] [Bibtex]

Tags: