The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions
- Cite this paper as:
- Vielhaber M., del Pilar Canales Chacón M. (2012) The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions. In: Helleseth T., Jedwab J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg
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.