Rigorous upper bounds on data complexities of block cipher cryptanalysis
From MaRDI portal
(Redirected from Publication:1676236)
Recommendations
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- Another look at normal approximations in cryptanalysis
- scientific article; zbMATH DE number 1952897
Cites work
- scientific article; zbMATH DE number 503238 (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 819814 (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 1418251 (Why is no real title available?)
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- Advances in Cryptology – CRYPTO 2004
- Another look at normal approximations in cryptanalysis
- Bounds in shallows and in miseries
- Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
- Cube Attacks on Tweakable Black Box Polynomials
- Differential cryptanalysis of DES-like cryptosystems
- Distinguishing distributions using Chernoff information
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Higher Order Derivatives and Differential Cryptanalysis
- How Far Can We Go Beyond Linear Cryptanalysis?
- Multidimensional Extension of Matsui’s Algorithm 2
- Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- Multidimensional linear distinguishing attacks and Boolean functions
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- 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.
- Probability and Computing
- The Complexity of Distinguishing Distributions (Invited Talk)
- The Independence of Linear Approximations in Symmetric Cryptanalysis
- The improbable differential attack: cryptanalysis of reduced round CLEFIA
Cited in
(12)- Distinguishing attacks on block ciphers by differentials of two-block texts
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- Another look at normal approximations in cryptanalysis
- Improved truncated differential distinguishers of AES with concrete S-box
- Upper estimates of imbalance of bilinear approximations for round functions of block ciphers
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- Lower bounds on the degree of block ciphers
- How much data may be safely processed on one key in different modes?
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
- Accurate estimates of the data complexity and success probability for various cryptanalyses
This page was built for publication: Rigorous upper bounds on data complexities of block cipher cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676236)
