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
Introduction to Coding Theory
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
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
Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes
Journal of Cryptology
The security of the Gabidulin public key cryptosystem
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Random codes: minimum distances and error exponents
IEEE Transactions on Information Theory
Limit distribution of the minimum distance of random linear codes
IEEE Transactions on Information Theory
Coding protection for magnetic tapes: A generalization of the Patel - Hong code (Corresp.)
IEEE Transactions on Information Theory
Maximum-rank array codes and their application to crisscross error correction
IEEE Transactions on Information Theory
Reducible rank codes and their applications to cryptography
IEEE Transactions on Information Theory
A unified construction of space-time codes with optimal rate-diversity tradeoff
IEEE Transactions on Information Theory
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
Packing and Covering Properties of Rank Metric Codes
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we recall some basic facts about the rank metric. We derive an asymptotic equivalent of the minimum rank distance of codes that reach the rank metric Gilbert---Varshamov bound. We show that the random codes reach GV-bound. Finally, we show that the optimal codes in rank metric have a packing density which is bounded by functions depending only on the base field and on the minimum distance. We show the potential interest in cryptographic applications.