Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
DOI10.1007/S12095-021-00497-9zbMATH Open1485.94103OpenAlexW3186156404MaRDI QIDQ2120989FDOQ2120989
Authors: Simon Landry, Yanis Linge, Emmanuel Prouff 
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00497-9
Recommendations
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications
- Polynomial evaluation and side channel analysis
- From quadratic functions to polynomials: generic functional encryption from standard assumptions
- Functional encryption for cubic polynomials and implementation
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- Complexity and performance of secure floating-point polynomial evaluation protocols
- scientific article; zbMATH DE number 3859027
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- DPA Leakage Models for CMOS Logic Circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Montgomery’s Trick and Fast Implementation of Masked AES
- Secure multiplicative masking of power functions
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Selected Areas in Cryptography
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Towards sound approaches to counteract power-analysis attacks
- Algebraic decomposition for probing security
- Provably secure higher-order masking of AES
- Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Affine Masking against Higher-Order Side Channel Analysis
- Masking AES with \(d+1\) shares in hardware
- Pushing the limits: a very compact and a threshold implementation of AES
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- Higher-Order Threshold Implementations
- Boolean functions for cryptography and coding theory
- Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- Secure Multiparty AES
- First-Order Differential Power Analysis on the Duplication Method
Cited In (7)
- Affine equivalence and its application to tightening threshold implementations
- Threshold implementations with non-uniform inputs
- Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
- Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
- Side-channel attacks on threshold implementations using a glitch algebra
- A more efficient AES threshold implementation
- Uniform first-order threshold implementations
This page was built for publication: Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120989)
