On the linear complexity of Sidel'nikov sequences over nonprime fields
From MaRDI portal
Publication:958251
DOI10.1016/J.JCO.2008.04.002zbMath1153.11060OpenAlexW2157820864MaRDI QIDQ958251
Wilfried Meidl, Nina Brandstätter
Publication date: 3 December 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2008.04.002
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other character sums and Gauss sums (11T24)
Related Items (3)
Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields
Cites Work
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- Linear Complexity and Random Sequences
- A class of balanced binary sequences with optimal autocorrelation properties
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Progress in Cryptology - INDOCRYPT 2003
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the linear complexity of Sidel'nikov sequences over nonprime fields
