A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
From MaRDI portal
Publication:2975813
Recommendations
- An optimal key enumeration algorithm and its application to side-channel attacks
- 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
- Parallel decryption queries in bounded chosen ciphertext attacks
- A tight bound for exhaustive key search attacks against message authentication codes
- Fast and memory-efficient key recovery in side-channel attacks
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Side-channel cryptographic attacks using pseudo-Boolean optimization
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
Cites work
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 1979273 (Why is no real title available?)
- scientific article; zbMATH DE number 1857508 (Why is no real title available?)
- scientific article; zbMATH DE number 1878336 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- A new framework for constraint-based probabilistic template side channel attacks
- An optimal key enumeration algorithm and its application to side-channel attacks
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Counting Keys in Parallel After a Side Channel Attack
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Fast and memory-efficient key recovery in side-channel attacks
- Improving DPA by peak distribution analysis
- Optimal key ranking procedures in a statistical cryptanalysis.
- 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
- Simpler and more efficient rank estimation for side-channel security assessment
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(9)- How to sequentialize independent parallel attacks? Biased distributions have a phase transition
- An optimal key enumeration algorithm and its application to side-channel attacks
- Fast and memory-efficient key recovery in side-channel attacks
- scientific article; zbMATH DE number 1942425 (Why is no real title available?)
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
- Counting Keys in Parallel After a Side Channel Attack
- Two sides of the same coin: counting and enumerating keys post side-channel attacks revisited
- Simple key enumeration (and rank estimation) using histograms: an integrated approach
- Differential bias attack for block cipher under randomized leakage with key enumeration
This page was built for publication: A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975813)
