Accurate estimates of the data complexity and success probability for various cryptanalyses
This paper deals with statistical attacks against ciphers when the attacker has a number of binary samples of plaintext/ciphertext pairs and attempts to obtain some information on the key. It contains: {\parindent=6mm\begin{itemize}\item[{\(\bullet\)}] a general framework to estimate the number of samples that are required to perform a statistical cryptanalysis; \item[{\(\bullet\)}] an algorithm that computes the number of samples which are required for achieving some given error probabilities; \item[{\(\bullet\)}] an explicit formula that gives a good estimate of the number of required samples; \item[{\(\bullet\)}] a formula for the success probability which generalizes the result obtained by \textit{A. A. Selçuk} [J. Cryptology 21, No. 1, 131--147 (2008; Zbl 1147.68510)]. \end{itemize}} The considerations are based on the binomial distribution and asymptotic expansions of the beta distribution.
- On probability of success in linear and differential cryptanalysis
- scientific article; zbMATH DE number 1952897
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- Another look at success probability of linear cryptanalysis
- scientific article; zbMATH DE number 7301765
- Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison
- Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
- Estimating the probabilities of low-weight differential and linear approximations on PRESENT-like ciphers
- scientific article; zbMATH DE number 2000415
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Decorrelation: a theory for block cipher security
- Differential cryptanalysis of DES-like cryptosystems
- How Far Can We Go Beyond Linear Cryptanalysis?
- scientific article; zbMATH DE number 176548 (Why is no real title available?)
- scientific article; zbMATH DE number 708826 (Why is no real title available?)
- scientific article; zbMATH DE number 2009946 (Why is no real title available?)
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- scientific article; zbMATH DE number 1759317 (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?)
- scientific article; zbMATH DE number 1406763 (Why is no real title available?)
- Markov Ciphers and Differential Cryptanalysis
- On probability of success in linear and differential cryptanalysis
- Optimal key ranking procedures in a statistical cryptanalysis.
- The Complexity of Distinguishing Distributions (Invited Talk)
- Tutorial on large deviations for the binomial distribution
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
- A correlation attack on full SNOW-V and SNOW-Vi
- Revisiting the wrong-key-randomization hypothesis
- On some connections between statistics and cryptology
- Reflection cryptanalysis of PRINCE-like ciphers
- Another look at normal approximations in cryptanalysis
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Reflection Cryptanalysis of PRINCE-Like Ciphers
- Multiple differential cryptanalysis: theory and practice
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Distinguishing attacks on block ciphers by differentials of two-block texts
- Optimal key ranking procedures in a statistical cryptanalysis.
- Differential cryptanalysis of round-reduced \texttt{SPEEDY} family
- Distinguisher and related-key attack on HALFLOOP-96
- Improved attacks on \texttt{GIFT-64}
- Guessing less and better: improved attacks on GIFT-64
- Improved improbable differential attacks on ISO standard CLEFIA: expansion technique revisited
This page was built for publication: Accurate estimates of the data complexity and success probability for various cryptanalyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430686)
