Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2

Authors:
Cunsheng Ding
Affiliations:
Turku Centre for Computer Science, Lemminkaisenkatu 14 A, DataCity, FIN-20520, Turku, Finlandf1cding@aton.abo.fif1
Venue:
Finite Fields and Their Applications
Year:
1997

Citing 4
Cited 16

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
Cryptanalysts representation of nonlinearly filtered ML-sequences

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences

Journal of Cryptology
Decrypting a Class of Stream Ciphers Using Ciphertext Only

IEEE Transactions on Computers

Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences

Designs, Codes and Cryptography
Sequences related to Legendre/Jacobi sequences

Information Sciences: an International Journal
The linear complexity of new generalized cyclotomic binary sequences of order four

Information Sciences: an International Journal
Cryptographic properties of some binary generalized cyclotomic sequences with the length p2

Information Sciences: an International Journal
Trace representation of some generalized cyclotomic sequences of length pq

Information Sciences: an International Journal
Binary Sequences with Three and Four Level Autocorrelation

Computational Intelligence and Security
Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2k

Information Sciences: an International Journal
Remarks on a cyclotomic sequence

Designs, Codes and Cryptography
A general approach to construction and determination of the linear complexity of sequences based on cosets

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On the autocorrelation and the linear complexity of q-ary prime n-square sequences

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq

Frontiers of Computer Science in China
The linear complexity of binary sequences with optimal autocorrelation

IEEE Transactions on Information Theory
Pseudo-randomness of certain sequences of k symbols with length pq

Journal of Computer Science and Technology
Interpolation of functions related to the integer factoring problem

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A new frequency-hopping sequence set based upon generalized cyclotomy

Designs, Codes and Cryptography
Linear complexity of quaternary sequences of length pq with low autocorrelation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.06

Visualization

Abstract

There are several kinds of cyclotomic sequences. They have a number of good randomness properties. In this paper we calculate the linear complexity (linear span) of generalized cyclotomic binary sequences of order 2. Our results show that their linear complexity is quite good.