Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
From MaRDI portal
Publication:329196
DOI10.1007/s10623-016-0175-xzbMath1396.94068OpenAlexW2254646939MaRDI QIDQ329196
Meiqin Wang, Tingting Cui, Huaifeng Chen
Publication date: 21 October 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0175-x
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The security of Feistel ciphers with six rounds or less
- Linear hulls with correlation zero and linear cryptanalysis of block ciphers
- Generic Key Recovery Attack on Feistel Scheme
- Meet-in-the-Middle Attacks on Generic Feistel Constructions
- General Application of FFT in Cryptanalysis and Improved Attack on CAST-256
- Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
- Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
- Multidimensional Extension of Matsui’s Algorithm 2
- All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach
- Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Zero Correlation Linear Cryptanalysis with Reduced Data Complexity
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited
- Improved Linear Cryptanalysis of Reduced-Round MIBS
- Upper Bounds for the Security of Several Feistel Networks
- Advances in Cryptology – CRYPTO 2004
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
This page was built for publication: Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
