NanoECC

Testing the Limits of Elliptic Curve Cryptography in Sensor Networks

keywords

Wireless Sensor Networks, Elliptic Curve Cryptography, pairings, cryptographic primitives, implementation.

Paper

Szczechowiak, Piotr, Oliveira, Leonardo B., and Scott, Michael, Collier, Martin, Dahab, Ricardo. NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks. 5th European Conference on Wireless Sensor Networks (EWSN'08). 2008.

Download Paper

Abstract

By using Elliptic Curve Cryptography (ECC), it has been re- cently shown that Public-Key Cryptography (PKC) is indeed f easible on resource-constrained nodes. This feasibility, however, d oes not necessar- ily mean attractiveness, as the obtained results are still n ot satisfactory enough. In this paper, we present results on implementing EC C, as well as the related emerging field of Pairing-Based Cryptography (PBC), on two of the most popular sensor nodes. By doing that, we show th at PKC is not only viable, but in fact attractive for WSNs. As far as w e know pairing computations presented in this paper are the most effi cient re- sults on the MICA2 (8-bit/7.3828-MHz ATmega128L) and Tmote Sky (16-bit/8.192-MHz MSP-430) nodes.

BibTeX

@inproceedings{szczechowiak08
                author    = {Szczechowiak, Piotr and Oliveira, Leonardo B. and Scott, Michael and Collier, Martin and Dahab, Ricardo},
                title     = {{NanoECC}: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks},
                booktitle = {5th European Conference on Wireless Sensor Networks {EWSN'08}},
                year      = {2008},
              } 

Extras

Download Presentation