Optimising linear key recovery attacks with affine Walsh transform pruning
From MaRDI portal
Publication:6175986
DOI10.1007/978-3-031-22972-5_16zbMath1519.94119MaRDI QIDQ6175986
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Multidimensional linear cryptanalysis
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Linear cryptanalysis of DES with asymmetries
- On probability of success in linear and differential cryptanalysis
- PRESENT: An Ultra-Lightweight Block Cipher
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Efficient computation of the DFT with only a subset of input or output points
- Linear Cryptanalysis of Reduced-Round PRESENT
- Boolean Functions for Cryptography and Coding Theory
- Advances in Cryptology – CRYPTO 2004
- An Algorithm for the Machine Calculation of Complex Fourier Series
- A novel generic fast Fourier transform pruning technique and complexity analysis
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Fast Software Encryption
- Generic framework for key-guessing improvements
This page was built for publication: Optimising linear key recovery attacks with affine Walsh transform pruning
