The Security of the Gabidulin Public Key Cryptosystem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1070)


The Gabidulin Public Key Cryptosystem (PKC), like the well known McEliece PKC, is based on error correcting codes, and was introduced as an alternative to the McEliece system with the claim that much smaller codes could be used, resulting in a more practical system. In this paper an attack on the Gabidulin PKC is given which breaks it for codes of the size envisaged, destroying much of its advantage over the McEliece system. The attack succeeds in polynomial time for Gabidulin’s choice of one of his system parameters, but it does show how to choose this parameter more appropriately. It consists of a reduction of the de- cryption problem for the Gabidulin PKC to consideration of a search problem that is easier to describe, and which with luck should be easier to analyse. It therefore provides a possible starting point for a proof that decryption for the Gabidulin PKC is an N P-complete problem.


  1. 1.
    BRASSARD, G. “A Note on the Complexity of Cryptography.” IEEE Transactions on Information Theory, Vol IT-25, no. 2, 1979.Google Scholar
  2. 2.
    BURDEN R.L., FAIRES J.D., and REYNOLDS A.C. “Numerical Analysis.” 2nd. Ed., Prindle, Weber, and Schmidt, 1981. Page 458.Google Scholar
  3. 3.
    GABIDULIN E.M. “Theory of Codes with Maximum Rank Distance.” Problems of Information Transmission, Vol 21 no. 1, 1985.Google Scholar
  4. 4.
    GABIDULIN E.M. “Ideals Over a Non-Commutative Ring and their Applications in Cryptography.” Lecture Notes in Computer Science Vol 547, Proc. Eurocrypt 91, Springer Verlag, 1991.Google Scholar
  5. 5.
    GABIDULIN E.M. “A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes.” Lecture Notes in Computer Science Vol 573, Algebraic Coding, Springer Verlag, 1992.Google Scholar
  6. 6.
    GABIDULIN E.M. “On Public-Key Cryptosystems Based on Linear Codes: Efficiency and Weakness.” Codes and Ciphers, Proc. 4th IMA Conference on Cryptography and Coding, 1993. IMA Press, 1995.Google Scholar
  7. 7.
    GIBSON J.K. “Severely Denting the Gabidulin Version of the McEliece Public Key Cryptosystem.” Designs, Codes, and Cryptography, Vol 6, 1995.Google Scholar
  8. 8.
    GIBSON J.K. “Algebraic Coded Cryptosystems”. PhD Thesis, Univ. of London, 1996.Google Scholar
  9. 9.
    GOLDREICH O., IMPAGLIAZZO R., LEVIN L., VENKATESAN R., and ZUCKERMAN D. “Security Preserving Amplification of Hardness.” Proc. of the 31st Annual Symposium on the Foundations of Computer Science (FOCS), 1990.Google Scholar
  10. 10.
    McELIECE R.J. “A Public Key Cryptosystem Based on Algebraic Coding Theory”. DSN Progress Report (Jan–Feb), Jet Propulsion Laboratory, California Institute of Technology, 1978.Google Scholar
  11. 11.
    NIEDERREITER H. “Knapsack-Type Cryptosystems and Algebraic Coding Theory.” Problems of Control and Information Theory, Vol 15 no. 2, 1986.Google Scholar
  12. 12.
    SIDELNIKOV V.M. “A Public-Key Cryptosystem Based on Binary Reed-Muller Codes.” Discrete Mathematics and Applications, Vol 4, no. 3, 1994.Google Scholar
  13. 13.
    SIDELNIKOV V.M. and SHESTAKOV S.O. “On Insecurity of Cryptosystems Based on Generalised Reed-Solomon Codes.” Discrete Mathematics and Applications, Vol 2, no. 4, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.Department of Computer ScienceBirkbeck CollegeLondonEngland

Personalised recommendations