Publication

On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Complexity of Matsui's Attack

Pascal Junod

Linear cryptanalysis remains the most powerful attack against DES at this time. Given

2^{43}

known plaintext-ciphertext pairs, Matsui expected a complexity of less than

2^{43}

DES evaluations in 85% of the cases for recovering the key. In this paper, w ...

2001

On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks

Graph Chatbot

Chat with Graph Search

A multiple birthday attack on NTRU

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

Hash-and-Sign with Weak Hashing Made Secure

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

A Laplace mixture model for the identification of differential expression in microarrays

Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty

The conditional correlation attack: a practical attack on Bluetooth encryption

Revisiting Liveness Properties in the Context of Secure Systems

On the Complexity of Matsui's Attack

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

A Laplace mixture model for the identification of differential expression in microarrays

A multiple birthday attack on NTRU

Hash-and-Sign with Weak Hashing Made Secure

Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty

Revisiting Liveness Properties in the Context of Secure Systems

On the Complexity of Matsui's Attack

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

The conditional correlation attack: a practical attack on Bluetooth encryption