Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
From MaRDI portal
Publication:2400720
almost difference setsautocorrelationdifference setsfeedback shift registersGauss sumsJacobi sumslinear complexitystream cipher cryptography
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Sequences (mod (m)) (11B50) Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Abstract: Binary sequences with good autocorrelation properties and large linear complexity are useful in stream cipher cryptography. The Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences have nearly optimal autocorrelation. However, the problem of determining the linear complexity of the SLCE sequences is still open. Our approach is to exploit the fact that character values associated with the SLCE sequences can be expressed in terms of a certain type of Jacobi sum. By making use of known evaluations of Gauss and Jacobi sums in the "pure" and "small index" cases, we are able to obtain new insight into the linear complexity of the SLCE sequences.
Recommendations
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- On the linear complexity of Sidel'nikov sequences over nonprime fields
Cites work
- A class of balanced binary sequences with optimal autocorrelation properties
- A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
- A survey of partial difference sets
- Addendum to Sidel'nikov sequences over nonprime fields
- Almost difference sets and their sequences with optimal autocorrelation
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- Calculation of certain Gauss sums
- Complete solving of explicit evaluation of Gauss sums in the index 2 case
- Cyclotomic constructions of skew Hadamard difference sets
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3115157 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 3463514 (Why is no real title available?)
- scientific article; zbMATH DE number 1972842 (Why is no real title available?)
- scientific article; zbMATH DE number 2060625 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- On rationality of Jacobi sums
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- On the linear complexity of Sidel'nikov sequences over nonprime fields
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- On the p-rank of the design matrix of a difference set
- On the pure Jacobi sums
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- Sums of Gauß, Eisenstein, Jacobi, Jacobsthal, and Brewer
- The field descent method
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
Cited in
(6)- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- scientific article; zbMATH DE number 1972850 (Why is no real title available?)
- On the pseudorandom properties of k-ary Sidel'nikov sequences
- Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences
This page was built for publication: Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400720)
