New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem

Abstract : We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes. It leads to a feasible attack on one of the parameters suggested in [11].
Type de document :
Communication dans un congrès
IEEE International Symposium on Information Theory - ISIT 2015, Jun 2015, Hong Kong, China. pp.2747-2751, 2015, 〈10.1109/ISIT.2015.7282956〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01244619
Contributeur : Jean-Pierre Tillich <>
Soumis le : mercredi 16 décembre 2015 - 08:59:12
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

Identifiants

Collections

Citation

Adrien Hauteville, Jean-Pierre Tillich. New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem. IEEE International Symposium on Information Theory - ISIT 2015, Jun 2015, Hong Kong, China. pp.2747-2751, 2015, 〈10.1109/ISIT.2015.7282956〉. 〈hal-01244619〉

Partager

Métriques

Consultations de la notice

277