NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks

  • Piotr Szczechowiak
  • Leonardo B. Oliveira
  • Michael Scott
  • Martin Collier
  • Ricardo Dahab
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4913)

Abstract

By using Elliptic Curve Cryptography (ECC), it has been recently shown that Public-Key Cryptography (PKC) is indeed feasible on resource-constrained nodes. This feasibility, however, does not necessarily mean attractiveness, as the obtained results are still not satisfactory enough. In this paper, we present results on implementing ECC, 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 that PKC is not only viable, but in fact attractive for WSNs. As far as we know pairing computations presented in this paper are the most efficient results on the MICA2 (8-bit/7.3828-MHz ATmega128L) and Tmote Sky (16-bit/8.192-MHz MSP-430) nodes.

Keywords

Wireless Sensor Networks Elliptic Curve Cryptography pairings cryptographic primitives implementation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Piotr Szczechowiak
    • 1
  • Leonardo B. Oliveira
    • 2
  • Michael Scott
    • 1
  • Martin Collier
    • 1
  • Ricardo Dahab
    • 2
  1. 1.Dublin City UniversityIreland
  2. 2.UNICAMPBrazil

Personalised recommendations