Reference : Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/19570
Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
English
Vadnala, Praveen Kumar 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) >]
Oct-2013
Security, Privacy, and Applied Cryptography Engineering - Third International Conference, SPACE 2013, Kharagpur, India, October 19-23, 2013. Proceedings
Gierlichs, Benedikt
Guilley, Sylvain
Mukhopadhyay, Debdeep
Springer Verlag
Lecture Notes in Computer Science, volume 8204
95-110
Yes
International
978-3-642-41223-3
3rd International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE 2013)
from 19-10-2013 to 23-10-2013
Kharagpur
India
[en] Differential power analysis ; Second-order DPA ; Arithmetic masking ; Boolean Masking ; Provably secure masking
[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.
http://hdl.handle.net/10993/19570
10.1007/978-3-642-41224-0_8
http://link.springer.com/chapter/10.1007/978-3-642-41224-0_8

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
SPACE2013.pdfAuthor postprint346.8 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.