Abstract
In this paper we look at the Gabidulin version of the McEliece cryptosystem (GPT) and its variants. We propose a new polynomial time attack, which recovers an alternative private key. Our attack is applicable to all variants proposed so far and breaks some of them completely. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
APA
Overbeck, R. (2005). A new structural attack for GPT and variants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3715 LNCS, pp. 50–63). https://doi.org/10.1007/11554868_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free