Reference : Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/14764
Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors
English
Liu, Zhe mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Groszschädl, Johann mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Wong, Duncan S. [City University of Hong Kong > Department of Computer Science]
Nov-2013
Information Security and Cryptology - 9th International Conference, INSCRYPT 2013, Guangzhou, China, November 27-30, 2013
Lin, Dongdai
Xu, Shouhuai
Yung, Moti
Springer Verlag
Lecture Notes in Computer Science, volume 8567
217-235
Yes
No
International
978-3-319-12086-7
9th International Conference on Information Security and Cryptology (INSCRYPT 2013)
from 27-11-2013 to 30-11-2013
Guangzhou
China
[en] Elliptic Curve Cryptography ; Optimal Prime Fields ; Multiple-Precision Arithmetic ; Montgomery Multiplication ; AVR Architecture
[en] Small 8-bit RISC processors and micro-controllers based on the AVR instruction set architecture are widely used in the embedded domain with applications ranging from smartcards over control systems to wireless sensor nodes. Many of these applications require asymmetric encryption or authentication, which has spurred a body of research into implementation aspects of Elliptic Curve Cryptography (ECC) on the AVR platform. In this paper, we study the suitability of a special class of finite fields, the so-called Optimal Prime Fields (OPFs), for a "lightweight" implementation of ECC with a view towards high performance and security. An OPF is a finite field Fp defined by a prime of the form p = u*2^k + v, whereby both u and v are "small" (in relation to 2^k) so that they fit into one or two registers of an AVR processor. OPFs have a low Hamming weight, which allows for a very efficient implementation of the modular reduction since only the non-zero words of p need to be processed. We describe a special variant of Montgomery multiplication for OPFs that does not execute any input-dependent conditional statements (e.g. branch instructions) and is, hence, resistant against certain side-channel attacks. When executed on an Atmel ATmega processor, a multiplication in a 160-bit OPF takes just 3237 cycles, which compares favorably with other implementations of 160-bit modular multiplication on an 8-bit processor. We also describe a performance-optimized and a security-optimized implementation of elliptic curve scalar multiplication over OPFs. The former uses a GLV curve and executes in 4.19M cycles (over a 160-bit OPF), while the latter is based on a Montgomery curve and has an execution time of approximately 5.93M cycles. Both results improve the state-of-the-art in lightweight ECC on 8-bit processors.
http://hdl.handle.net/10993/14764
10.1007/978-3-319-12087-4_14
http://link.springer.com/chapter/10.1007/978-3-319-12087-4_14

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
INSCRYPT2013.pdfPublisher postprint335.13 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.