Professor, University of Limoges, France
2nd June 2022, 4:00pm - 5:00pm (GST)
Recent advances on rank based cryptography and the RSL problem
In this talk after recalling the main tools of the field, we will survey recent results for rank-based cryptography: cryptosystems which are based on error-correcting codes embedded with the rank metric. These new results mainly concern the LRPC and the RQC cryptosystems for which we propose a new approach which permits to decrease public key by 30%-50% and permits to obtain very efficient systems even in the case of proven 2^-128 Decryption Failure Rate. We also introduce augmented Gabidulin codes which permit a better decoding for the RQC cryptosystem. We will also quickly survey different type of signatures based on rank metric including the Durandal signature scheme and ZK based signatures. All previous improvements are mainly based on the use of the RSL (Rank Support Learning) problem that we will recall and discuss the new importance for the potential of rank metric.
Philippe Gaborit was born in Bordeaux, France, he got a Master Degree at the engineering school École des Mines de Saint-Etienne, France. He received a Ph.D. degree in Mathematics at Bordeaux University and the Habilitation à Diriger des Recherches in Mathematics at Limoges University. After a post-doc at University of Illinois at Chicago, he became Associate Professor at the Mathematics Department of Limoges University. Since 2008 he is Professor at the Computer Science Department of Limoges University. His research interests include Coding theory, Cryptography, Security and Number Theory. In recent years he has been working on code-based cryptography and rank-based cryptography.