Skip to Main content Skip to Navigation
Book sections

Polynomial Evaluation and Side Channel Analysis

Abstract : 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.
Complete list of metadata

Cited literature [63 references]  Display  Hide  Download
Contributor : Emmanuel Prouff Connect in order to contact the contributor
Submitted on : Saturday, November 19, 2016 - 4:23:19 PM
Last modification on : Tuesday, November 16, 2021 - 4:16:47 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 10:46:43 AM


Files produced by the author(s)



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⟩



Record views


Files downloads