Reference : Faster Mask Conversion with Lookup Tables
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/25939
Faster Mask Conversion with Lookup Tables
English
Vadnala, Praveen Kumar [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) >]
Apr-2015
Constructive Side-Channel Analysis and Secure Design, 6th International Workshop, COSADE 2015, Berlin, Germany, April 13-14, 2015. Revised Selected Papers
Mangard, Stefan
Poschmann, Axel Y.
Springer Verlag
Lecture Notes in Computer Science, volume 9064
207-221
Yes
International
978-3-319-21475-7
6th International Workshop on Constructive Side-Channel Analysis and Secure Design (COSADE 2015)
from 13-04-2015 to 14-04-2015
Berlin
Germany
[en] Side-Channel Analysis (SCA) ; Arithmetic Masking ; Boolean Masking ; Provably Secure Masking ; HMAC-SHA-1
[en] Masking is an effective and widely-used countermeasure to thwart Differential Power Analysis (DPA) attacks on symmetric cryptosystems. When a symmetric cipher involves a combination of Boolean and arithmetic operations, it is necessary to convert the masks from one form to the other. There exist algorithms for mask conversion that are secure against first-order attacks, but they can not be generalized to higher orders. At CHES 2014, Coron, Großschädl and Vadnala (CGV) introduced a secure conversion scheme between Boolean and arithmetic masking of any order, but their approach requires d=2t+1 shares to protect against attacks of order t. In the present paper, we improve the algorithms for second-order conversion with the help of lookup tables so that only three shares instead of five are needed, which is the minimal number for second-order resistance. Furthermore, we also improve the first-order secure addition method proposed by Karroumi, Richard and Joye, again with lookup tables. We prove the security of all presented algorithms using well established assumptions and models. Finally, we provide experimental evidence of our improved mask conversion applied to HMAC-SHA-1. Simulation results show that our algorithms improve the execution time by 85% at the expense of little memory overhead.
http://hdl.handle.net/10993/25939
10.1007/978-3-319-21476-4_14
http://link.springer.com/chapter/10.1007/978-3-319-21476-4_14

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
COSADE2015.pdfAuthor postprint363.32 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.