Partial Sums Meet FFT: Improved Attack on 6-Round AES

ePrint Report: Partial Sums Meet FFT: Improved Attack on 6-Round AES

Orr Dunkelman, Shibam Ghosh, Nathan Keller, Gaetan Leurent, Avichai Marmor, Victor Mollimard

The partial sums cryptanalytic technique was introduced in 2000 by Ferguson et al., who used it to break 6-round AES with time complexity of $2^{52}$ S-box computations -- a record that has not been beaten ever since. In 2014, Todo and Aoki showed that for 6-round AES, partial sums can be replaced by a technique based on …

aes attack box complexity eprint report partial report