Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing

DOI10.1007/978-3-319-66787-4_7zbMATH Open1440.94043OpenAlexW2758799253MaRDI QIDQ5114631FDOQ5114631

Joan Daemen

Publication date: 24 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/179130

Recommendations

• Uniform first-order threshold implementations
• Threshold implementations of all \(3 \times 3\) and \(4 \times 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

zbMATH Keywords

uniformitythreshold schemesside-channel attacksKeccak

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (9)

• A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• A low-randomness second-order masked AES
• Leakage resilient value comparison with application to message authentication
• Accelerating SLH-DSA by two orders of magnitude with a single hash unit
• Analyzing masked ciphers against transition and coupling effects
• WrapQ: Side-Channel Secure Key Management for Post-quantum Cryptography
• A First-Order SCA Resistant AES Without Fresh Randomness
• Cryptanalysis of masked ciphers: a not so random idea

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)