×

zbMATH — the first resource for mathematics

Proof of a conjecture on the joint linear complexity profile of multisequences. (English) Zbl 1153.94338
Maitra, Subhamoy (ed.) et al., Progress in cryptology – INDOCRYPT 2005. 6th international conference on cryptology in India, Bangalore, India, December 10–12, 2005, Proceedings. Berlin: Springer (ISBN 978-3-540-30805-8/pbk). Lecture Notes in Computer Science 3797, 13-22 (2005).
Summary: 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.
For the entire collection see [Zbl 1131.94004].

MSC:
94A55 Shift register sequences and sequences over finite alphabets in information and communication theory
94A60 Cryptography
PDF BibTeX XML Cite
Full Text: DOI