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:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240320T140000
DTEND;TZID=Europe/Paris:20240320T150000
DTSTAMP:20260525T060146
CREATED:20240201T141416Z
LAST-MODIFIED:20240201T141416Z
UID:11412-1710943200-1710946800@www.greyc.fr
SUMMARY:Andrea Lesavourey - Diagonally dominant matrices in cryptography
DESCRIPTION:Euclidean lattices are among the most promising objects for building a post-quantum cryptography\, i.e.  constructions that would resist the power of large scale quantum computers. For efficiency reasons\, most constructions use lattices enjoying a strong algebraic structure\, and can be interpreted as constructions over polynomials with rational coefficients. However\, it is still unknown to this date to what extent this additional structure can be used to attack those cryptosystems. Thus\, studying more generic lattices is still an important challenge for future cryptography.\nPlantard et al. (2016) submitted a scheme called DRS to the NIST process aiming at standardising post-quantum cryptography\, based on diagonally dominant matrices. However\, it suffered a different learning attack from Ducas and Yu (2017)\, lowering the security estimates by at least 30 bits.\n\nIn this talk\, I will first give some background on Euclidean lattices and their use in cryptography. Then I will describe GGH-like schemes  and statistical attacks known on these constructions. Finally I will present a recent joint work with T. Plantard and A. Sipasseuth submitted to PQCrypto 2024.  We study diagonally dominant matrices (as in the DRS scheme) and study their use in cryptography. We propose an encryption scheme based on new algorithmic results on this type of matrices and study potential patches to the attack of Ducas and Yu.
URL:https://www.greyc.fr/event/andrea-lesavourey-diagonally-dominant-matrices-in-cryptography/
LOCATION:Sciences 3- S3 351
CATEGORIES:Séminaire Cryptologie et sécurité
END:VEVENT
END:VCALENDAR