Partial sums meet FFT: improved attack on 6-round AES
From MaRDI portal
Publication:6636387
DOI10.1007/978-3-031-58716-0_5MaRDI QIDQ6636387FDOQ6636387
Shibam Ghosh, Nathan Keller, Avichai Marmor, Orr Dunkelman, Victor Mollimard, Gaëtan Leurent
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- New block encryption algorithm MISTY
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
- Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
- The block cipher Square
- Advanced Encryption Standard – AES
- Improved key recovery attacks on reduced-round AES with practical data and memory complexities
- Meet-in-the-Middle Technique for Integral Attacks against Feistel Ciphers
- The retracing boomerang attack
- Cryptanalysis of SP Networks with Partial Non-Linear Layers
- FFT Key Recovery for Integral Attack
- Improved differential-linear attacks with applications to ARX ciphers
- Integral characteristics by keyspace partitioning
- TNT: how to tweak a block cipher
- Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128
- A $$2^{70}$$ Attack on the Full MISTY1
- Truncated boomerang attacks and application to AES-based ciphers
This page was built for publication: Partial sums meet FFT: improved attack on 6-round AES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636387)
