Secure multiplicative masking of power functions
From MaRDI portal
Recommendations
Cited in
(16)- Improved side-channel analysis of finite-field multiplication
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Speed-up of SCA attacks on 32-bit multiplications
- Polynomial evaluation and side channel analysis
- Montgomery’s Trick and Fast Implementation of Masked AES
- Protecting AES with Shamir's secret sharing scheme
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- On masked Galois-field multiplication for authenticated encryption resistant to side channel analysis
- Quadrivariate improved blind side-channel analysis on Boolean masked AES
- Threshold implementation in software. Case study of PRESENT
- Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
- AES side-channel countermeasure using random tower field constructions
- scientific article; zbMATH DE number 1979285 (Why is no real title available?)
- Hamming weight attacks on cryptographic hardware -- breaking masking defense
- Simple power analysis on AES key expansion revisited
- From arithmetic to Shamir: secure and efficient masking gadgets for multiplications. Applications to the post-quantum signature scheme MQOM
This page was built for publication: Secure multiplicative masking of power functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575047)