Log In Sign Up

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

by   Julian Renner, et al.

We address the problem of decoding Gabidulin codes beyond their error-correcting radius. The complexity of this problem is of importance to assess the security of some rank-metric code-based cryptosystems. We propose an approach that introduces row or columns erasures to decrease the rank of the error in order to use any proper polynomial-time Gabidulin code error-erasure decoding algorithm. This approach improves on generic rank-metric decoders by an exponential factor.


page 1

page 2

page 3

page 4


Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This article discusses the decoding of Gabidulin codes and shows how to ...

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach

Decoding a Reed-Solomon code can be modeled by a bilinear system which c...

On interpolation-based decoding of a class of maximum rank distance codes

In this paper we present an interpolation-based decoding algorithm to de...

Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric

Recently, codes in the sum-rank metric attracted attention due to severa...

On the list decodability of rank-metric codes containing Gabidulin codes

Wachter-Zeh in [42], and later together with Raviv [31], proved that Gab...

Generic Decoding in the Cover Metric

In this paper, we study the hardness of decoding a random code endowed w...

Quantum Reduction of Finding Short Code Vectors to the Decoding Problem

We give a quantum reduction from finding short codewords in a random lin...