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:20240326T100000
DTEND;TZID=Europe/Paris:20240326T110000
DTSTAMP:20260422T182715
CREATED:20240304T095805Z
LAST-MODIFIED:20240304T095805Z
UID:11448-1711447200-1711450800@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Hardness of the Decoding Problem and its Applications in Post-Quantum Cryptography »\, Maxime Bombar (CWI\, Amsterdam\, Pays-Pas)
DESCRIPTION:Nowadays\, most of our communications over the Internet are encrypted. However\, some cryptographic constructions widely deployed today are vulnerable to quantum attacks\, and the goal of post-quantum cryptography is to design classical cryptosystems based on computational problems which remain hard even with the help of quantum computers. \nIn this talk\, I will give an introduction to cryptography based on the hardness of decoding random linear codes\, which is\, together with lattice-based cryptography\, one of the most promising solutions for building post-quantum cryptosystems. I will more specifically focus on variants of this problem for codes endowed with an additional algebraic structure\, which allows for more efficient cryptographic constructions\, but whose theoretical security is less understood. Finally\, I will give an overview of some on-going work on applications to secure multiparty computation (MPC). The goal of MPC is to enable a group of users (for example several smartphones and a remote server)\, to evaluate together a function over their respective private data\, without revealing anything but the result. This is an old goal in cryptography\, and deep connections with (structured) variants of the decoding problem have recently been established.
URL:https://www.greyc.fr/event/seminaire-algorithmique-hardness-of-the-decoding-problem-and-its-applications-in-post-quantum-cryptography-maxime-bombar-cwi-amsterdam-pays-pas/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR