A New Structural Attack for GPT and Variants

  • Raphael Overbeck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3715)

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.

Keywords

public key cryptography code based cryptography rank distance codes Gabidulin codes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Raphael Overbeck
    • 1
  1. 1.Department of Computer Science, Cryptography and Computer Algebra GroupGK Electronic Commerce, TU-Darmstadt 

Personalised recommendations