The Independence of Linear Approximations in Symmetric Cryptanalysis
From MaRDI portal
Recommendations
Cited in
(19)- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Multidimensional linear cryptanalysis
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- Cryptanalysis of CLT13 multilinear maps with independent slots
- A new test statistic for key recovery attacks using multiple linear approximations
- Affine linear cryptanalysis
- scientific article; zbMATH DE number 1583934 (Why is no real title available?)
- Another look at normal approximations in cryptanalysis
- Capacity and data complexity in multidimensional linear attack
- Evolutionary cryptography against multidimensional linear cryptanalysis
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- The Cryptanalysis of Reduced-Round SMS4
- scientific article; zbMATH DE number 731849 (Why is no real title available?)
- The piling-up approximation in linear cryptanalysis
- Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
- Dependent linear approximations: the algorithm of Biryukov and others revisited
- A geometric approach to linear cryptanalysis
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- Multidimensional linear distinguishing attacks and Boolean functions
This page was built for publication: The Independence of Linear Approximations in Symmetric Cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547933)