Analysis and design of stream ciphers
Analysis and design of stream ciphers
Permutation polynomials, de Bruijn sequences, and linear complexity
Journal of Combinatorial Theory Series A
On cyclotomic generator of order r
Information Processing Letters
On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
One-error linear complexity over Fp of Sidelnikov sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
Lower bounds on the linear complexity of the discrete logarithm in finite fields
IEEE Transactions on Information Theory
Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
IEEE Transactions on Information Theory
Linear complexity over Fp of Sidel'nikov sequences
IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
On the linear complexity of bounded integer sequences over different moduli
Information Processing Letters
On the k-error linear complexity over $$\mathbb{F}_p$$ of Legendre and Sidelnikov sequences
Designs, Codes and Cryptography
On the linear complexity of Sidel'nikov sequences over nonprime fields
Journal of Complexity
On the linear complexity of bounded integer sequences over different moduli
Information Processing Letters
On the linear complexity of Sidel'nikov sequences over Fd
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Addendum to Sidel'nikov sequences over nonprime fields
Information Processing Letters
| Hi-index | 0.00 |
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.