A Comment on Niederreiter’s Public Key Cryptosystem

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


In this comment we show that a recently proposed public key cryptosystem is not safe for most of the practical cases. Furthermore, it is shown that the security of this system is closely connected with the problem of computing logarithms over a finite field.


  1. [1]
    H. Niederreiter, “A public-key cryptosystem based on shift register sequences”, Proceedings of EUROCRYPT 85, (F. Pichler, T. Beth, ed), Springer Lecture Notes, to appear.Google Scholar
  2. [2]
    N. Zierler, “Linear recurring sequences”, SIAM Journ., vol. 7, (1959), pp. 31–48, Reprinted in Linear sequential switching circuits, (W.H. Kautz, ed), Holden-Day, San Fransisco, 1965.zbMATHMathSciNetGoogle Scholar
  3. [3]
    M. Ben-Or, “Probabilistic algorithms in finite fields”, Proceedings of Foundations of Computer Science, 1981, pp.394–398.Google Scholar
  4. [4]
    E.R. Berlekamp, “Factoring polynomials over large finite fields”, Math. Comp., vol. 24, (1970), pp. 713–735.CrossRefMathSciNetGoogle Scholar
  5. [5]
    D. Coppersmith, “Fast evaluation of logarithms in finite fields of characteristic two, “IEEE Trans. on Inform. Theory, IT-30, (1984), pp. 587–594.CrossRefMathSciNetGoogle Scholar
  6. [6]
    A.M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, preliminary report, Bell Labs.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Department of Computer EngineeringUniversity of LundLundSweden

Personalised recommendations