The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions
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 ∈ ℕ.
KeywordsLinear complexity multisequence Battery Discharge Model
Unable to display preview. Download preview PDF.
- 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
- 4.Rosenblatt, M.: Random Processes. Springer (1974)Google Scholar
- 5.Shoup, V.: The Number Theory Library NTL, http://shoup.net/ntl
- 6.Sloane, N.J.A.: Online Encyclopedia of Integer Sequences, http://oeis.org
- 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: arXiv.org/abs/0705.4134
- 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, arXiv.org/abs/cs.IT/0607030