Reference : High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/37494
High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
English
Liu, Zhe [University of Waterloo > Department of Combinatorics and Optimization]
Pöppelmann, Thomas [Infineon Technologies AG > Chip Card and Security Division]
Oder, Tobias [Ruhr University Bochum > Deptartment of Electrical Engineering and In­for­ma­ti­on Tech­no­lo­gy]
Seo, Hwajeong [Hansung University > Department of Information Technology]
Roy, Sujoy Sinha [Katholieke Universiteit Leuven > Department of Electrical Engineering (ESAT)]
Güneysu, Tim [University of Bremen > Research Group for Computer Engineering and IT-Security (CEITS)]
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]
Verbauwhede, Ingrid [Katholieke Universiteit Leuven > Department of Electrical Engineering (ESAT)]
Sep-2017
ACM Transactions on Embedded Computing Systems
Association for Computing Machinery (ACM)
16
4
117
Yes (verified by ORBilu)
1539-9087
United States
[en] Post-Quantum Cryptography ; Ideal Lattices ; Ring Learning With Errors (RLWE) ; Number-Theoretic Transform ; Bimodal Lattice Signature Scheme (BLISS) ; ATxmega processor
[en] Over recent years lattice-based cryptography has received much attention due to versatile average-case problems like Ring-LWE or Ring-SIS that appear to be intractable by quantum computers. In this work, we evaluate and compare implementations of Ring-LWE encryption and the bimodal lattice signature scheme (BLISS) on an 8-bit Atmel ATxmega128 microcontroller. Our implementation of Ring-LWE encryption provides comprehensive protection against timing side-channels and takes 24.9ms for encryption and 6.7ms for decryption. To compute a BLISS signature, our software takes 317ms and 86ms for verification. These results underline the feasibility of lattice-based cryptography on constrained devices.
http://hdl.handle.net/10993/37494
10.1145/3092951
http://dl.acm.org/citation.cfm?id=3092951

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
TECS2017.pdfPublisher postprint700 BRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.