The Complexity of Distinguishing Distributions (Invited Talk)

DOI10.1007/978-3-540-85093-9_20zbMATH Open1162.94334OpenAlexW2249051130MaRDI QIDQ5502803FDOQ5502803

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• IX. On the problem of the most efficient tests of statistical hypotheses
• Title not available (Why is that?)
• How Far Can We Go Beyond Linear Cryptanalysis?
• Linear Cryptanalysis of Non Binary Ciphers

Cited In (20)

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

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)