Paper 2005/085

A new structural attack for GPT and variants

R. Overbeck

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 on the private key, which is applicable to all variants proposed so far, breaking some of them completely.

Note: One of the assumptions we made in the previous version of this paper has turned out to be false. However, as is shown in the current version, it is not essential for the analysis. Thus the results remain unchanged.

Metadata
Available format(s)
-- withdrawn --
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
gabidulin codescode based cryptography
Contact author(s)
overbeck @ cdc informatik tu-darmstadt de
History
2005-07-18: withdrawn
2005-03-20: received
See all versions
Short URL
https://ia.cr/2005/085
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.