Algebraic decomposition for probing security

DOI10.1007/978-3-662-47989-6_36MaRDI QIDQ3457137zbMATH OpenOpenAlexFDO

Authors Claude Carlet, Emmanuel Prouff, Matthieu Rivain, Thomas Roche

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47989-6_36

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Towards tight random probing security
• Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
• Noisy leakage revisited
• Algebraic side-channel attacks
• Fast verification of masking schemes in characteristic two

Cites work

• A fast and provably secure higher-order masking of AES S-box
• Efficient masked S-boxes processing -- a step forward
• Higher-order glitches free implementation of the AES using secure multi-party computation protocols
• Higher-order masking schemes for S-boxes
• Masking against Side-Channel Attacks: A Formal Security Proof
• Provably secure higher-order masking of AES
• Pushing the limits: a very compact and a threshold implementation of AES
• Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
• Secure hardware implementation of nonlinear functions in the presence of glitches
• Side-channel resistant crypto for less than 2,300 GE
• Threshold implementations of all 3 3 and 4 4 S-boxes
• Threshold implementations of small S-boxes
• Unifying leakage models: from probing attacks to noisy leakage.

Cited in

(14)

• Uniform first-order threshold implementations
• Statistical properties of side-channel and fault injection attacks using coding theory
• Tornado: automatic generation of probing-secure masked bitsliced implementations
• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials
• Decomposition of permutations in a finite field
• Polynomial evaluation and side channel analysis
• Algorithmic Tamper-Proof Security under Probing Attacks
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms
• scientific article; zbMATH DE number 7211469 (Why is no real title available?)
• How fast can higher-order masking be in software?
• Dynamic random probing expansion with quasi linear asymptotic complexity
• On decompositions of permutation polynomials into quadratic and cubic power permutations
• Exploiting algebraic structures in probing security

This page was built for publication: Algebraic decomposition for probing security

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