Improved results on the probabilistic theory of the joint linear complexity of multisequences

DOI10.1007/s11432-011-4369-6zbMath1245.94082OpenAlexW2254965994MaRDI QIDQ439716

Michael Vielhaber, Harald Niederreiter, Li-Ping Wang

Publication date: 17 August 2012

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4369-6

zbMATH Keywords

stream ciphersmultisequencesjoint linear complexity

Mathematics Subject Classification ID

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

Related Items (1)

Multidimensional linear complexity analysis of periodic arrays

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic behavior of the joint linear complexity profile of multisequences
• The asymptotic normalized linear complexity of multisequences
• Enumeration results on the joint linear complexity of multisequences
• Analysis and design of stream ciphers
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences

This page was built for publication: Improved results on the probabilistic theory of the joint linear complexity of multisequences