2005 | OriginalPaper | Buchkapitel
Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
verfasst von : Harald Niederreiter, Li-Ping Wang
Erschienen in: Progress in Cryptology - INDOCRYPT 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.