Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures

DOI10.1007/978-3-662-44709-3_10MaRDI QIDQ5265079zbMATH OpenOpenAlexFDO

Authors Jean-Sébastien Coron, Arnab Roy, Srinivas Vivek

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

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06)

Recommendations

• Faster evaluation of sboxes via common shares
• Reducing the number of non-linear multiplications in masking schemes
• Polynomial evaluation and side channel analysis
• Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version

Cited in

(8)

• How fast can higher-order masking be in software?
• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• Decomposition of permutations in a finite field
• Tornado: automatic generation of probing-secure masked bitsliced implementations
• On decompositions of permutation polynomials into quadratic and cubic power permutations
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• Faster secure multi-party computation of AES and DES using lookup tables
• Polynomial evaluation and side channel analysis

This page was built for publication: Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265079)