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
Reaction Attacks against several Public-Key Cryptosystems
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cryptoanalysis of the Original McEliece Cryptosystem
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications 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
A New Identification Algorithm
Proceedings of the International Conference on Cryptography: Policy and Algorithms
Efficient Generation of Binary Words of Given Weight
Proceedings of the 5th IMA Conference on Cryptography and Coding
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
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
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
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
Reducible rank codes and their applications to cryptography
IEEE Transactions on Information Theory
A new public-key cryptosystem based on the problem of reconstructing p-polynomials
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Algebraic cryptanalysis of mceliece variants with compact keys
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
| Hi-index | 0.00 |
In this paper we modify the cryptosystem presented in [16] based on the problem of decoding in rank metric. We design a cryptosystem more secure than the original one with a better transmission rate. We show that this system resists to the message resend and reaction attacks, and can be used with a small public-key (around 10kbits).