Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Information Theory
2020-02-11 v3 Cryptography and Security
math.IT
Abstract
We address the problem of decoding Gabidulin codes beyond their unique error-correction 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 column 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.
Keywords
Cite
@article{arxiv.1911.13193,
title = {Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius},
author = {Julian Renner and Thomas Jerkovits and Hannes Bartz and Sven Puchinger and Pierre Loidreau and Antonia Wachter-Zeh},
journal= {arXiv preprint arXiv:1911.13193},
year = {2020}
}