The Probabilistic Theory of the Joint Linear Complexity of Multisequences

DOI10.1007/11863854_2zbMath1152.94392OpenAlexW1607119997MaRDI QIDQ3541903

Harald Niederreiter

Publication date: 27 November 2008

Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11863854_2

zbMATH Keywords

linear complexitymultisequencesjoint linear complexityword-based stream ciphersjoint linear complexity profile

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (7)

Error linear complexity measures for multisequences ⋮ Improved results on the probabilistic theory of the joint linear complexity of multisequences ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ Periodic multisequences with large error linear complexity ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)

This page was built for publication: The Probabilistic Theory of the Joint Linear Complexity of Multisequences