Reference : Analysis and Improvement of the Generic Higher-Order Masking Scheme of FSE 2012
Parts of books : Contribution to collective works
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/15273
Analysis and Improvement of the Generic Higher-Order Masking Scheme of FSE 2012
English
Roy, Arnab [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Venkatesh, Srinivas Vivek mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2013
Cryptographic Hardware and Embedded Systems - CHES 2013
Bertoni, Guido
Coron, Jean-S├ębastien
Springer Berlin Heidelberg
Lecture Notes in Computer Science
417-434
Yes
978-3-642-40348-4
[en] block cipher; S-box; masking complexity; addition chain; polynomial evaluation; side-channel attack
[en] Masking is a well-known technique used to prevent block cipher implementations from side-channel attacks. Higher-order side channel attacks (e.g. higher-order DPA attack) on widely used block cipher like AES have motivated the design of efficient higher-order masking schemes. Indeed, it is known that as the masking order increases, the difficulty of side-channel attack increases exponentially. However, the main problem in higher-order masking is to design an efficient and secure technique for S-box computations in block cipher implementations. At FSE 2012, Carlet et al. proposed a generic masking scheme that can be applied to any S-box at any order. This is the first generic scheme for efficient software implementations. Analysis of the running time, or masking complexity, of this scheme is related to a variant of the well-known problem of efficient exponentiation (addition chain), and evaluation of polynomials.

In this paper we investigate optimal methods for exponentiation in TeX by studying a variant of addition chain, which we call cyclotomic-class addition chain, or CC-addition chain. Among several interesting properties, we prove lower bounds on min-length CC-addition chains. We define the notion of TeX -polynomial chain, and use it to count the number of non-linear multiplications required while evaluating polynomials over TeX . We also give a lower bound on the length of such a chain for any polynomial. As a consequence, we show that a lower bound for the masking complexity of DES S-boxes is three, and that of PRESENT S-box is two. We disprove a claim previously made by Carlet et al. regarding min-length CC-addition chains. Finally, we give a polynomial evaluation method, which results into an improved masking scheme (compared to the technique of Carlet et al.) for DES S-boxes. As an illustration we apply this method to several other S-boxes and show significant improvement for them.
http://hdl.handle.net/10993/15273
10.1007/978-3-642-40349-1_24
http://dx.doi.org/10.1007/978-3-642-40349-1_24
The final publication is available at www.springerlink.com
8086

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
maskingches_final.pdfAuthor postprint405.75 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.