Not so difficult in the end: breaking the lookup table-based affine masking scheme
From MaRDI portal
Publication:6620035
DOI10.1007/978-3-031-53368-6_5zbMATH Open1547.94431MaRDI QIDQ6620035
Guilherme Perin, Stjepan Picek, Lichao Wu
Publication date: 16 October 2024
Cryptography (94A60) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Breaking cryptographic implementations using deep learning techniques
- Masking Tables—An Underestimated Security Risk
- Time-Memory Trade-Offs for Side-Channel Resistant Implementations of Block Ciphers
- Affine Masking against Higher-Order Side Channel Analysis
- Unified and Optimized Linear Collision Attacks and Their Application in a Non-profiled Setting
- Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
- Towards sound approaches to counteract power-analysis attacks
- Beyond the Limits of DPA: Combined Side-Channel Collision Attacks
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Higher Order Masking of Look-Up Tables
- Improved Side-Channel Collision Attacks on AES
- Topics in Cryptology – CT-RSA 2006
- Fast Software Encryption
This page was built for publication: Not so difficult in the end: breaking the lookup table-based affine masking scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620035)
