Polynomial evaluation and side channel analysis
From MaRDI portal
Publication:2803637
Recommendations
Cites work
- scientific article; zbMATH DE number 1088241 (Why is no real title available?)
- scientific article; zbMATH DE number 1759297 (Why is no real title available?)
- scientific article; zbMATH DE number 1878332 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- A New DPA Countermeasure Based on Permutation Tables
- A fast and provably secure higher-order masking of AES S-box
- A generic protection against high-order differential power analysis.
- Advances in Cryptology - CRYPTO 2003
- Algebraic decomposition for probing security
- An efficient optimal normal basis type II multiplier
- Attack on a higher-order masking of the AES based on homographic functions
- Conversion of security proofs from one leakage model to another: a new issue
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Efficient Multiplication Using Type 2 Optimal Normal Bases
- Efficient and optimal exponentiation in finite fields
- Efficient masked S-boxes processing -- a step forward
- Evaluation of polynomials by computer
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- Higher order masking of look-up tables
- Higher-order glitches free implementation of the AES using secure multi-party computation protocols
- Higher-order masking schemes for S-boxes
- Higher-order side channel security and mask refreshing
- How to share a secret
- Information Security and Cryptology - ICISC 2005
- Masking against Side-Channel Attacks: A Formal Security Proof
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the practical security of a leakage resilient masking scheme
- PRESENT: An Ultra-Lightweight Block Cipher
- Protecting AES with Shamir's secret sharing scheme
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Provably secure higher-order masking of AES
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Secure Computation from Random Error Correcting Codes
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- The evaluation of polynomials
- Theory and practice of a leakage resilient masking scheme
- Topics in Cryptology – CT-RSA 2005
- Topics in Cryptology – CT-RSA 2006
- Towards sound approaches to counteract power-analysis attacks
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(9)- scientific article; zbMATH DE number 1925556 (Why is no real title available?)
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Multi-Party Secure Computation of Multi-Variable Polynomials
- Impact of S-boxes size upon side channel resistance and block cipher design
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- Higher-order masking schemes for S-boxes
- Secure multiplicative masking of power functions
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
This page was built for publication: Polynomial evaluation and side channel analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803637)
