Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm

DOI10.1007/s10623-007-9134-xzbMath1178.94179OpenAlexW1985421175MaRDI QIDQ1008964

Wilfried Meidl

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9134-x

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

Quadratic functions with prescribed spectra ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences ⋮ On the stability of periodic binary sequences with zone restriction

Cites Work

• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• The expected value of the joint linear complexity of 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>
• Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• Progress in Cryptology - INDOCRYPT 2003
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item