Problems of Information Transmission

, Volume 38, Issue 3, pp 237–246 | Cite as

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

  • A. V. Ourivski
  • T. Johansson


We present two new algorithms for decoding an arbitrary (n, k) linear rank distance code over GF(q N ). 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.


System Theory Authentication Scheme Linear Rank Rank Distance Decode Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barg, A., Complexity issues in coding theory, Handbook of coding theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, pp. 649–754.Google Scholar
  2. 2.
    Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V., Ideals over a Non-Commutative Ring and Their Application in Cryptology, Advances in Cryptology EUROCRYPT'91, Lect. Notes Comp. Sci., vol. 547, Berlin: Springer, 1991, pp. 482–489.Google Scholar
  3. 3.
    Gibson, J.K., Severely Denting the Gabidulin Version of the McEliece Public-Key Cryptosystem, Designs, Codes and Cryptography, 1995, vol. 6, no. 1, pp. 37–45.Google Scholar
  4. 4.
    Gibson, J.K., The Security of the Gabidulin Public-Key Cryptosystem, Advances in Cryptology EUROCRYPT'96, Lect. Notes Comp. Sci., vol. 1070, Berlin: Springer, 1996, pp. 212–223.Google Scholar
  5. 5.
    Gabidulin, E.M. and Ourivski, A.V., Improved GPT Public-Key Cryptosystems, Coding, Communications and Broadcasting, Honary, B., Darnell, M., and Farrel, P., Eds., London: Research Studies, 2000, pp. 73–102.Google Scholar
  6. 6.
    Gabidulin, E.M. and Ourivski, A.V., Modified GPT PKC with Right Scrambler, Proc. Int. Workshop on Coding and Cryptography WCC'01, Paris, 2001, pp. 233-242.Google Scholar
  7. 7.
    Chen, K., A New Identification Algorithm, Proc. Int. Conf. on Cryptography Policy and Algorithms, Lect. Notes Comp. Sci., vol. 1029, Berlin: Springer, 1996, pp. 244–249.Google Scholar
  8. 8.
    Chabaud, F. and Stern, J., The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes, Advances in Cryptology ASIACRYPT'96, Lect. Notes Comp. Sci., vol. 1163, Berlin: Springer, 1996, pp. 368–381.Google Scholar
  9. 9.
    Gabidulin, E.M., Theory of Codes with Maximal Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1-12].Google Scholar
  10. 10.
    Courtois, N., Klimov, A., Patarin, J., and Shamir, A., Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Advances in Cryptology EUROCRYPT'2000, Lect. Notes Comp. Sci., vol. 1807, Berlin: Springer, 2000, pp. 392–407.Google Scholar
  11. 11.
    Gabidulin, E., Ourivski, A., Honary, B., and Ammar, B., A New Family of Rank Codes and Applications to Cryptography, Proc. 2002 IEEE Int. Sympos. on Information Theory ISIT'02, Lausanne, 2002, p. 268.Google Scholar
  12. 12.
    Canteaut, A. and Sendrier, N., Cryptanalysis of the Original McEliece Cryptosystem, Advances in Cryptology ASIACRYPT'98, Lect. Notes Comp. Sci., vol. 1514, Berlin: Springer, 1998, pp. 187–199.Google Scholar
  13. 13.
    Courtois, N., Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank, Advances in Cryptology ASIACRYPT'2001, Lect. Notes Comp. Sci., vol. 2248, Berlin: Springer, 2001, pp. 402–421.Google Scholar

Copyright information

© MAIK “Nauka/Interperiodica” 2002

Authors and Affiliations

  • A. V. Ourivski
  • T. Johansson

There are no affiliations available

Personalised recommendations