{"id":495,"date":"2014-06-05T17:24:07","date_gmt":"2014-06-05T15:24:07","guid":{"rendered":"https:\/\/samovar2022.int-evry.fr\/index.php\/2014\/06\/05\/post-quantum-cryptography-and-new-results-for-rank-based-cryptography\/"},"modified":"2020-09-04T18:46:56","modified_gmt":"2020-09-04T16:46:56","slug":"post-quantum-cryptography-and-new-results-for-rank-based-cryptography","status":"publish","type":"post","link":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/2014\/06\/05\/post-quantum-cryptography-and-new-results-for-rank-based-cryptography\/","title":{"rendered":"Post-quantum cryptography and new results for rank-based cryptography"},"content":{"rendered":"

Post-quantum cryptography and new results for rank-based cryptography
\n<\/strong><\/p>\n

Pr\u00e9sent\u00e9 par Philippe Gaborit<\/strong> , Universit\u00e9 de Limoges<\/p>\n

6 juin<\/strong> 2014 \u00e0 10h<\/strong>00 salle E206<\/strong> \u00e0 TELECOM Sudparis \u00e0 Evry<\/strong> (91)<\/p>\n

In a first part of this talk we will introduce the notion of
\npost-quantum cryptography which aims at finding alternative cryptographic
\nalgorithms to classical algorithms like RSA, EL Gamal, Elliptic curves,
\nin case a quantum computer with sufficiently many qbits would exist.
\nIn a second time we will focus
\non rank-based cryptography, which was introduced in 1991
\nwith the GPT cryptosystem which adapts the McEliece scheme
\nwith Gabidulin codes. The interest of such a scheme is that
\nthe complexity of best known attacks to decode random rank codes,
\npermits to obtain small size of public keys of a few thousand bits,
\nwhich is very small compared to the classical McEliece scheme.
\nMeanwhile after its introduction the GPT scheme was attacked and repaired
\nseveral times, essentially because of the strong structure of Gabidulin
\ncodes.<\/p>\n

In this talk we present recent results which give a new light on
\nthe potentiality of rank-based cryptography:<\/p>\n