Polynomial Evaluation and Side Channel Analysis

Claude Carlet (1, 2) , Emmanuel Prouff (3, 4)

1 Université Paris 8 Vincennes-Saint-Denis - Département de Mathématiques
2 LAGA - Laboratoire Analyse, Géométrie et Applications
3 LCR - Laboratoire de cryptographie de l'ANSSI
4 PolSys - Polynomial Systems

Side Channel Analysis (SCA) is a class of attacks that exploits leakage of information from a cryptographic implementation during execution. To thwart it, masking is a common countermeasure. The principle is to randomly split every sensitive intermediate variable occurring in the computation into several shares and the number of shares, called the masking order, plays the role of a security parameter. The main issue while applying masking to protect a block cipher implementation is to specify an efficient scheme to secure the s-box computations. Several masking schemes, applicable for arbitrary orders, have been recently introduced. Most of them follow a similar approach originally introduced in the paper of Carlet et al published at FSE 2012; the s-box to protect is viewed as a polynomial and strategies are investigated which minimize the number of field multiplications which are not squarings. This paper aims at presenting all these works in a comprehensive way. The methods are discussed, their differences and similarities are identified and the remaining open problems are listed.

Domains: Cryptography and Security [cs.CR]; Embedded Systems; Information Theory [cs.IT]

Claude Carlet, Emmanuel Prouff. Polynomial Evaluation and Side Channel Analysis. The New Codebreakers, 9100, Springer, pp.315 - 341, 2016, Lecture Notes in Computer Science, 978-3-662-49300-7. ⟨10.1007/978-3-662-49301-4_20⟩. ⟨hal-01399573⟩