Reference : Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/12934
Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
English
Liu, Zhe mailto [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 mailto [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]
Nov-2013
Information and Communications Security - 15th International Conference, ICICS 2013, Beijing, China, November 20-22, 2013. Proceedings
Qing, Sihan
Zhou, Jianying
Liu, Dongmei
Springer Verlag
Lecture Notes in Computer Science, volume 8233
302-317
Yes
International
978-3-319-02725-8
15th International Conference on Information and Communications Security (ICICS 2013)
from 20-11-2013 to 22-11-2013
Beijing
China
[en] Wireless Sensor Networks ; Elliptic Curve Cryptography ; Multiple-Precision Arithmetic ; 8-bit AVR Processor ; Energy Evaluation
[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).
http://hdl.handle.net/10993/12934
10.1007/978-3-319-02726-5_22
http://link.springer.com/chapter/10.1007/978-3-319-02726-5_22

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
ICICS2013.pdfAuthor postprint1.41 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.