Reference : Optimal First-Order Boolean Masking for Embedded IoT Devices

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/37740

Title :	Optimal First-Order Boolean Masking for Embedded IoT Devices
Language :	English
Author, co-author :	Biryukov, Alex [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Dinu, Dumitru-Daniel [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Le Corre, Yann [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Udovenko, Aleksei [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	26-Jan-2018
Main document title :	CARDIS 2017: Smart Card Research and Advanced Applications
Publisher :	Springer, Cham
Collection and collection volume :	Lecture Notes in Computer Science, volume 10728
Pages :	22-41
Peer reviewed :	Yes
Audience :	International
ISBN :	978-3-319-75207-5
Event name :	16th International Conference on Smart Card Research and Advanced Applications
Event date :	from 13-11-2017 to 16-11-2017
Event place (city) :	Lugano
Event country :	Switzerland
Keywords :	[en] Boolean masking ; Side-channel attack ; IoT ; Embedded device
Abstract :	[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.
Funders :	Fonds National de la Recherche - FnR
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/10993/37740
DOI :	10.1007/978-3-319-75208-2_2

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access Optimal_Masking.pdf Publisher postprint 503.16 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map