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

DOI10.1007/s12095-013-0080-3zbMath1271.94015OpenAlexW2121360584MaRDI QIDQ2392687

Raphael C.-W. Phan, Alex J. Burrage, Ana Sălăgean

Publication date: 2 August 2013

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

Full work available at URL: https://doi.org/10.1007/s12095-013-0080-3

zbMATH Keywords

linear recurrent sequenceslinear complexityGames-Chan algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cites Work

• Unnamed Item
• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
• The stability theory of stream ciphers
• Shift Register Sequences – A Retrospective Account
• 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.)

This page was built for publication: Computing the linear complexity for sequences with characteristic polynomial \(f^v\)