Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\)

DOI10.1007/s12095-015-0157-2zbMath1372.94405OpenAlexW1962676760MaRDI QIDQ301631

Fulin Li, Shixin Zhu, Ting Jiang, Hong Gang Hu

Publication date: 1 July 2016

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

Full work available at URL: https://doi.org/10.1007/s12095-015-0157-2

zbMATH Keywords

algorithmstream cipherserror joint linear complexity spectrummultisequence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• How many bits have to be changed to decrease the linear complexity?
• A linear algebraic approach to multisequence shift-register synthesis
• Error linear complexity measures for multisequences
• Periodic multisequences with large error linear complexity
• The stability theory of stream ciphers
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
• An algorithm fork-error joint linear complexity of binary multisequences
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Periodic sequences with large k-error linear complexity
• Multisequences With Large Linear and $k$-Error Linear Complexity From Hermitian Function Fields
• Shift-register synthesis and BCH decoding