Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
From MaRDI portal
Publication:2120989
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
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1979285 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 1504808 (Why is no real title available?)
- scientific article; zbMATH DE number 1878339 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Affine Masking against Higher-Order Side Channel Analysis
- Algebraic decomposition for probing security
- Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
- Boolean functions for cryptography and coding theory
- Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
- Cryptographic Hardware and Embedded Systems - CHES 2004
- DPA Leakage Models for CMOS Logic Circuits
- First-Order Differential Power Analysis on the Duplication Method
- Higher-Order Threshold Implementations
- Masking AES with \(d+1\) shares in hardware
- Montgomery’s Trick and Fast Implementation of Masked AES
- Provably secure higher-order masking of AES
- Pushing the limits: a very compact and a threshold implementation of AES
- Secure Multiparty AES
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Secure multiplicative masking of power functions
- Selected Areas in Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Towards sound approaches to counteract power-analysis attacks
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)
