Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)

DOI10.1007/S11425-006-0715-3zbMath1138.94343OpenAlexW1902537316MaRDI QIDQ862718

Hao Chen

Publication date: 24 January 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-006-0715-3

zbMATH Keywords

cryptographyfast algorithmstream ciphernumber theory of the finite field

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Finite fields (field-theoretic aspects) (12E20)

Cites Work

• Unnamed Item
• 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
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
• Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
• 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/
• Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/

This page was built for publication: Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)