Abstract
We study the linear complexity profile and the jump complexity of keystream sequences in arbitrary finite fields. We solve counting problems connected with the jump complexity, establish formulas for the expected value and the variance of the jump complexity, and prove probabilistic theorems on the jump complexity profile of random sequences. We also extend earlier work on frequency distributions in the linear complexity profile to joint frequency distributions.
Chapter PDF
Similar content being viewed by others
References
G.D. Carter: Aspects of Local Linear Complexity, Ph.D. thesis, Univ. of London, 1989.
F.G. Gustavson: Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm, IBM J. Res. Develop. 20, 204–212 (1976).
M. Loève: Probability Theory, 3rd ed., Van Nostrand, New York, 1963.
J.L. Massey: Shift-register synthesis and BCH decoding, IEEE Trans. Information Theory 15, 122–127 (1969).
H. Niederreiter: Sequences with almost perfect linear complexity profile, Advances in Cryptology — EUROCRYPT’ 87, Lecture Notes in Computer Science, Vol. 304, pp. 37–51, Springer, Berlin, 1988.
H. Niederreiter: The probabilistic theory of linear complexity, Advances in Cryptology —EUROCRYPT’ 88, Lecture Notes in Computer Science, Vol. 330, pp. 191–209, Springer, Berlin, 1988.
H. Niederreiter: A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences, J. of Cryptology, to appear.
H. Neiderreiter: Keystream sequences with a good linear complexity profile for every starting point, Advances in Cryptology — EUROCRYPT’ 89, Lecture Notes in Computer Science, Springer, Berlin, to appear.
R.A. Rueppel: Linear complexity and random sequences, Advances in Cryptology — EUROCRYPT’85, Lecture Notes in Computer Science, Vol. 219, pp. 167–188, Springer, Berlin, 1986.
R.A. Rueppel: Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
M.Z. Wang: Cryptographic Aspects of Sequence Complexity Measures, Ph.D. dissertation, ETH Zürich, 1988.
M.Z. Wang: Linear complexity profiles and jump complexity, submitted to J. of Cryptology.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niederreiter, H. (1991). The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_15
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive