Multidimensional Linear Cryptanalysis of Reduced Round Serpent
From MaRDI portal
Recommendations
Cited in
(35)- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Multidimensional linear cryptanalysis
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Linear cryptanalysis of FF3-1 and FEA
- Counting active S-boxes is not enough
- Revisiting the wrong-key-randomization hypothesis
- Filtered nonlinear cryptanalysis of reduced-round serpent, and the wrong-key randomization hypothesis
- Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
- Improving the Algorithm 2 in multidimensional linear cryptanalysis
- Linear Cryptanalysis of Reduced Round Serpent
- On linear hulls and trails
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
- Multidimensional linear method and diffusion characteristics of linear medium of ciphering transform
- Multidimensional Extension of Matsui’s Algorithm 2
- Capacity and data complexity in multidimensional linear attack
- Evolutionary cryptography against multidimensional linear cryptanalysis
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Linear cryptanalysis using multiple linear approximations
- A Differential-Linear Attack on 12-Round Serpent
- A geometric approach to linear cryptanalysis
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- Multidimensional linear distinguishing attacks and Boolean functions
- Multidimensional linear distinguishing attacks and Boolean functions
- Utilizing FWT in linear cryptanalysis of block ciphers with various structures
- Improving linear key recovery attacks using Walsh spectrum puncturing
- Speeding up preimage and key-recovery attacks with highly biased differential-linear approximations
- Vectorial fast correlation attacks
- Link between the differential cryptanalysis and linear approximations over finite abelian groups and its applications
- Differential-linear attacks from new distinguishers. The case of serpent and present
- Improving linear key recovery attacks using Walsh spectrum puncturing
- Zero-correlation linear cryptanalysis with equal treatment for plaintexts and tweakeys
This page was built for publication: Multidimensional Linear Cryptanalysis of Reduced Round Serpent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511163)