Vladimir Edemskiy, Chenhuang Wu, "On the Linear Complexity of Binary Sequences Derived from Generalized Cyclotomic Classes Modulo (2^n)(p^m)," WSEAS Transactions on Mathematics, vol. 18, pp. 197-202, 2019, DOI:
Vladimir Edemskiy, Chenhuang Wu. On the Linear Complexity of Binary Sequences Derived from Generalized Cyclotomic Classes Modulo (2^n)(p^m).
WSEAS Transactions on Mathematics. 2019;18:197-202.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 18, 2019
On the Linear Complexity of Binary Sequences Derived from Generalized Cyclotomic Classes Modulo (2^n)(p^m)
Authors: ,
Abstract: The linear complexity of a sequence is an important parameter in its evaluation as a keystream cipher for cryptographic applications. Using of cyclotomic classes to construct sequences is an important method for designing sequences with high linear complexity. In this article, we study the linear complexity of generalized cyclotomic binary sequences of length 2npm. These sequences were constructed from new generalized cyclotomic classed prepared by X. Zeng at el. We investigate discrete Fourier transform of these sequences and define the sufficient conditions for the existence of sequences with high linear complexity.
Pages: 197-202 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 18, 2019, Art. #27 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools