On Emerging Family of Elliptic Curves to Secure Internet of Things: ECC Comes of Age
Authors:
- 7 June 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 14 (15455971) , 1
Abstract
Lightweight Elliptic Curve Cryptography (ECC) is a critical component for constructing the security system of Internet of Things (IoT). In this paper, we define an emerging family of lightweight elliptic curves to meet the requirements on some resource-constrained devices. We present the design of a scalable, regular, and highly-optimized ECC library for both MICAz and Tmote Sky nodes, which supports both widely-used key exchange and signature schemes. Our parameterized implementation of elliptic curve group arithmetic supports pseudo-Mersenne prime fields at different security levels with two optimized-specific designs: the high-speed version (HS) and the memory-efficient (ME) version. The former design achieves record times for computation of cryptographic schemes at roughly $80\sim 128$ -bit security levels, while the latter implementation only requires half of the code size of the current best implementation. We also describe our efforts to evaluate the energy consumption and harden our library against some basic side-channel attacks, e.g., timing attacks and simple power analysis (SPA) attacks.
Keywords
This publication has 31 references indexed in Scilit:
- Hardware Architectures for MSP430-Based Wireless Sensor Nodes Performing Elliptic Curve Cryptography2013
- High-speed high-security signaturesJournal of Cryptographic Engineering, 2012
- Performance enhancement of TinyECC based on multiplication optimizationsSecurity and Communication Networks, 2012
- Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor NetworksLecture Notes in Computer Science, 2009
- Twisted Edwards Curves2008
- NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks2008
- Elliptic curve cryptography-based access control in sensor networksInternational Journal of Security and Networks, 2006
- Incomplete reduction in modular arithmeticIEE Proceedings - Computers and Digital Techniques, 2002
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987