On the k-error linear complexity of cyclotomic sequences

DOI10.1515/JMC.2007.014MaRDI QIDQ5443539zbMATH OpenOpenAlexFDO

Authors Wilfried Meidl, Arne Winterhof, Hassan Y. Aly

Publication date 21 February 2008

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jmc.2007.014

zbMATH Keywords

pseudorandom sequencescyclotomic sequencesk-error linear complexityHall's sextic residue sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
• Linear Complexity of Some Generalized Cyclotomic Sequences
• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• The linear complexity of generalized cyclotomic binary sequences of period p^n
• The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
• Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• On the \(k\)-error linear complexity of sequences from function fields
• Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n

Cites work

• Extensions of Mappings into n-Cubes
• Linear complexity of the discrete logarithm
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• New self-dual codes over GF(4) with the highest known minimum weights
• On cyclotomic generator of order \(r\).
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences

Cited in

(12)

• On the stability of m-sequences
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• On linear complexity of binary lattices. II
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• Remarks on a cyclotomic sequence
• On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
• Linear complexity of a class of pseudorandom sequences over a general finite field
• On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• Additive character sums of polynomial quotients
• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
• On the linear complexity of binary threshold sequences derived from Fermat quotients

This page was built for publication: On the k-error linear complexity of cyclotomic sequences

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