Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

11/29/2019 ∙ by Julian Renner, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.