Reference : Algorithms for Switching between Boolean and Arithmetic Masking of Second Order

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

Title :	Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
Language :	English
Author, co-author :	Vadnala, Praveen Kumar [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Groszschädl, Johann [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	Oct-2013
Main document title :	Security, Privacy, and Applied Cryptography Engineering - Third International Conference, SPACE 2013, Kharagpur, India, October 19-23, 2013. Proceedings
Editor :	Gierlichs, Benedikt
	Guilley, Sylvain
	Mukhopadhyay, Debdeep
Publisher :	Springer Verlag
Collection and collection volume :	Lecture Notes in Computer Science, volume 8204
Pages :	95-110
Peer reviewed :	Yes
Audience :	International
ISBN :	978-3-642-41223-3
Event name :	3rd International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE 2013)
Event date :	from 19-10-2013 to 23-10-2013
Event place (city) :	Kharagpur
Event country :	India
Keywords :	[en] Differential power analysis ; Second-order DPA ; Arithmetic masking ; Boolean Masking ; Provably secure masking
Abstract :	[en] Masking is a widely-used countermeasure to thwart Differential Power Analysis (DPA) attacks, which, depending on the involved operations, can be either Boolean, arithmetic, or multiplicative. When used to protect a cryptographic algorithm that performs both Boolean and arithmetic operations, it is necessary to change the masks from one form to the other in order to be able to unmask the secret value at the end of the algorithm. To date, known techniques for conversion between Boolean and arithmetic masking can only resist first-order DPA. This paper presents the first solution to the problem of converting between Boolean and arithmetic masking of second order. To set the context, we show that a straightforward extension of first-order conversion schemes to second order is not possible. Then, we introduce two algorithms to convert from Boolean to arithmetic masking based on the second-order provably secure S-box output computation method proposed by Rivain et al (FSE 2008). The same can be used to obtain second-order secure arithmetic to Boolean masking. We prove the security of our conversion algorithms using similar arguments as Rivain et al. Finally, we provide implementation results of the algorithms on three different platforms.
Permalink :	http://hdl.handle.net/10993/19570
DOI :	10.1007/978-3-642-41224-0_8
Other URL :	http://link.springer.com/chapter/10.1007/978-3-642-41224-0_8

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access SPACE2013.pdf Author postprint 346.8 kB View/Open

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

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map