Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
Liu, Zhe; Seo, Hwajeong; Groszschädl, Johann et al.
2013In Qing, Sihan; Zhou, Jianying; Liu, Dongmei (Eds.) Information and Communications Security - 15th International Conference, ICICS 2013, Beijing, China, November 20-22, 2013. Proceedings
Peer reviewed
 

Files


Full Text
ICICS2013.pdf
Author postprint (1.45 MB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Wireless Sensor Networks; Elliptic Curve Cryptography; Multiple-Precision Arithmetic; 8-bit AVR Processor; Energy Evaluation
Abstract :
[en] In this paper, we present a highly-optimized implementation of standards-compliant Elliptic Curve Cryptography (ECC) for wireless sensor nodes and similar devices featuring an 8-bit AVR processor. The field arithmetic is written in Assembly language and optimized for the 192-bit NIST-specified prime p = 2^192 - 2^64 - 1, while the group arithmetic (i.e. point addition and doubling) is programmed in ANSI C. One of our contributions is a novel lazy doubling method for multi-precision squaring which provides better performance than any of the previously-proposed squaring techniques. Based on our highly optimized arithmetic library for the 192-bit NIST prime, we achieve record-setting execution times for scalar multiplication (with both fixed and arbitrary points) as well as multiple scalar multiplication. Experimental results, obtained on an AVR ATmega128 processor, show that the two scalar multiplications of ephemeral Elliptic Curve Diffie-Hellman (ECDH) key exchange can be executed in 1.75 s altogether (at a clock frequency of 7.37 MHz) and consume an energy of some 42 mJ. The generation and verification of an ECDSA signature requires roughly 1.91 s and costs 46 mJ at the same clock frequency. Our results significantly improve the state-of-the-art in ECDH and ECDSA computation on the P-192 curve, outperforming the previous best implementations in the literature by a factor of 1.35 and 2.33, respectively. We also protected the field arithmetic and algorithms for scalar multiplication against side-channel attacks, especially Simple Power Analysis (SPA).
Disciplines :
Computer science
Author, co-author :
Liu, Zhe ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Seo, Hwajeong;  Pusan National University > School of Computer Science and Engineering
Groszschädl, Johann ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Kim, Howon;  Pusan National University > School of Computer Science and Engineering
Language :
English
Title :
Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
Publication date :
November 2013
Event name :
15th International Conference on Information and Communications Security (ICICS 2013)
Event place :
Beijing, China
Event date :
from 20-11-2013 to 22-11-2013
Audience :
International
Main work title :
Information and Communications Security - 15th International Conference, ICICS 2013, Beijing, China, November 20-22, 2013. Proceedings
Editor :
Qing, Sihan
Zhou, Jianying
Liu, Dongmei
Publisher :
Springer Verlag
ISBN/EAN :
978-3-319-02725-8
Collection name :
Lecture Notes in Computer Science, volume 8233
Pages :
302-317
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 11 December 2013

Statistics


Number of views
345 (57 by Unilu)
Number of downloads
1196 (23 by Unilu)

Scopus citations®
 
18
Scopus citations®
without self-citations
9
OpenCitations
 
11

Bibliography


Similar publications



Contact ORBilu