New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications

被引：69

作者：

A. V. Ourivski

T. Johansson

机构：

来源：

Problems of Information Transmission | 2002年 / 38卷 / 3期

关键词：

System Theory; Authentication Scheme; Linear Rank; Rank Distance; Decode Code;

D O I：

10.1023/A:1020369320078

中图分类号：

学科分类号：

摘要：

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.

引用

页码：237 / 246

页数：9