Optimal key ranking procedures in a statistical cryptanalysis.
From MaRDI portal
Recommendations
Cited in
(21)- An overview of distinguishing attacks on stream ciphers
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Multidimensional linear cryptanalysis
- Revisiting the wrong-key-randomization hypothesis
- Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
- Correlation attacks on combination generators
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- On some connections between statistics and cryptology
- On probability of success in linear and differential cryptanalysis
- Another look at normal approximations in cryptanalysis
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- scientific article; zbMATH DE number 6117324 (Why is no real title available?)
- Capability of evolutionary cryptosystems against differential cryptanalysis
- Evolutionary cryptography against multidimensional linear cryptanalysis
- New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
- scientific article; zbMATH DE number 2009946 (Why is no real title available?)
- An estimate for the mean error probability of a Bayesian criterion for testing hypotheses in the problem of cryptanalysis of a combined gamma generator with nonuniform noise
- Linear Cryptanalysis of Non Binary Ciphers
- Another look at key randomisation hypotheses
This page was built for publication: Optimal key ranking procedures in a statistical cryptanalysis.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902490)
