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
Column scrambler for the GPT cryptosystem
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
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
Rank q-cyclic and pseudo-q-cyclic codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On improving security of GPT cryptosystems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
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. Several attacks against this system were published, including Gibson's attacks and recent Overbeck's attacks. In this paper, we improve the GPT system by more careful choice of parameters to withstand these attacks.