Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
Publication:2400720
DOI10.1007/S12095-016-0208-3zbMath1369.94508arXiv1602.05888OpenAlexW2963479517MaRDI QIDQ2400720
Publication date: 30 August 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05888
Gauss sumsdifference setslinear complexityautocorrelationJacobi sumsalmost difference setsfeedback shift registersstream cipher cryptography
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Exponential sums (11T23) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Sequences (mod (m)) (11B50)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete solving of explicit evaluation of Gauss sums in the index 2 case
- Cyclotomic constructions of skew Hadamard difference sets
- Calculation of certain Gauss sums
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- On the linear complexity of Sidel'nikov sequences over nonprime fields
- Sums of Gauß, Eisenstein, Jacobi, Jacobsthal, and Brewer
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
- A survey of partial difference sets
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Addendum to Sidel'nikov sequences over nonprime fields
- The field descent method
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- 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
- A class of balanced binary sequences with optimal autocorrelation properties
- On rationality of Jacobi sums
- Almost difference sets and their sequences with optimal autocorrelation
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- On the pure Jacobi sums
- On the p-rank of the design matrix of a difference set
This page was built for publication: Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
