Problems of Information Transmission

, Volume 38, Issue 3, pp 237–246

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

  • A. V. Ourivski
  • T. Johansson

Abstract

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)(Nr)) 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© MAIK “Nauka/Interperiodica” 2002

Authors and Affiliations

  • A. V. Ourivski
  • T. Johansson

There are no affiliations available

Personalised recommendations