Fast and memory-efficient key recovery in side-channel attacks
From MaRDI portal
Publication:2807219
DOI10.1007/978-3-319-31301-6_19zbMATH Open1396.94062OpenAlexW2899670054MaRDI QIDQ2807219FDOQ2807219
Authors: Andrey Bogdanov, Ilya Kizhvatov, Kamran Manzoor, Elmar Tischhauser, Marc F. Witteman 
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_19
Recommendations
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- An optimal key enumeration algorithm and its application to side-channel attacks
- Counting Keys in Parallel After a Side Channel Attack
- Soft analytical side-channel attacks
- Two sides of the same coin: counting and enumerating keys post side-channel attacks revisited
Cites Work
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Intel’s New AES Instructions for Enhanced Performance and Security
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- ALE: AES-Based Lightweight Authenticated Encryption
- Soft Analytical Side-Channel Attacks
- Multi-target DPA Attacks: Pushing DPA Beyond the Limits of a Desktop Computer
- Fast and Memory-Efficient Key Recovery in Side-Channel Attacks
- Improving DPA by peak distribution analysis
- An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks
Cited In (17)
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Recovering short secret keys of RLCE in polynomial time
- Ephemeral key recovery using index calculus method
- An improved recovery algorithm for decayed AES key schedule images
- Efficient key recovery for all HFE signature variants
- Quantum key search with side channel advice
- Cryptographic Side-Channels from Low-Power Cache Memory
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- Differential Bias Attack for Block Cipher Under Randomized Leakage with Key Enumeration
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
- Counting Keys in Parallel After a Side Channel Attack
- Fast and Memory-Efficient Key Recovery in Side-Channel Attacks
- A direct key recovery attack on SIDH
- An efficient key recovery attack on SIDH
- Practical Key-Recovery for All Possible Parameters of SFLASH
- Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
Uses Software
This page was built for publication: Fast and memory-efficient key recovery in side-channel attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807219)
