Description
The partial-sums technique introduced by Ferguson et al. (2000) achieved a 6‑round AES attack with time complexity 2^{52} S‑box evaluations, a benchmark that has stood since. In 2014, Todo and Aoki proposed a comparable approach based on the Fast Fourier Transform (FFT).
In this talk, I will show how to combine partial sums with FFT to get "the best of both worlds". The resulting attack on 6‑round AES has a complexity of about 2^{46.4} additions, and I will outline how to implement it efficiently. A proof-of-concept implementation achieves a speedup of more than 32x over the previous best result, setting a new practical record for 6‑round AES after nearly 25 years.
Practical infos
Next sessions
-
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-