Extending Gibson’s Attacks on the GPT Cryptosystem

  • Raphael Overbeck
Conference paper

DOI: 10.1007/11779360_15

Volume 3969 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Overbeck R. (2006) Extending Gibson’s Attacks on the GPT Cryptosystem. In: Ytrehus Ø. (eds) Coding and Cryptography. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg

Abstract

In this paper we look at the Gabidulin version of the McEliece cryptosystem (GPT). In order to avoid Gibson’s attacks on GPT, several variants have been proposed. We cryptanalyze the variant with column scrambler and the one using reducible rank codes. Employing Gibson’s attacks as a black box, we get an efficient attack for the parameter sets proposed for GPT with column scrambler. As a countermeasure to our attack, we propose a new variant of the GPT cryptosystem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

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