Analysis and design of stream ciphers
Analysis and design of stream ciphers
On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences
Designs, Codes and Cryptography
On the Number of Trace-One Elements in Polynomial Bases for $$\mathbb{F}_{2^n}$$
Designs, Codes and Cryptography
Some Notes on the Linear Complexity of Sidel'nikov-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 Sidel'nikov sequences over Fd
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
A class of balanced binary sequences with optimal autocorrelation properties
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
On the lower bound of the linear complexity over Fp of Sidelnikov sequences
IEEE Transactions on Information Theory
On the Linear Complexity and -Error Linear Complexity Over of the -ary Sidel'nikov Sequence
IEEE Transactions on Information Theory
Addendum to Sidel'nikov sequences over nonprime fields
Information Processing Letters
| Hi-index | 0.00 |
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields exhibit a large linear complexity. For Sidel'nikov sequences over F"8 we provide exact values for their linear complexity.