Cryptology ePrint Archive: Report 2021/369

Another Algebraic Decomposition Method for Masked Implementation

Shoichi Hirose

Abstract: Side channel attacks are serious concern for implementation of cryptosystems. Masking is an effective countermeasure against them and masked implementation of block ciphers has been attracting active research. It is an obstacle to efficient masked implementation that the complexity of an evaluation of multiplication is quadratic in the order of masking. A direct approach to this problem is to explore methods to reduce the number of multiplications required to represent an S-box. An alternative approach proposed by Carlet et al. in 2015 is to represent an S-box as composition of polynomials with low algebraic degrees. We follow the latter approach and propose to use a special type of polynomials with a low algebraic degree as components, which we call generalized multiplication (GM) polynomials. The masking scheme for multiplication can be applied to a GM polynomial, which is more efficient than the masking scheme for a polynomial with a low algebraic degree. Our experimental results show that, for 4-/6-/8-bit permutations, the proposed decomposition method is more efficient than the method by Carlet et al. in most cases in terms of the number of evaluations of low-algebraic-degree polynomials required by masking.

Category / Keywords: secret-key cryptography / Algebraic decomposition, Boolean function, Masking, S-box

Original Publication (with minor differences): EAI AC3 2021

Date: received 18 Mar 2021

Contact author: hrs_shch at u-fukui ac jp

Available format(s): PDF | BibTeX Citation

Version: 20210322:193142 (All versions of this report)

Short URL: ia.cr/2021/369


[ Cryptology ePrint archive ]