Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences

DOI10.1007/978-3-540-77272-9_14zbMath1154.94353MaRDI QIDQ5447518

Ana Sălăgean, Alexandra Alecu

Publication date: 7 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77272-9_14

zbMATH Keywords

stream ciphers; linear complexity; pseudorandom sequences; \(k\)-error linear complexity

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

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

94A60: Cryptography

Related Items

Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
• On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
• 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/
• Shift-register synthesis and BCH decoding