An optimal key enumeration algorithm and its application to side-channel attacks
From MaRDI portal
Recommendations
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- Counting Keys in Parallel After a Side Channel Attack
- Fast and memory-efficient key recovery in side-channel attacks
- Two sides of the same coin: counting and enumerating keys post side-channel attacks revisited
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
Cites work
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- A formal study of power variability issues and side-channel attacks for nanoscale devices
- Algebraic Methods in Side-Channel Collision Attacks and Practical Collision Detection
- Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA
- Algebraic side-channel analysis in the presence of errors
- Algebraic side-channel attacks
- Cryptographic hardware and embedded systems -- CHES 2004. 6th international workshop, Cambridge, MA, USA, August 11--13, 2004. Proceedings.
- Fast software encryption. 10th international workshop, FSE 2003, Lund, Sweden, February 24--26, 2003. Revised papers
- Improved Side-Channel Collision Attacks on AES
- Improving DPA by peak distribution analysis
- Selecting cryptographic key sizes
Cited in
(27)- The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants
- A template attack to reconstruct the input of SHA-3 on an 8-bit device
- Fooling an unbounded adversary with a short key, repeatedly: The honey encryption perspective
- On recovering block cipher secret keys in the cold boot attack setting
- Quantum key search with side channel advice
- Fast and memory-efficient key recovery in side-channel attacks
- scientific article; zbMATH DE number 1759790 (Why is no real title available?)
- scientific article; zbMATH DE number 1759477 (Why is no real title available?)
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- Security analysis of deterministic re-keying with masking and shuffling: application to ISAP
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
- Counting Keys in Parallel After a Side Channel Attack
- Characterisation and estimation of the key rank distribution in the context of side channel evaluations
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- An efficient key recovery attack on SIDH
- Unknown-input attacks in the parallel setting: improving the security of the CHES 2012 leakage-resilient PRF
- Theoretical security evaluation against side-channel cube attack with key enumeration
- Two sides of the same coin: counting and enumerating keys post side-channel attacks revisited
- Optimal recovery of secret keys from weak side channel traces
- A way to improve the key recovery accuracy based on dynamic programming
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
- Security evaluations beyond computing power. How to analyze side-channel attacks you cannot mount?
- Simple key enumeration (and rank estimation) using histograms: an integrated approach
- Differential bias attack for block cipher under randomized leakage with key enumeration
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
- On the worst-case side-channel security of ECC point randomization in embedded devices
- Chipwhisperer: an open-source platform for hardware embedded security research
This page was built for publication: An optimal key enumeration algorithm and its application to side-channel attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455513)
