Improving the Time Complexity of Matsui’s Linear Cryptanalysis

DOI10.1007/978-3-540-76788-6_7zbMath1337.94027DBLPconf/icisc/CollardSQ07OpenAlexW1701060964WikidataQ58765320 ScholiaQ58765320MaRDI QIDQ5385518

Baudoin Collard, Jean-Jacques Quisquater, François-Xavier Standaert

Publication date: 6 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76788-6_7

zbMATH Keywords

block cipherslinear cryptanalysisFast Fourier Transform

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (18)

Walsh transforms and cryptographic applications in bias computing ⋮ Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method ⋮ New attacks from old distinguishers improved attacks on serpent ⋮ How Much Can Complexity of Linear Cryptanalysis Be Reduced? ⋮ Automatic Key Recovery of Feistel Ciphers: Application to SIMON and SIMECK ⋮ Zero-correlation linear cryptanalysis of reduced-round LBlock ⋮ Clustering effect in \textsc{Simon} and \textsc{Simeck} ⋮ Generic framework for key-guessing improvements ⋮ Optimising linear key recovery attacks with affine Walsh transform pruning ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent ⋮ Lombardi Drawings of Knots and Links ⋮ Improved differential-linear attacks with applications to ARX ciphers ⋮ A Statistical Saturation Attack against the Block Cipher PRESENT ⋮ Improving key-recovery in linear attacks: application to 28-round PRESENT ⋮ The Cryptanalysis of Reduced-Round SMS4 ⋮ Unnamed Item ⋮ Improved differential-linear attacks with applications to ARX ciphers

This page was built for publication: Improving the Time Complexity of Matsui’s Linear Cryptanalysis