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
Strengthening McEliece Cryptosystem
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes
Journal of Cryptology
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Compact McEliece Keys from Goppa Codes
Selected Areas in 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
A welch–berlekamp like algorithm for decoding gabidulin codes
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
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
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Isometries for rank distance and permutation group of Gabidulin codes
IEEE Transactions on Information Theory
On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC
IEEE Transactions on Information Theory
Reducible rank codes and their applications to cryptography
IEEE Transactions on Information Theory
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper we describe the rank metric based McEliece type cryptosystems which where first introduced by Gabidulin, Paramonov and Tretjakov in the 90's. Then we explain the principle of Overbeck's attack is so efficient on these types of systems. Finally we show how to choose the parameters so that the public-key size remain relatively small (typically less than 20 000 bits), with a good security against structural and decoding attacks.