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:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210310T140000
DTEND;TZID=Europe/Paris:20210310T150000
DTSTAMP:20260527T215559
CREATED:20210303T171731Z
LAST-MODIFIED:20210303T171731Z
UID:10273-1615384800-1615388400@www.greyc.fr
SUMMARY:Matthieu Lequesne - Recovering short secret keys of RLCE in polynomial time
DESCRIPTION:The security of most modern public key encryption algorithms (such as RSA) relies on arithmetic problems. Today\, the hardness of these problems is threatened by the potential emergence of large quantum computers. For this reason\, cryptographers try to come up with new cryptographic schemes relying on families of problems which remain hard to solve even with a quantum computer. One possible solution is to use the hardness of decoding a random error-correcting code. This field is known as code-based cryptography. This idea was introduced by McEliece in 1978 and his proposal is still considered secure today. However\, McEliece’s scheme needs large public keys (about 1MB for 256 security bits)\, which makes it unfit for most use-cases. Therefore\, there are several attempts to replace the Goppa codes\, used by McEliece\, with other families of codes\, to obtain shorter keys. In this work\, we analyze a proposal from Wang\, named Random Linear Code-based Encryption (RLCE)\, and conclude that for all the short key parameters proposed by the author\, we can recover the secret key in polynomial time\, by using the dimension of the square code as a distinguisher. This is a joint work with Alain Couvreur and Jean-Pierre Tillich. \n  \nhttps://webconference.unicaen.fr/b/mor-7jm-rcy
URL:https://www.greyc.fr/event/matthieu-lequesne-recovering-short-secret-keys-of-rlce-in-polynomial-time/
CATEGORIES:Séminaire Cryptologie et sécurité
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210331T140000
DTEND;TZID=Europe/Paris:20210331T150000
DTSTAMP:20260527T215559
CREATED:20210316T105620Z
LAST-MODIFIED:20210322T110621Z
UID:10291-1617199200-1617202800@www.greyc.fr
SUMMARY:Weiqiang Wen - On algorithms for solving Euclidean lattice problems in cryptography
DESCRIPTION:In this talk\, we will try to review the state-of-the-art of the algorithms for solving the Euclidean lattice problems underlying cryptography. In more details\, this talk contains two parts. In the first part\, we will focus on the lattice problems such as approximate Shortest Vector Problem (approx-SVP) and the lattice reduction algorithms as the best known solving algorithms so far. In particular\, I will present an improved enumeration-based lattice reduction algorithm\, which is shown to be (potentially) relevant to cryptanalysis. In the second part\, we will instead consider a quantum problem that is computationally equivalent to approx-SVP. By directly solving a quantum problem\, we may expect to have a more powerful use of the quantum computation. However\, the best known algorithms for solving approx-SVP via solving this quantum problem\, is not better than lattice reduction yet. \n  \n  \nhttps://webconference.unicaen.fr/b/mor-7jm-rcy
URL:https://www.greyc.fr/event/weiqiang-wen-on-algorithms-for-solving-euclidean-lattice-problems-in-cryptography/
CATEGORIES:Séminaire Cryptologie et sécurité
END:VEVENT
END:VCALENDAR