A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
From MaRDI portal
Publication:2757230
Recommendations
Cited in
(41)- On quadratic approximations in block ciphers
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- Linear Cryptanalysis of Non Binary Ciphers
- Correlation theorems in cryptanalysis
- Experimenting linear cryptanalysis
- Can a differential attack work for an arbitrarily large number of rounds?
- Linear cryptanalysis of reduced-round ICEBERG
- Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
- Upper estimates of imbalance of bilinear approximations for round functions of block ciphers
- A geometric approach to linear cryptanalysis
- Multidimensional linear cryptanalysis
- Ciphertext-only attack on Akelarre
- Pseudorandom Permutation Families over Abelian Groups
- scientific article; zbMATH DE number 4079313 (Why is no real title available?)
- On degree-\(d\) zero-sum sets of full rank
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
- scientific article; zbMATH DE number 1688998 (Why is no real title available?)
- Partitioning cryptanalysis
- scientific article; zbMATH DE number 1759318 (Why is no real title available?)
- scientific article; zbMATH DE number 1424170 (Why is no real title available?)
- Capacity and data complexity in multidimensional linear attack
- scientific article; zbMATH DE number 1759274 (Why is no real title available?)
- Information leakage of Feistel ciphers
- The piling-up approximation in linear cryptanalysis
- Revisiting the wrong-key-randomization hypothesis
- A Statistical Saturation Attack against the Block Cipher PRESENT
- On the linear and differential cryptanalysis of the AES-like ciphers
- Multiple differential cryptanalysis: theory and practice
- Provable security of block ciphers against linear cryptanalysis: a mission impossible?
- Strengthening differential and linear attacks using virtual isomorphisms
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- 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
- Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64
- Another look at normal approximations in cryptanalysis
- Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
- A theoretical analysis of generalized invariants of bijective S-boxes
- Distinguishing error of nonlinear invariant attacks
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Another look at key randomisation hypotheses
This page was built for publication: A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757230)
