Severely denting the Gabidulin version of the McEliece public key cryptosystem
Designs, Codes and Cryptography
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
Problems of Information Transmission
A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes
Proceedings of the First French-Soviet Workshop on Algebraic Coding
Column scrambler for the GPT cryptosystem
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes
Journal of Cryptology
Attacks and counter-attacks on the GPT public key cryptosystem
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
A new structural attack for GPT and variants
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Reducible rank codes and their applications to cryptography
IEEE Transactions on Information Theory
Information security in a random network coding network
Problems of Information Transmission
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
The public key cryptosystem based on rank error correcting codes (the GPT cryptosystem) was proposed in 1991. Use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This enabled using public keys of a smaller size. Several attacks against this system were published, including Gibson's attacks and more recently Overbeck's attacks. A few modifications were proposed withstanding Gibson's attack but at least one of them was broken by the stronger attacks by Overbeck. A tool to prevent Overbeck's attack is presented in [12]. In this paper, we apply this approach to other variants of the GPT cryptosystem.