The Linear Complexity Profile and the Jump Complexity of Keystream Sequences

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


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.


  1. [1]
    G.D. Carter: Aspects of Local Linear Complexity, Ph.D. thesis, Univ. of London, 1989.Google Scholar
  2. [2]
    F.G. Gustavson: Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm, IBM J. Res. Develop. 20, 204–212 (1976).MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    M. Loève: Probability Theory, 3rd ed., Van Nostrand, New York, 1963.zbMATHGoogle Scholar
  4. [4]
    J.L. Massey: Shift-register synthesis and BCH decoding, IEEE Trans. Information Theory 15, 122–127 (1969).MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    H. Niederreiter: A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences, J. of Cryptology, to appear.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    R.A. Rueppel: Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.zbMATHCrossRefGoogle Scholar
  11. [11]
    M.Z. Wang: Cryptographic Aspects of Sequence Complexity Measures, Ph.D. dissertation, ETH Zürich, 1988.Google Scholar
  12. [12]
    M.Z. Wang: Linear complexity profiles and jump complexity, submitted to J. of Cryptology.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Institute for Information ProcessingAustrian Academy of SciencesViennaAustria

Personalised recommendations