BEGIN:VCALENDAR
PRODID:-//Google Inc//Google Calendar 70.9054//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:44CON 2026
X-WR-TIMEZONE:Europe/London
BEGIN:VEVENT
DTSTART:20260917T155000Z
DTEND:20260917T164000Z
DTSTAMP:20260624T151157Z
UID:3nv92f0osis3bdl6b272q7kic8@google.com
CREATED:20260624T102643Z
DESCRIPTION:When assessing the cryptographic security of algorithms\, we
  tend to use the description provided by the author.\nHowever it is not t
 he only possible description and there as a few cases where the official de
 scription of an encryption algorithm was not the most suitable one and serv
 ed in reality to hide some weaknesses actually.\n\nBased on former expe
 rience and analyses\, this talk propose a new approach in cryptanalysis bas
 ed on an evolution of the concept of Combinatorial Equivalence. The aim is 
 to rewrite a cryptosystem under a combinatorially equivalent form in order 
 to make appear new properties that are more strongly discriminating the sec
 ret key used during encryption.\n\nWe successfully applied this approa
 ch to the most secure stream ciphers category nowadays but also on block ci
 phers.\nWe first define a concept cipher called Cipherbent6 that capture
  most of the difficulty of stream cipher cryptanalysis.\nWe significantl
 y outperformed all known cryptanalysis. We applied this approach to the Ach
 terbahn cipher and we obtained again far better cryptanalysis results. Fina
 lly when applying this approach to the most critical cryptographic primitiv
 es of block ciphers we have found such stronger biases that the original al
 gorithm description did not expose.
LAST-MODIFIED:20260624T150904Z
LOCATION:Track 1
SEQUENCE:1
STATUS:CONFIRMED
SUMMARY:A New Approach in Cryptanalysis Through Combinatorial Equivalence o
 f Cryptosystems – Eric Filiol\, Jaagup Sepp
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR