Twisted Gabidulin Codes in the GPT Cryptosystem
Information Theory
2018-08-15 v2 Cryptography and Security
math.IT
Abstract
In this paper, we investigate twisted Gabidulin codes in the GPT code-based public-key cryptosystem. We show that Overbeck's attack is not feasible for a subfamily of twisted Gabidulin codes. The resulting key sizes are significantly lower than in the original McEliece system and also slightly smaller than in Loidreau's unbroken GPT variant.
Cite
@article{arxiv.1806.10055,
title = {Twisted Gabidulin Codes in the GPT Cryptosystem},
author = {Sven Puchinger and Julian Renner and Antonia Wachter-Zeh},
journal= {arXiv preprint arXiv:1806.10055},
year = {2018}
}
Comments
5 pages, accepted at the International Workshop on Algebraic and Combinatorial Coding Theory, 2018