Lower bounds on error complexity measures for periodic LFSR and FCSR sequences

DOI10.1007/s12095-008-0004-9zbMath1178.94177MaRDI QIDQ1032491

Andrew Klapper, Ramakanth Kavuluru

Publication date: 26 October 2009

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-008-0004-9

zbMATH Keywords

linear complexity; LFSR; \(N\)-adic complexity; FCSR; \(k\)-error complexity

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

Related Items

FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)

Cites Work

• How many bits have to be changed to decrease the linear complexity?
• Error linear complexity measures for multisequences
• The stability theory of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• The expected value of the joint linear complexity of periodic multisequences
• Counting functions and expected values for the \(k\)-error linear complexity
• The expectation and variance of the joint linear complexity of random periodic multisequences
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
• A relationship between linear complexity and k-error linear complexity
• Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences