Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
From MaRDI portal
Publication:2349643
Recommendations
Cites work
- scientific article; zbMATH DE number 2009946 (Why is no real title available?)
- scientific article; zbMATH DE number 1455098 (Why is no real title available?)
- scientific article; zbMATH DE number 2085206 (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?)
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- On probability of success in linear and differential cryptanalysis
- 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
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)