 Enabling Full-Size Public-Key Algorithms on 8-bit Sensor Nodes |
| Author: L. Uhsadel, A. Poschmann, C. Paar |
Description:
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 WSNs. The major part (77%) of the processing time for an elliptic curve operation such as ECDSA or EC Diffie-Hellman is spent on modular multiplication. We present an optimized arithmetic algorithm which signicantly speed up ECC schemes. The reduced processing time also yields a signicantly lower energy consumption of ECC schemes. With our implementation results we can show that a 160-bit modular multiplication can be performed in 0.39 ms on an 8-bit AVR processor clocked at 7.37 MHz. This brings the vision of asymmetric cryptography in the eld of WSNs with all its benets for key-distribution and authentication a step closer to reality. |
|
@INCOLLECTION{ecc-esas2007
author = {L. Uhsadel, A. Poschmann, C. Paar},
title = {{Enabling Full-Size Public-Key Algorithms on 8-bit Sensor Nodes}},
booktitle = {Proceedings of ESAS 2007},
publisher = {Springer-Verlag},
year = {2007},
} |
| Related Tags: lightweight, Assembly, crypto, embedded |
 go to paper  open in new window/tab |
|
| Security for 1000 Gate Equivalents |
| Author: C. Rolfes, A. Poschmann, C. Paar |
Description:
Product piracy and counterfeiting is a market with an annual turnover of hundreds of billions of US-Dollars. The application of RFID-tags is discussed widely to cope with this problem. A major obstacle for a mass deployment of RFID-tags, beside the harsh requirements on power consumption, are fabrication costs. In hardware fabrication costs are proportional to the required area. In this paper we present three different architectures of the present algorithm. Our implementation of the serialized architecture requires only 1000 GE. To the best of our knowledge this is the smallest hardware implementation of a cryptographic algorithm with a moderate security level. |
|
@INCOLLECTION{secsi2007
author = {C. Rolfes, A. Poschmann, C. Paar},
title = {{Security for 1000 Gate Equivalents}},
booktitle = {ecrypt workshop SECSI - Secure Component and System Identification},
publisher = {-},
year = {2008},
} |
| Related Tags: crypto, Assembly |
| go to paper open in new window/tab |
|
| An Efficient General Purpose Elliptic Curve Cryptography Module for Ubiquitous Sensor Networks |
| Author: L. Uhsadel, A. Poschmann, and C. Paar |
Description:
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 Diffie-Hellman is spent on modular multiplication. We present an optimized arithmetic algorithm which significantly speeds up ECC schemes. The reduced processing time also yields a significantly 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 field of USNs with all its benefits for key-distribution and authentication a step closer to reality. |
|
@INCOLLECTION{ecc-speed2007
author = {L. Uhsadel, A. Poschmann, and C. Paar},
title = {{An Efficient General Purpose Elliptic Curve Cryptography Module for Ubiquitous Sensor Networks}},
booktitle = {ecrypt workshop SPEED - Software Performance Enhancement for Encryption and Decryption},
publisher = {-},
year = {2007},
} |
| Related Tags: ASIC, VHDL, Assembly, crypto |
| go to paper open in new window/tab |
|
