Cryptology ePrint Archive: Report 2019/1247

A Note on Masking Generic Boolean Functions

Lauren De Meyer and 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.

Category / Keywords: secret-key cryptography / SCA, DPA, Threshold Implementations, d + 1 Masking, Hamming Graph, Graph Colouring

Date: received 24 Oct 2019

Contact author: lauren demeyer at esat kuleuven be,felix wegener@rub de

Available format(s): PDF | BibTeX Citation

Version: 20191024:094308 (All versions of this report)

Short URL: ia.cr/2019/1247


[ Cryptology ePrint archive ]