The Complexity of Distinguishing Distributions (Invited Talk)

DOI10.1007/978-3-540-85093-9_20MaRDI QIDQ5502803zbMATH OpenOpenAlexFDO

Authors Thomas Baignères, Serge Vaudenay

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)

Recommendations

• scientific article; zbMATH DE number 2009946
• Sublinear bounds on the distinguishing advantage for multiple samples
• Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers
• How Far Can We Go Beyond Linear Cryptanalysis?
• On Large Distributions for Linear Cryptanalysis

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• How Far Can We Go Beyond Linear Cryptanalysis?
• IX. On the problem of the most efficient tests of statistical hypotheses
• Linear Cryptanalysis of Non Binary Ciphers

Cited in

(20)

• k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits
• scientific article; zbMATH DE number 6474904 (Why is no real title available?)
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• scientific article; zbMATH DE number 2009946 (Why is no real title available?)
• Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers
• Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers
• Multidimensional linear cryptanalysis
• Sublinear bounds on the distinguishing advantage for multiple samples
• A theoretical study of Kolmogorov-Smirnov distinguishers
• Computational indistinguishability: A sample hierarchy
• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
• Capacity and data complexity in multidimensional linear attack
• Asymptotic information leakage under one-try attacks
• Distinguishing distributions using Chernoff information
• Multiple differential cryptanalysis: theory and practice
• Distinguishing two probability ensembles with one sample from each ensemble
• Information-theoretic indistinguishability via the chi-squared method
• \texttt{Sample(x)=(a*x<=t)} is a distinguisher with probability \(1/8\)
• A note on the use of margins to compare distinguishers
• Rigorous upper bounds on data complexities of block cipher cryptanalysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502803)