Reducible Rank Codes and Applications to Cryptography

  • Ernst M. Gabidulin
  • Alexei Ourivski
  • Bassem Ammar
  • Bahram Honary
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 687)


A new family of so called reducible rank codes, which are a generalization of rank product codes [8], is introduced. A McEliece type [1] public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler ‘mixes’ columns of a generator matrix of a code. It makes the system more resistant to structural attacks such as Gibson’s attacks [5, 6]. Possible attacks are studied. The possibility of using the system for combined error protection is investigated. The system is found to be secure against known attacks for public keys of about 10 kbits


Generator Matrix Information Rate Weight Enumerator Direct Attack Rank Distance 
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]
    R. J. McEliece, “A Public Key Cryptosystem Based on Algebraic Coding Theory,” JPL DSN Progress Rep. 42–44 Google Scholar
  2. [2]
    E. M. Gabidulin, “Theory of Codes with Maximum Rank distance,” Probi. Inform. Transm., vol. 21 (1), pp. 1–12, July 1985.MathSciNetzbMATHGoogle Scholar
  3. [3]
    E. M. Gabidulin, A.V. Paramonov, O.V. Tretjakov, “Ideals over a non-commutative ring and their application in cryptology,” advances in Cryptology, Proc. EUROCRYPT’ 91, LNCS 547, D. W. Davies, Ed. Springer-Verlag, 1991, pp. 482–489Google Scholar
  4. [4]
    E. M. Gabidulin, A. V. Ourivski, “Improved GPT public key cryptosystems,” Coding, Communications and Broadcasting, P. Farrell, M. Darnell, B. Honary, Eds., Research Studies Press, 2000, pp. 73–102.Google Scholar
  5. [5]
    J. K. Gibson, “Severely denting the Gabidulin version of McEliece public key cryptosystem,” Designs, Codes and Cryptography, vol. 6 (1), pp. 37–45, 1995MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    J. K. Gibson, “Algebraic coded cryptosystems, ” PhD. Thesis, University of London, Royal Holloway and Bedford New College, 1995.Google Scholar
  7. [7]
    F. Chabaud, J. Stern, “The cryptographic security of the syndrome decoding problem for rank distance codes,” Advances in Cryptology, Proc. ASL4CRYPT’96, LNCS, K. Kim, T. Matsumoto, Eds., Springer-Verlag, 1996, pp. 368–381.Google Scholar
  8. [8]
    E. M. Gabidulin, P. Loidreau, “Subfield subcodes of rank codes and applications,” Proc. 7-th Im. Workshop on Algebraic and Combinatorial Coding Theory ACCT’ 2000, June 2000.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Ernst M. Gabidulin
    • 1
  • Alexei Ourivski
    • 1
  • Bassem Ammar
    • 2
  • Bahram Honary
    • 2
  1. 1.Moscow Institute of Physics and TechnologyDolgoprudnyRussia
  2. 2.DCS Lancaster UniversityLancasterUK

Personalised recommendations