The Complexity of Distinguishing Distributions (Invited Talk)

DOI10.1007/978-3-540-85093-9_20zbMath1162.94334OpenAlexW2249051130MaRDI QIDQ5502803

Serge Vaudenay, Thomas Baignères

Publication date: 9 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/126225

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Capacity and Data Complexity in Multidimensional Linear Attack ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 ⋮ Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers ⋮ k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits ⋮ Accurate estimates of the data complexity and success probability for various cryptanalyses ⋮ Multidimensional linear cryptanalysis ⋮ Multiple Differential Cryptanalysis: Theory and Practice ⋮ Asymptotic information leakage under one-try attacks

Cites Work

• IX. On the problem of the most efficient tests of statistical hypotheses
• Linear Cryptanalysis of Non Binary Ciphers
• How Far Can We Go Beyond Linear Cryptanalysis?
• Unnamed Item
• Unnamed Item

This page was built for publication: The Complexity of Distinguishing Distributions (Invited Talk)