A Comment on Niederreiter’s Public Key Cryptosystem
- 701 Downloads
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.
- 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
- M. Ben-Or, “Probabilistic algorithms in finite fields”, Proceedings of Foundations of Computer Science, 1981, pp.394–398.Google Scholar
- A.M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, preliminary report, Bell Labs.Google Scholar