On linear complexity of sequences over \(\text{GF}(2^n)\)

DOI10.1016/J.TCS.2005.11.044zbMath1138.94009OpenAlexW1966045745MaRDI QIDQ818141

Guang Gong, Amr M. Youssef

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.044

zbMATH Keywords

cryptanalysislinear complexityBerlekamp-Massey algorithmbinary finite fields

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (2)

The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ Linear recurring sequences and subfield subcodes of cyclic codes

Cites Work

• Shift Register Synthesis (Modulo m)
• Linear Complexity and Random Sequences
• Relationships between m-sequences over GF(q) and GF(q/sup m/)
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On linear complexity of sequences over \(\text{GF}(2^n)\)