Masking tables -- an underestimated security risk
From MaRDI portal
Publication:2946889
DOI10.1007/978-3-662-43933-3_22zbMATH Open1321.94094OpenAlexW1472434837MaRDI QIDQ2946889FDOQ2946889
Authors: Michael Tunstall, Carolyn Whitnall, Elisabeth Oswald 
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_22
Recommendations
Cites Work
- Fast Software Encryption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2005
- Known-Key Distinguishers for Some Block Ciphers
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Higher-order glitches free implementation of the AES using secure multi-party computation protocols
- Fast Software Encryption
- The world is not enough: another look on second-order DPA
- Power Analysis Attacks
- Topics in Cryptology – CT-RSA 2006
- Towards sound approaches to counteract power-analysis attacks
- Title not available (Why is that?)
- Provably secure higher-order masking of AES
- Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
- Topics in Cryptology – CT-RSA 2005
- Applied Cryptography and Network Security
- The Myth of Generic DPA…and the Magic of Learning
- Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings
- Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings
- Generic side-channel distinguishers: improvements and limitations
- Affine Masking against Higher-Order Side Channel Analysis
- Cryptographic hardware and embedded systems -- CHES 2007. 9th international workshop, Vienna, Austria, September 10--13, 2007. Proceedings
- A fast and provably secure higher-order masking of AES S-box
Cited In (20)
- SCATTER: a new dimension in side-channel
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Masking with randomized look up tables. Towards preventing side-channel attacks of all orders
- Revisiting a masked lookup-table compression scheme
- Taylor expansion of maximum likelihood attacks for masked and shuffled implementations
- Template Attacks on Masking—Resistance Is Futile
- Hamming weight attacks on cryptographic hardware -- breaking masking defense
- Higher order masking of look-up tables
- Statistical properties of side-channel and fault injection attacks using coding theory
- Consolidating masking schemes
- Multivariate high-order attacks of shuffled tables recomputation
- Reconciling \((d+1)\) masking in hardware and software
- Consolidating inner product masking
- Selected Areas in Cryptography
- Security evaluation against side-channel analysis at compilation time
- Detecting flawed masking schemes with leakage detection tests
- Not so difficult in the end: breaking the lookup table-based affine masking scheme
- Combining loop shuffling and code polymorphism for enhanced AES side-channel security
- Multi-variate high-order attacks of shuffled tables recomputation
- Cryptanalysis of masked ciphers: a not so random idea
This page was built for publication: Masking tables -- an underestimated security risk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946889)
