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

DOI10.1007/978-3-319-52153-4_18zbMATH Open1383.94016OpenAlexW2568830080MaRDI QIDQ2975813FDOQ2975813

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

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
• 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 (4)

• Title not available (Why is that?)
• 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

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)