A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
From MaRDI portal
Publication:2975813
DOI10.1007/978-3-319-52153-4_18zbMATH Open1383.94016OpenAlexW2568830080MaRDI QIDQ2975813FDOQ2975813
Authors: Liron David, Avishai Wool 
Publication date: 12 April 2017
Published in: Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-52153-4_18
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
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Title not available (Why is that?)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal key ranking procedures in a statistical cryptanalysis.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Cryptographic Hardware and Embedded Systems - CHES 2004
- 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
- Counting Keys in Parallel After a Side Channel Attack
- Fast and memory-efficient key recovery in side-channel attacks
- Improving DPA by peak distribution analysis
- Simpler and more efficient rank estimation for side-channel security assessment
- An optimal key enumeration algorithm and its application to side-channel attacks
- A new framework for constraint-based probabilistic template side channel attacks
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
- Title not available (Why is that?)
- 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)
