scientific article; zbMATH DE number 1972837

MaRDI QIDQ4421629zbMATH OpenFDO

Authors Zongduo Dai, Junhui Yang, Guang Gong, Ping Wang

Publication date 8 February 2004

zbMATH Keywords

digital communicationlinear complexitystream cipher

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1182117
• On the linear complexity of Legendre-Sidelnikov sequences
• ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
• Linear Complexity of Some Generalized Cyclotomic Sequences
• Linear complexity and expansion complexity of some number theoretic sequences
• Linear complexity of generalized sequences by comparison of PN-sequences
• On the linear complexity of the Naor-Reingold sequence
• The Linear Generation of the Legendre Sequence
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)

Cited in

(6)

• Remarks on the generalized cyclotomic sequences of length 2p^m
• A new lower bound on the family complexity of Legendre sequences
• On the linear complexity of Legendre-Sidelnikov sequences
• scientific article; zbMATH DE number 1182117 (Why is no real title available?)
• scientific article; zbMATH DE number 1760753 (Why is no real title available?)
• GLS: new class of generalized Legendre sequences with optimal arithmetic cross-correlation

This page was built for publication:

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