Designs, Codes and Cryptography

, Volume 6, Issue 1, pp 37–45

Severely denting the Gabidulin version of the McEliece Public Key Cryptosystem

  • J. K. Gibson

DOI: 10.1007/BF01390769

Cite this article as:
Gibson, J.K. Des Codes Crypt (1995) 6: 37. doi:10.1007/BF01390769


Gabidulin has proposed a version of the McEliece Public Key Cryptosystem using what he calls maximum rank distance (MRD) codes in place of Goppa codes. It is shown how to break such a system by finding a trapdoor to it. For the size of code he suggests this can be done in about a week on a fast personal computer. The attack can be thwarted by increasing the size of the code, but the advantages claimed for the Gabidulin version over the McEliece version are then largely lost.

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • J. K. Gibson
    • 1
  1. 1.Department of Computer ScienceBirkbeck CollegeLondonEngland