Polynomial evaluation and side channel analysis
From MaRDI portal
Publication:2803637
DOI10.1007/978-3-662-49301-4_20zbMATH Open1405.94050OpenAlexW2500603846MaRDI QIDQ2803637FDOQ2803637
Authors: Claude Carlet, Emmanuel Prouff 
Publication date: 2 May 2016
Published in: The New Codebreakers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_20
Recommendations
Cites Work
- How to share a secret
- Title not available (Why is that?)
- PRESENT: An Ultra-Lightweight Block Cipher
- Secure Computation from Random Error Correcting Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Higher-order glitches free implementation of the AES using secure multi-party computation protocols
- Title not available (Why is that?)
- Cryptographic Hardware and Embedded Systems - CHES 2004
- An efficient optimal normal basis type II multiplier
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2006
- Towards sound approaches to counteract power-analysis attacks
- Algebraic decomposition for probing security
- Provably secure higher-order masking of AES
- Efficient and optimal exponentiation in finite fields
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Theory and practice of a leakage resilient masking scheme
- A generic protection against high-order differential power analysis.
- The evaluation of polynomials
- Topics in Cryptology – CT-RSA 2005
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Higher-order side channel security and mask refreshing
- Higher-order masking schemes for S-boxes
- Higher order masking of look-up tables
- Masking against Side-Channel Attacks: A Formal Security Proof
- Unifying leakage models: from probing attacks to noisy leakage.
- Evaluation of polynomials by computer
- On the practical security of a leakage resilient masking scheme
- Efficient masked S-boxes processing -- a step forward
- Protecting AES with Shamir's secret sharing scheme
- A fast and provably secure higher-order masking of AES S-box
- Conversion of security proofs from one leakage model to another: a new issue
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Attack on a higher-order masking of the AES based on homographic functions
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- A New DPA Countermeasure Based on Permutation Tables
- Efficient Multiplication Using Type 2 Optimal Normal Bases
- Information Security and Cryptology - ICISC 2005
Cited In (9)
- Secure multiplicative masking of power functions
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Higher-order masking schemes for S-boxes
- 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
- Title not available (Why is that?)
- 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
Uses Software
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)
