Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq

Yan Wang, Liantao Yan, Qing Tian, Liping Ding and Tianping Zhang

Journal of Mathematics, 2021, vol. 2021, 1-10

Abstract: Ding constructed a new cyclotomic class V0 ,V1. Based on it, a construction of generalized cyclotomic binary sequences with period pq is described, and their autocorrelation value, linear complexity, and minimal polynomial are confirmed. The autocorrelation function CSw is 3-level if p≡3mod4, and CSw is 5-level if p≡1mod4. The linear complexity LCS>pq/2 if p≡1 mod 8, p>q+1, or p≡3mod4 or p≡−3mod8. The results show that these sequences have quite good cryptographic properties in the aspect of autocorrelation and linear complexity.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5535887.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5535887.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5535887

DOI: 10.1155/2021/5535887

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().