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].
Complete list of metadatas

https://hal.inria.fr/hal-01244619
Contributor : Jean-Pierre Tillich <>
Submitted on : Wednesday, December 16, 2015 - 8:59:12 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM

Identifiers

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, ⟨10.1109/ISIT.2015.7282956⟩. ⟨hal-01244619⟩

Share

Metrics

Record views

334