On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking

Dahmun Goudarzi 1, 2, 3 Matthieu Rivain 1
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
Abstract : Higher-order masking is a widely used countermeasure to make software implementa- tions of blockciphers achieve high security levels against side-channel attacks. Unfortunately, it often comes with a strong impact in terms of performances which may be prohibitive in some contexts. This situation has motivated the research for efficient schemes that apply higher-order masking with minimal performance overheads. The most widely used approach is based on a polynomial representation of the cipher s-box(es) allowing the application of standard higher-order masking building blocks such as the ISW scheme (Ishai-Sahai-Wagner, Crypto 2003). Recently, an alterna- tive approach has been considered which is based on a bitslicing of the s-boxes. This approach has been shown to enjoy important efficiency benefits, but it has only been applied to specific block- ciphers such as AES, PRESENT, or custom designs. In this paper, we present a generic method to find a Boolean representation of an s-box with efficient bitsliced higher-order masking. Specifi- cally, we propose a method to construct a circuit with low multiplicative complexity. Compared to previous work on this subject, our method can be applied to any s-box of common size and not necessarily to small s-boxes. We use it to derive higher-order masked s-box implementations that achieve important performance gain compared to optimized state-of-the-art implementations.
Type de document :
Communication dans un congrès
CHES, 2016, Santa-Barbara, United States
Liste complète des métadonnées

https://hal.inria.fr/hal-01379296
Contributeur : Dahmun Goudarzi <>
Soumis le : mardi 11 octobre 2016 - 13:02:13
Dernière modification le : jeudi 11 janvier 2018 - 06:28:02

Identifiants

  • HAL Id : hal-01379296, version 1

Collections

Citation

Dahmun Goudarzi, Matthieu Rivain. On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking . CHES, 2016, Santa-Barbara, United States. 〈hal-01379296〉

Partager

Métriques

Consultations de la notice

151