On the complexity of the Rank Syndrome Decoding problem

Philippe Gaborit, Olivier Ruatta, Julien Schrek

In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word…