Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
From MaRDI portal
Publication:1749795
Recommendations
- Another look at success probability of linear cryptanalysis
- On probability of success in linear and differential cryptanalysis
- On probability of success in linear and differential cryptanalysis
- Multidimensional linear cryptanalysis
- Accurate estimates of the data complexity and success probability for various cryptanalyses
Cites work
- A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma
- A known plaintext attack of FEAL-4 and FEAL-6
- A new test statistic for key recovery attacks using multiple linear approximations
- Another look at normal approximations in cryptanalysis
- Approximation theorems of mathematical statistics
- Capacity and data complexity in multidimensional linear attack
- Distinguishing distributions using Chernoff information
- How far can we go beyond linear cryptanalysis?
- scientific article; zbMATH DE number 775283 (Why is no real title available?)
- scientific article; zbMATH DE number 3298449 (Why is no real title available?)
- Integral and multidimensional linear distinguishers with correlation zero
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Linear cryptanalysis method for DES cipher
- Linear cryptanalysis using multiple approximations
- Linear hulls with correlation zero and linear cryptanalysis of block ciphers
- Multidimensional Extension of Matsui’s Algorithm 2
- Multiple differential cryptanalysis using LLR and ^2 statistics
- On multiple linear approximations
- On probability of success in linear and differential cryptanalysis
- On the optimality of linear, differential, and sequential distinguishers
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Probability distributions of correlation and differentials in block ciphers
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- The first experimental cryptanalysis of the Data Encryption Standard
- The Independence of Linear Approximations in Symmetric Cryptanalysis
- Zero correlation linear cryptanalysis with reduced data complexity
- Zero-correlation linear cryptanalysis with FFT and improved attacks on ISO standards Camellia and CLEFIA
Cited in
(10)- Revisiting the wrong-key-randomization hypothesis
- Another look at success probability of linear cryptanalysis
- A new test statistic for key recovery attacks using multiple linear approximations
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- On probability of success in linear and differential cryptanalysis
- Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes
- On probability of success in linear and differential cryptanalysis
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Another look at key randomisation hypotheses
- Probability method for cryptanalysis of general multivariate modular linear equation
This page was built for publication: Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749795)