Advertisement
Published in:
2005 | OriginalPaper | Chapter
Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
Authors : Harald Niederreiter, Li-Ping Wang
Published in: Progress in Cryptology - INDOCRYPT 2005
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences. We also establish an asymptotic formula for the expected value of the
n
th joint linear complexity of random multisequences over a finite field. These results are relevant for the theory of word-based stream ciphers.