Another look at normal approximations in cryptanalysis
From MaRDI portal
Recommendations
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- A new test statistic for key recovery attacks using multiple linear approximations
- scientific article; zbMATH DE number 1952897
- Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
Cites work
- scientific article; zbMATH DE number 3128684 (Why is no real title available?)
- scientific article; zbMATH DE number 176548 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 699423 (Why is no real title available?)
- scientific article; zbMATH DE number 2009946 (Why is no real title available?)
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- scientific article; zbMATH DE number 775283 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406761 (Why is no real title available?)
- scientific article; zbMATH DE number 1406764 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- scientific article; zbMATH DE number 3298449 (Why is no real title available?)
- scientific article; zbMATH DE number 3333834 (Why is no real title available?)
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- A Practical Attack on Broadcast RC4
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- Advances in Cryptology – CRYPTO 2004
- Bounds in shallows and in miseries
- Dependence of the Berry-Esseen estimate on the dimension
- Differential cryptanalysis of DES-like cryptosystems
- Distinguishing distributions using Chernoff information
- How Far Can We Go Beyond Linear Cryptanalysis?
- Multidimensional Extension of Matsui’s Algorithm 2
- Multiple differential cryptanalysis using LLR and \(\chi^2\) statistics
- Multiple differential cryptanalysis: theory and practice
- On linear hulls, statistical saturation attacks, PRESENT and a cryptanalysis of PUFFIN
- On probability of success in linear and differential cryptanalysis
- On the Distribution of Linear Biases: Three Instructive Examples
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Optimal key ranking procedures in a statistical cryptanalysis.
- Power Approximations to Multinomial Tests of Fit
- Probability distributions of correlation and differentials in block ciphers
- Refinement of the upper bounds of the constants in Lyapunov's theorem
- The Independence of Linear Approximations in Symmetric Cryptanalysis
Cited in
(5)- Statistical fault attacks on nonce-based authenticated encryption schemes
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- Another look at key randomisation hypotheses
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
This page was built for publication: Another look at normal approximations in cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293721)
