The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions

  • Michael Vielhaber
  • Mónica del Pilar Canales Chacón
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7280)


In the theory of stream ciphers, an important complexity measure to assess the (pseudo-)randomness of a stream generator is the linear complexity, essentially the complexity to approximate the sequence (seen as formal power series) by rational functions.

For multisequences with several, i.e. M, streams in parallel (e.g. for broadband applications), simultaneous approximation is considered.

This paper improves on previous results by Niederreiter and Wang, who have given an algorithm to calculate the distribution of linear complexities for multisequences, obtaining formulae for M = 2 and 3. Here, we give a closed formula numerically verified for M up to 8 and for M = 16, and conjectured to be valid for all M ∈ ℕ.

We model the development of the linear complexity of multisequences by a stochastic infinite state machine, the Battery–Discharge–Model, and we obtain the asymptotic probability for the linear complexity deviation d(n) : = L(n) − ⌈n·M/(M + 1)⌉ for M sequences in parallel as
$${prob}(d(n)=d)=\Theta\left(q^{-|d|(M+1)}\right),\forall M\in \mathbb N, \forall d\in\mathbb Z, \forall q=p^k.$$
The precise formula is given in the text.


Linear complexity multisequence Battery Discharge Model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Canales Chacón, M. del P., Vielhaber, M.: Structural and Computational Complexity of Isometries and their Shift Commutators. Electronic Colloq. on Computational Complexity, ECCC TR04–057 (2004)Google Scholar
  2. 2.
    Dai, Z., Feng, X., Yang, J.: Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 339–354. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Niederreiter, H., Wang, L.–P.: The Asymptotic Behavior of the Joint Linear Complexity Profile of Multisequences. Monatshefte für Mathematik 150, 141–155 (2007)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Rosenblatt, M.: Random Processes. Springer (1974)Google Scholar
  5. 5.
    Shoup, V.: The Number Theory Library NTL,
  6. 6.
    Sloane, N.J.A.: Online Encyclopedia of Integer Sequences,
  7. 7.
    Vielhaber, M., Canales Chacón, M. del P.: The Battery–Discharge–Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion, published at:
  8. 8.
    Vielhaber, M., Canales Chacón, M. del P.: Towards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Linear Complexity of Multisequences,
  9. 9.
    Vielhaber, M.: A Unified View on Sequence Complexity Measures as Isometries. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 143–153. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Wang, L.–P., Niederreiter, H.: Enumeration results on the joint linear complexity of multisequences. Finite Fields Appl. 12, 613–637 (2006)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC, Boca Raton (2000)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Michael Vielhaber
    • 1
    • 2
  • Mónica del Pilar Canales Chacón
    • 1
    • 2
  1. 1.Hochschule Bremerhaven, FB2BremerhavenGermany
  2. 2.Instituto de MatemáticasUniversidad Austral de ChileValdiviaChile

Personalised recommendations