On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)

DOI10.1007/S10623-010-9379-7zbMath1213.94074OpenAlexW2065269567MaRDI QIDQ2430407

Jian-Qin Zhou

Publication date: 6 April 2011

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

Full work available at URL: https://doi.org/10.1007/s10623-010-9379-7

zbMATH Keywords

linear complexitystream cipherperiodic sequencek-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 (4)

Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ On the stability of periodic binary sequences with zone restriction

Cites Work

• How many bits have to be changed to decrease the linear complexity?
• The stability theory of stream ciphers
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• A relationship between linear complexity and k-error linear complexity
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)

This page was built for publication: On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)