Severely denting the Gabidulin version of the McEliece public key cryptosystem
Designs, Codes and Cryptography
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
A New Identification Algorithm
Proceedings of the International Conference on Cryptography: Policy and Algorithms
The security of the Gabidulin public key cryptosystem
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On improving security of GPT cryptosystems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Journal of Symbolic Computation
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 public-key cryptosystem based on the problem of reconstructing p-polynomials
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
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Full cryptanalysis of the chen identification protocol
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Information security in a random network coding network
Problems of Information Transmission
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We present two new algorithms for decoding an arbitrary (n, k) linear rank distance code over GF(qN). These algorithms correct errors of rank r in O((Nr)3q(r−1)(k+1)) and O((k + r)3r3q(r−1)(N−r)) operations in GF(q) respectively. The algorithms give one of the most efficient attacks on public-key cryptosystems based on rank codes, as well as on the authentication scheme suggested by Chen.