Optimising linear key recovery attacks with affine Walsh transform pruning
From MaRDI portal
Publication:6175986
DOI10.1007/978-3-031-22972-5_16zbMATH Open1519.94119MaRDI QIDQ6175986FDOQ6175986
Authors: Antonio Flórez-Gutiérrez 
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Recommendations
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Affine linear cryptanalysis
- Linear distinguishers in the key-less setting: application to PRESENT
- Automatic key recovery of Feistel ciphers: application to SIMON and SIMECK
- How Much Can Complexity of Linear Cryptanalysis Be Reduced?
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- PRESENT: An Ultra-Lightweight Block Cipher
- Title not available (Why is that?)
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- On probability of success in linear and differential cryptanalysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Linear cryptanalysis of reduced-round PRESENT
- Differential-linear cryptanalysis of Serpent.
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Multidimensional linear cryptanalysis
- Efficient computation of the DFT with only a subset of input or output points
- A novel generic fast Fourier transform pruning technique and complexity analysis
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Boolean functions for cryptography and coding theory
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Linear cryptanalysis of DES with asymmetries
- Generic framework for key-guessing improvements
Cited In (6)
- Quantum linear key-recovery attacks using the QFT
- Utilizing FWT in linear cryptanalysis of block ciphers with various structures
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- A generic algorithm for efficient key recovery in differential attacks -- and its associated tool
- Improving linear key recovery attacks using Walsh spectrum puncturing
- Linear cryptanalysis and its variants with fast Fourier transformation technique on MPC/FHE/ZK-friendly \(\mathbb{F}_p\)-based ciphers
This page was built for publication: Optimising linear key recovery attacks with affine Walsh transform pruning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175986)
