Paper 2019/1247

A Note on Masking Generic Boolean Functions

Lauren De Meyer, Felix Wegener, and Amir Moradi

Abstract

Masking is a popular countermeasure to protect cryptographic implementations against side-channel attacks (SCA). In the literature, a myriad of proposals of masking schemes can be found. They are typically defined by a masked multiplication, since this can serve as a basic building block for any nonlinear algorithm. However, when masking generic Boolean functions of algebraic degree t, it is very inefficient to construct the implementation from masked multiplications only. Further, it is not immediately clear from the description of a masked multiplication, how to efficiently implement a masked Boolean function. In this work, we fill this gap in the literature with a detailed description and investigation of a generic masking methodology for Boolean functions of any degree t at any security order d.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. Minor revision.
Keywords
SCADPAThreshold Implementationsd + 1 MaskingHamming GraphGraph Colouring
Contact author(s)
lauren demeyer @ esat kuleuven be
felix wegener @ rub de
History
2020-03-03: last of 2 revisions
2019-10-24: received
See all versions
Short URL
https://ia.cr/2019/1247
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1247,
      author = {Lauren De Meyer and Felix Wegener and Amir Moradi},
      title = {A Note on Masking Generic Boolean Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1247},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1247}},
      url = {https://eprint.iacr.org/2019/1247}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.