New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem
Cryptography and Security
2015-04-22 v1 Information Theory
math.IT
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 \cite{GMRZ13}.
Cite
@article{arxiv.1504.05431,
title = {New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem},
author = {Adrien Hauteville and Jean-Pierre Tillich},
journal= {arXiv preprint arXiv:1504.05431},
year = {2015}
}
Comments
A shortened version of this paper will be published in the proceedings of the IEEE International Symposium on Information Theory 2015 (ISIT 2015)