How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences

DOI10.1007/S12095-008-0007-6zbMath1178.94180OpenAlexW1971650881MaRDI QIDQ1032492

Wilfried Meidl

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-0007-6

zbMATH Keywords

algorithmlinear recurring sequenceslinear complexitystream cipher\(k\)-error linear complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (1)

Computing the linear complexity for sequences with characteristic polynomial \(f^v\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
• The stability theory of stream ciphers
• The expected value of the joint linear complexity of periodic multisequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• The expectation and variance of the joint linear complexity of random periodic multisequences
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
• Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
• On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
• Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
• On the Joint Linear Complexity of Linear Recurring Multisequences
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• Linear Complexity of Periodically Repeated Random Sequences
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Polynomial weights and code constructions

This page was built for publication: How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences