Abstract
The determination of the linear complexity of the product of two shift-register sequences is a basic problem in the theory of stream ciphers. We present for the first time a lower bound for the linear complexity of the product of two shift-register sequences in the general case. Moreover, we provide information on the minimal polynomial of such a product.
Chapter PDF
References
Golić, J. Dj.: On the linear complexity of functions of periodic GF(q) sequences, IEEE Trans. Inform. Theory 35, 69–75 (1989).
Göttfert, R.: Produkte von Schieberegisterfolgen, Ph.D. Dissertation, Univ. of Vienna, 1993.
Göttfert, R., and Niederreiter, H.: On the linear complexity of products of shift-register sequences, Advances in Cryptology — EUROCRYPT '93 (T. Helleseth, ed.), Lecture Notes in Computer Science, vol. 765, pp. 151–158, Springer-Verlag, Berlin, 1994.
Herlestam, T.: On functions of linear shift register sequences, Advances in Cryptology — EUROCRYPT '85 (F. Pichler, ed.), Lecture Notes in Computer Science, vol. 219, pp. 119–129, Springer-Verlag, Berlin, 1986.
Lidl, R., and Niederreiter, H.: Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge, 1986.
Niederreiter, H.: Sequences with almost perfect linear complexity profile, Advances in Cryptology — EUROCRYPT '87 (D. Chaum and W. L. Price, eds.), Lecture Notes in Computer Science, vol. 304, pp. 37–51, Springer-Verlag, Berlin, 1988.
Rueppel, R. A.: Stream ciphers, Contemporary Cryptology: The Science of Information Integrity (G. J. Simmons, ed.), pp. 65–134, IEEE Press, New York, 1992.
Rueppel, R. A., and Staffelbach, O. J.: Products of linear recurring sequences with maximum complexity, IEEE Trans. Inform. Theory 33, 124–131 (1987).
Zierler, N., and Mills, W. H.: Products of linear recurring sequences, J. Algebra 27, 147–157 (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Göttfert, R., Niederreiter, H. (1995). A general lower bound for the linear complexity of the product of shift-register sequences. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053438
Download citation
DOI: https://doi.org/10.1007/BFb0053438
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive