Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences

DOI10.1007/11596219_2zbMath1153.94338OpenAlexW1508410587MaRDI QIDQ5450973

Harald Niederreiter, Li-Ping Wang

Publication date: 17 March 2008

Published in: Progress in Cryptology - INDOCRYPT 2005 (Search for Journal in Brave)

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

zbMATH Keywords

multisequencesjoint linear complexityjoint linear complexity profileWord-based stream ciphers

Mathematics Subject Classification ID

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

Related Items (8)

Classification and counting on multi-continued fractions and its application to multi-sequences ⋮ Improved results on periodic multisequences with large error linear complexity ⋮ Error linear complexity measures for multisequences ⋮ Improved results on the probabilistic theory of the joint linear complexity of multisequences ⋮ The asymptotic normalized linear complexity of 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: Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences