Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
From MaRDI portal
Publication:5265079
DOI10.1007/978-3-662-44709-3_10zbMath1375.94117OpenAlexW2187461352MaRDI QIDQ5265079
Jean-Sébastien Coron, Srinivas Vivek, Arnab Roy
Publication date: 21 July 2015
Published in: Advanced Information Systems Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44709-3_10
Related Items (5)
Decomposition of permutations in a finite field ⋮ On decompositions of permutation polynomials into quadratic and cubic power permutations ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Tornado: automatic generation of probing-secure masked bitsliced implementations
This page was built for publication: Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
