Improving the Time Complexity of Matsui’s Linear Cryptanalysis

DOI10.1007/978-3-540-76788-6_7MaRDI QIDQ5385518zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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 ciphersFast Fourier Transformlinear cryptanalysis

Mathematics Subject Classification ID

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

Recommendations

• Improving the Algorithm 2 in multidimensional linear cryptanalysis
• How Much Can Complexity of Linear Cryptanalysis Be Reduced?
• scientific article; zbMATH DE number 2085206
• Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
• On linear cryptanalysis with many linear approximations

Cited in

(31)

• Improving key-recovery in linear attacks: application to 28-round PRESENT
• New attacks from old distinguishers improved attacks on serpent
• Walsh transforms and cryptographic applications in bias computing
• How Much Can Complexity of Linear Cryptanalysis Be Reduced?
• Improving the Algorithm 2 in multidimensional linear cryptanalysis
• Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
• Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
• A Statistical Saturation Attack against the Block Cipher PRESENT
• The Cryptanalysis of Reduced-Round SMS4
• Zero-correlation linear cryptanalysis of reduced-round LBlock
• Lombardi drawings of knots and links
• Improving linear cryptanalysis of LOKI91 by probabilistic counting method
• Automatic key recovery of Feistel ciphers: application to SIMON and SIMECK
• scientific article; zbMATH DE number 7310237 (Why is no real title available?)
• Improved differential-linear attacks with applications to ARX ciphers
• Improved differential-linear attacks with applications to ARX ciphers
• 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
• Linear cryptanalysis and its variants with fast Fourier transformation technique on MPC/FHE/ZK-friendly \(\mathbb{F}_p\)-based ciphers
• Quantum speed-up for multidimensional (zero correlation) linear distinguishers
• 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
• Differential-linear attacks from new distinguishers. The case of serpent and present
• Differential-linear cryptanalysis from an algebraic perspective
• Improved cryptanalysis of ChaCha: beating PNBs with bit puncturing
• Improving linear key recovery attacks using Walsh spectrum puncturing
• Quantum algorithms for fast correlation attacks on LFSR-based stream ciphers
• Improved differential and linear cryptanalysis on round-reduced \texttt{SIMON}

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385518)