BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250505T140000
DTEND;TZID=Europe/Paris:20250505T150000
DTSTAMP:20260421T102940
CREATED:20250429T093848Z
LAST-MODIFIED:20250429T093848Z
UID:11851-1746453600-1746457200@www.greyc.fr
SUMMARY:​Victor Mollimard - Partial Sums Meet FFT: Improved Attack on 6-roued AES
DESCRIPTION: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 the Fast Fourier Transform (FFT)\, leading to an attack with a comparable complexity. In this paper we show that the partial sums technique can be combined with an FFT-based technique\, to get the best of the two worlds. Using our combined technique\, we obtain an attack on 6-round AES with complexity of about $2^{46.4}$ additions. We fully implemented the attack experimentally\, along with the partial sums attack and the Todo-Aoki attack\, and confirmed that our attack improves the best known attack on 6-round AES by a factor of more than 32. We expect that our technique can be used to significantly enhance numerous attacks that exploit the partial sums technique. To demonstrate this\, we use our technique to improve the best known attack on 7-round Kuznyechik by a factor of more than 80\, and to reduce the complexity of the best known attack on the full MISTY1 from $2^{69.5}$ to $2^{67}$.
URL:https://www.greyc.fr/event/%e2%80%8bvictor-mollimard-partial-sums-meet-fft-improved-attack-on-6-roued-aes/
LOCATION:Sciences 3- S3 351
CATEGORIES:General,News,Safe,Séminaire Cryptologie et sécurité
END:VEVENT
END:VCALENDAR