International ICST Workshop on Dedicated Short Range Communications

Research Article

Smart Elliptic Curve Cryptography for Smart Dust

Download
339 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-29222-4_44,
        author={Johann Gro\`{a}sch\aa{}dl and Matthias Hudler and Manuel Koschuch and Michael Kr\'{y}ger and Alexander Szekely},
        title={Smart Elliptic Curve Cryptography for Smart Dust},
        proceedings={International ICST Workshop on Dedicated Short Range Communications},
        proceedings_a={DSRC},
        year={2012},
        month={10},
        keywords={Ad-hoc network elliptic curve cryptography performance evaluation arithmetic in finite fields endomorphism},
        doi={10.1007/978-3-642-29222-4_44}
    }
    
  • Johann Großschädl
    Matthias Hudler
    Manuel Koschuch
    Michael Krüger
    Alexander Szekely
    Year: 2012
    Smart Elliptic Curve Cryptography for Smart Dust
    DSRC
    Springer
    DOI: 10.1007/978-3-642-29222-4_44
Johann Großschädl1,*, Matthias Hudler2,*, Manuel Koschuch2,*, Michael Krüger2,*, Alexander Szekely3,*
  • 1: University of Luxembourg
  • 2: FH Campus Wien - University of Applied Sciences
  • 3: Graz University of Technology
*Contact email: johann.groszschaedl@uni.lu, Matthias.Hudler@fh-campuswien.ac.at, Manuel.Koschuch@fh-campuswien.ac.at, Michael.Kruger@fh-campuswien.ac.at, alexander.szekely@iaik.tugraz.at

Abstract

Wireless ad-hoc and sensor networks play a vital role in an ever-growing number of applications ranging from environmental monitoring over vehicular communication to home automation. Security and privacy issues pose a big challenge for the widespread adoption of these networks, especially in the automotive domain. The two most essential security services needed to maintain the proper functioning of a wireless network are authentication and key establishment; both can be realized with Elliptic Curve Cryptography (ECC). In this paper, we introduce an efficient ECC implementation for resource-restricted devices such as sensor nodes. Our implementation uses a 160-bit Optimal Prime Field (OPF) over which a Gallant-Lambert-Vanstone (GLV) curve with good cryptographic properties can be defined. The combination of optimized field arithmetic with fast group arithmetic (thanks to an efficiently computable endomorphism) allows us to perform a scalar multiplication in about 5.5 ·10 clock cycles on an 8-bit ATmega128 processor, which is significantly faster than all previously-reported ECC implementations based on a 160-bit prime field.