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
The security of the Gabidulin public key cryptosystem
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Ideals over a non-commutative ring and their application in cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Reducible rank codes and their applications to cryptography
IEEE Transactions on Information Theory
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
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
An attack on a modified niederreiter encryption scheme
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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.