New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
- Cite this article as:
- Ourivski, A.V. & Johansson, T. Problems of Information Transmission (2002) 38: 237. doi:10.1023/A:1020369320078
- 123 Downloads
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.