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

DOI10.1007/S11425-006-0715-3MaRDI QIDQ862718zbMATH OpenOpenAlexFDO

Authors 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 algorithmnumber theory of the finite fieldstream cipher

Mathematics Subject Classification ID

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

Recommendations

• 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 Linear Complexity of Periodic Sequences over GF(3)
• scientific article; zbMATH DE number 1955778
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)

Cites work

• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
• 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/
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
• Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• The stability theory of stream ciphers

Cited in

(6)

• Computing the linear complexity for sequences with characteristic polynomial f^v
• Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
• Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
• A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
• A fast algorithm for determining the linear complexity in periodic sequences
• A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862718)