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