Improving the Algorithm 2 in multidimensional linear cryptanalysis
From MaRDI portal
Recommendations
- Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Multidimensional Extension of Matsui’s Algorithm 2
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
- Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Cited in
(16)- Improving key-recovery in linear attacks: application to 28-round PRESENT
- New attacks from old distinguishers improved attacks on serpent
- Differential-linear cryptanalysis revisited
- How Much Can Complexity of Linear Cryptanalysis Be Reduced?
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
- Multidimensional Extension of Matsui’s Algorithm 2
- The new concept of path contributing to the cryptographic strength exceeding 2N
- Lombardi drawings of knots and links
- Automatic key recovery of Feistel ciphers: application to SIMON and SIMECK
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Utilizing FWT in linear cryptanalysis of block ciphers with various structures
- Partial sums meet FFT: improved attack on 6-round AES
- Improving linear key recovery attacks using Walsh spectrum puncturing
- Enhancing the DATF technique in differential-linear cryptanalysis
- Differential-linear attacks from new distinguishers. The case of serpent and present
- Improving linear key recovery attacks using Walsh spectrum puncturing
This page was built for publication: Improving the Algorithm 2 in multidimensional linear cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012976)