Severely denting the Gabidulin version of the McEliece public key cryptosystem
Designs, Codes and Cryptography
A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes
Proceedings of the First French-Soviet Workshop on Algebraic Coding
Security preserving amplification of hardness
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A symmetric version of the McEliece public-key cryptosystem
International Journal of Network Management
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
Problems of Information Transmission
Column scrambler for the GPT cryptosystem
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
How to Mask the Structure of Codes for a Cryptographic Use
Designs, Codes and Cryptography
Attacks and counter-attacks on the GPT public key cryptosystem
Designs, Codes and Cryptography
On improving security of GPT cryptosystems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Extending gibson's attacks on the GPT cryptosystem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A new structural attack for GPT and variants
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Designing an efficient and secure public-key cryptosystem based on reducible rank codes
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Cryptanalysis of the niederreiter public key scheme based on GRS subcodes
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
The Gabidulin Public Key Cryptosystem (PKC), like the well known McEliece PKC, is based on error correcting codes, and was introduced as an alternative to the McEliece system with the claim that much smaller codes could be used, resulting in a more practical system. In this paper an attack on the Gabidulin PKC is given which breaks it for codes of the size envisaged, destroying much of its advantage over the McEliece system. The attack succeeds in polynomial time for Gabidulin's choice of one of his system parameters, but it does show how to choose this parameter more appropriately. It consists of a reduction of the decryption problem for the Gabidulin PKC to consideration of a search problem that is easier to describe, and which with luck should be easier to analyse. It therefore provides a possible starting point for a proof that decryption for the Gabidulin PKC is an NP-complete problem.