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

被引:10
|
作者
Goudarzi, Dahmun [1 ]
Rivain, Matthieu [1 ,2 ]
机构
[1] CryptoExperts, Paris, France
[2] INRIA & PSL Res Univ, CNRS, ENS, Paris, France
关键词
D O I
10.1007/978-3-662-53140-2_22
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Higher-order masking is a widely used countermeasure to make software implementations 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 ciphers-box(es) allowing the application of standard higher-order masking building blocks such as the ISW scheme (Ishai-Sahai-Wagner, Crypto 2003). Recently, an alternative 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 blockciphers 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. Specifically, 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 stateof-the-art implementations.
引用
收藏
页码:457 / 478
页数:22
相关论文
共 50 条
  • [1] On the Multiplicative Complexity of Boolean Functions
    Selezneva, Svetlana N.
    FUNDAMENTA INFORMATICAE, 2016, 145 (03) : 399 - 404
  • [2] THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS
    SCHNORR, CP
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 45 - 58
  • [3] Circuit Complexity and Multiplicative Complexity of Boolean Functions
    Kojevnikov, Arist
    Kulikov, Alexander S.
    PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 239 - 245
  • [4] Inferring Boolean functions via higher-order correlations
    Markus Maucher
    David V. Kracht
    Steffen Schober
    Martin Bossert
    Hans A. Kestler
    Computational Statistics, 2014, 29 : 97 - 115
  • [5] Constant-time higher-order Boolean-to-arithmetic masking
    Hutter, Michael
    Tunstall, Michael
    JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2019, 9 (02) : 173 - 184
  • [6] On the multiplicative complexity of some Boolean functions
    Selezneva, S. N.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (04) : 724 - 730
  • [7] On the multiplicative complexity of some Boolean functions
    S. N. Selezneva
    Computational Mathematics and Mathematical Physics, 2015, 55 : 724 - 730
  • [8] Constant-time higher-order Boolean-to-arithmetic masking
    Michael Hutter
    Michael Tunstall
    Journal of Cryptographic Engineering, 2019, 9 : 173 - 184
  • [9] BOOLEAN FUNCTIONS SATISFYING HIGHER-ORDER PROPAGATION CRITERIA
    PRENEEL, B
    GOVAERTS, R
    VANDEWALLE, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 141 - 152
  • [10] Inferring Boolean functions via higher-order correlations
    Maucher, Markus
    Kracht, David V.
    Schober, Steffen
    Bossert, Martin
    Kestler, Hans A.
    COMPUTATIONAL STATISTICS, 2014, 29 (1-2) : 97 - 115