- Full text PDF available (10)
- This year (1)
- Last 5 years (14)
- Last 10 years (17)
Journals and Conferences
We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period pq. This method is based on using the polynomial of the classical cyclotomic sequence, this allows to obtain well-known results and also new results. We found the linear complexity of Whiteman generalized cyclotomic sequences based on cyclotomic… (More)
The linear complexity L, of a sequence is an important parameter in its evaluation as a key stream cipher for cryptographic applications. Ideally, good sequences combine the autocorrelation properties of a random sequence with high linear complexity. Cyclotomic and generalized cyclotomic sequences are important pseudorandom sequences in stream ciphers due… (More)
We found the linear complexity of generalized cyclotomic sequences with period $$2p^n$$ 2 p n based on quadratic, biquadratic and partially sextic residues. Our method is based on the generating the polynomial of the classical cyclotomic sequences, which allows us to obtain some well-known results and also some new results.
Tang et al. and Lim et al. presented ways to construct balanced quaternary sequences with even period and optimal autocorrelation value by inverse Gray-mapping of binary sequences with optimal autocorrelation value. In this article, we consider quaternary sequences constructed from binary Legendre or Hall’s sextic sequence by these methods. We derive the… (More)
We examine the linear complexity and the autocorrelation of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.
In this article, we generalize results about binary sequences of length 2p and evaluate the linear complexity and autocorrelation properties of generalized cyclotomic binary sequences of length 2p. We show that in most cases these sequences have high linear complexity and poor autocorrelation performance.
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.