Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
From MaRDI portal
(Redirected from Publication:5114631)
Recommendations
- Uniform first-order threshold implementations
- Threshold implementations of all 3 3 and 4 4 S-boxes
- Enabling 3-share threshold implementations for all 4-bit S-boxes
- Threshold implementations of small S-boxes
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
Cited in
(14)- Uniform first-order threshold implementations
- Spectral characterization of iterating lossy mappings
- Leakage resilient value comparison with application to message authentication
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Constructions of S-boxes with uniform sharing
- Cryptanalysis of masked ciphers: a not so random idea
- A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
- A first-order SCA resistant AES without fresh randomness
- Analyzing masked ciphers against transition and coupling effects
- WrapQ: Side-Channel Secure Key Management for Post-quantum Cryptography
- A low-randomness second-order masked AES
- Accelerating SLH-DSA by two orders of magnitude with a single hash unit
- New first-order secure AES implementation without online fresh randomness records
- Protecting AES-128 against first-order side-channel analysis in micro-architectures by enforcing threshold implementation principles
This page was built for publication: Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114631)
