A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks

DOI10.1007/978-3-319-52153-4_18zbMath1383.94016OpenAlexW2568830080MaRDI QIDQ2975813

Avishai Wool, Liron David

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Score-Based vs. Probability-Based Enumeration – A Cautionary Note ⋮ Differential Bias Attack for Block Cipher Under Randomized Leakage with Key Enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Simpler and More Efficient Rank Estimation for Side-Channel Security Assessment
• Improving DPA by Peak Distribution Analysis
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks
• A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
• Analysis of Pseudo Random Sequences Generated by Cellular Automata
• Security Evaluations beyond Computing Power
• A New Framework for Constraint-Based Probabilistic Template Side Channel Attacks
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Fast Software Encryption

This page was built for publication: A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks