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:20221201T110000
DTEND;TZID=Europe/Paris:20221201T120000
DTSTAMP:20260519T054739
CREATED:20221128T092841Z
LAST-MODIFIED:20221128T092841Z
UID:11079-1669892400-1669896000@lmv.math.cnrs.fr
SUMMARY:CRYPTO : Kévin Carrier (CY Cergy-Paris Université) : Faster Dual Lattice Attacks by Using Coding Theory
DESCRIPTION:We present a faster dual lattice attack on the Learning with\nErrors (LWE) problem\, based on ideas from coding theory. Basically\, it\nconsists in revisiting the most classical dual attack by replacing\nmodulus switching by a decoding algorithm. This replacement achieves a\nreduction from small LWE to plain LWE with a very significant reduction\nof the secret dimension. We also replace the enumeration part of this\nattack by betting that the secret is zero on the part where we want to\nenumerate it and iterate this bet over other choices of the enumeration\npart.We estimate the complexity of this attack by making the optimistic\,\nbut realistic guess that we can use polar codes for this decoding task. We\nshow that under this assumption the best attacks on Kyber and Saber\ncan be improved by 1 and 6 bits.
URL:https://lmv.math.cnrs.fr/evenenement/crypto-kevin-carrier-cy-cergy-paris-universite-faster-dual-lattice-attacks-by-using-coding-theory/
LOCATION:Bâtiment Fermat\, salle 4205
CATEGORIES:Séminaire CRYPTO
END:VEVENT
END:VCALENDAR