Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
From MaRDI portal
Publication:3012976
DOI10.1007/978-3-642-22497-3_5zbMath1279.94108OpenAlexW2133177393WikidataQ56017320 ScholiaQ56017320MaRDI QIDQ3012976
Hongjun Wu, Phuong Ha Nguyen, Huaxiong Wang
Publication date: 7 July 2011
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22497-3_5
fast Fourier transformlinear cryptanalysismultidimensional linear cryptanalysisSerpentfast Walsh-Hadamard transform
Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (7)
Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method ⋮ New attacks from old distinguishers improved attacks on serpent ⋮ Differential-linear cryptanalysis revisited ⋮ How Much Can Complexity of Linear Cryptanalysis Be Reduced? ⋮ Automatic Key Recovery of Feistel Ciphers: Application to SIMON and SIMECK ⋮ Lombardi Drawings of Knots and Links ⋮ Improving key-recovery in linear attacks: application to 28-round PRESENT
This page was built for publication: Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
