A fast algorithm for determining the linear complexity in periodic sequences

MaRDI QIDQ5455613zbMATH OpenFDO

Authors Jianqin Zhou

Publication date 4 April 2008

zbMATH Keywords

crytographyminimal polynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Information Security and Cryptology
• A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
• A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
• Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)
• scientific article; zbMATH DE number 1955778

Cited in

(8)

• On the calculation of the linear complexity of periodic sequences
• Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
• A fast algorithm for determining the minimal polynomial of \(up^n\)-periodic sequence
• scientific article; zbMATH DE number 7089069 (Why is no real title available?)
• A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
• scientific article; zbMATH DE number 2230870 (Why is no real title available?)
• Information Security and Cryptology

This page was built for publication: A fast algorithm for determining the linear complexity in periodic sequences

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