BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Laboratoire de Mathématiques de Versailles - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Laboratoire de Mathématiques de Versailles
X-ORIGINAL-URL:https://lmv.math.cnrs.fr
X-WR-CALDESC:Évènements pour Laboratoire de Mathématiques de Versailles
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20221124T110000
DTEND;TZID=Europe/Paris:20221124T120000
DTSTAMP:20260518T165536
CREATED:20221116T081232Z
LAST-MODIFIED:20230509T133324Z
UID:11066-1669287600-1669291200@lmv.math.cnrs.fr
SUMMARY:CRYPTO : Augustin Bariant (INRIA) : Algebraic Attacks against Some Arithmetization-Oriented Symmetric Cryptographic Algorithms
DESCRIPTION:In some recent advanced protocols\, like Zero-Knowledge Proofs (allowing a prover to convince a verifier that he knows a secret without revealing it)\, or Multi Party Computation\, algorithms do not process bit-oriented information\, but rather elements of big finite fields Z/qZ. In that regard\, the only operations allowed in such algorithms are additions and multiplications in the field. These protocols therefore require cryptographic algorithms that are not optimized for usual bit-oriented platforms (desktop computers\, servers\, microcontrollers\, RFID tags…)\, but rather for their short implementation in Z/qZ. These are called arithmetization-oriented cryptographic algorithms. \nSince 2016\, several arithmetization-oriented algorithms have been presented. Their security highly depends on the complexity of polynomial root-finding and Groebner basis algorithms\, which define a special class of attacks: algebraic attacks. In 2021\, the Ethereum Foundation launched a series of challenges on this new class of ciphers\, aiming at better understanding the threat of algebraic attacks. We took that opportunity to perform a thorough study of univariate and multivariate polynomial solving algorithms in big fields. \nIn this talk\, we present an overview of existing algebraic attacks and analysis\, along with new theoretical and experimental results on several ciphers.
URL:https://lmv.math.cnrs.fr/evenenement/crypto-augustin-bariant-inria-algebraic-attacks-against-some-arithmetization-oriented-symmetric-cryptographic-algorithms/
LOCATION:Bâtiment Fermat\, salle 4205
CATEGORIES:Séminaire CRYPTO
END:VEVENT
END:VCALENDAR