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:20251118T104500
DTEND;TZID=Europe/Paris:20251118T114500
DTSTAMP:20260419T010609
CREATED:20251017T094324Z
LAST-MODIFIED:20251017T094324Z
UID:11983-1763462700-1763466300@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Rachelle Heim (UC Louvain\, Belgique)\, « Generic attacks using random functions statistics »
DESCRIPTION:Cryptography relies on building blocks called primitives used within constructions to build more complex algorithms.  The security of a scheme (i.e. of a construction instantiated with a primitive) is most often proven under some assumptions on the underlying primitive. However\, security reductions only provide lower bounds on the security level.  Generic attacks\, i.e. attacks that do not rely on the existence of a primitive flaw\, provide complementary information (namely\, upper bounds on the security level). \nOver the past ten years\, the statistical properties of random functions have been a particularly fruitful tool to mount generic attacks. Initially\, these attacks targeted iterated hash constructions and their combiners\, developing a wide array of methods based on internal collisions and on the average behavior of iterated random functions. \nMore recently\, we (Gilbert et al.\, EUROCRYPT 2023) introduced a forgery attack on so-called duplex-based Authenticated Encryption modes which is based on exceptional random functions\, i.e.\, functions whose graph admits a large component with an exceptionally small cycle. We have since then improved this attack (Bonnetain et al.\, CRYPTO 2024) using so-called nested exceptional functions. This talk will present a variety of generic attacks based on functional graphs against hash functions\, hash-based MACs and AEAD modes.
URL:https://www.greyc.fr/event/seminaire-algorithmique-rachelle-heim-uc-louvain-belgique-generic-attacks-using-random-functions-statistics/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR