Summary
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.
Chapter PDF
Similar content being viewed by others
References
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.
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.
M. Ben-Or, “Probabilistic algorithms in finite fields”, Proceedings of Foundations of Computer Science, 1981, pp.394–398.
E.R. Berlekamp, “Factoring polynomials over large finite fields”, Math. Comp., vol. 24, (1970), pp. 713–735.
D. Coppersmith, “Fast evaluation of logarithms in finite fields of characteristic two, “IEEE Trans. on Inform. Theory, IT-30, (1984), pp. 587–594.
A.M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, preliminary report, Bell Labs.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smeets, B. (1986). A Comment on Niederreiter’s Public Key Cryptosystem. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive