Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
From MaRDI portal
Recommendations
Cites work
- A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma
- Linear cryptanalysis method for DES cipher
- On probability of success in linear and differential cryptanalysis
- On the complexity of Matsui's attack
- On the optimality of linear, differential, and sequential distinguishers
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Optimal key ranking procedures in a statistical cryptanalysis.
- Probability distributions of correlation and differentials in block ciphers
- Properties of linear approximation tables
- The first experimental cryptanalysis of the Data Encryption Standard
Cited in
(3)
This page was built for publication: Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349643)