Reference : Optimal First-Order Boolean Masking for Embedded IoT Devices
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/37740
Optimal First-Order Boolean Masking for Embedded IoT Devices
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Dinu, Dumitru-Daniel mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Le Corre, Yann mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Udovenko, Aleksei mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
26-Jan-2018
CARDIS 2017: Smart Card Research and Advanced Applications
Springer, Cham
Lecture Notes in Computer Science, volume 10728
22-41
Yes
International
978-3-319-75207-5
16th International Conference on Smart Card Research and Advanced Applications
from 13-11-2017 to 16-11-2017
Lugano
Switzerland
[en] Boolean masking ; Side-channel attack ; IoT ; Embedded device
[en] Boolean masking is an effective side-channel countermeasure that consists in splitting each sensitive variable into two or more shares which are carefully manipulated to avoid leakage of the sensitive variable. The best known expressions for Boolean masking of bitwise operations are relatively compact, but even a small improvement of these expressions can significantly reduce the performance penalty of more complex masked operations such as modular addition on Boolean shares or of masked ciphers. In this paper, we present and evaluate new secure expressions for performing bitwise operations on Boolean shares. To this end, we describe an algorithm for efficient search of expressions that have an optimal cost in number of elementary operations. We show that bitwise AND and OR on Boolean shares can be performed using less instructions than the best known expressions. More importantly, our expressions do no require additional random values as the best known expressions do. We apply our new expressions to the masked addition/subtraction on Boolean shares based on the Kogge-Stone adder and we report an improvement of the execution time between 14% and 19%. Then, we compare the efficiency of first-order masked implementations of three lightweight block ciphers on an ARM Cortex-M3 to determine which design strategies are most suitable for efficient masking. All our masked implementations passed the t-test evaluation and thus are deemed secure against first-order side-channel attacks.
Fonds National de la Recherche - FnR
Researchers ; Professionals
http://hdl.handle.net/10993/37740
10.1007/978-3-319-75208-2_2

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Optimal_Masking.pdfPublisher postprint503.16 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.