Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Lists
Only you see this
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.
BibTeX
@inproceedings{renner2020randomized,
author = {Julian Renner and Thomas Jerkovits and Hannes Bartz and Sven Puchinger and Pierre Loidreau and Antonia Wachter-Zeh},
title = {{Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius}},
booktitle = {PQCrypto},
year = {2020},
doi = {10.1007/978-3-030-44223-1\_1},
}Loading related content...