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

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 CS...

Full description

Bibliographic Details
Main Authors:	Yan Wang, Liantao Yan, Qing Tian, Liping Ding
Format:	Article
Language:	English
Published:	Hindawi Limited 2021-01-01
Series:	Journal of Mathematics
Online Access:	http://dx.doi.org/10.1155/2021/5535887

id	doaj-f6287e152cbb49cbb6cbcede68b68102
record_format	Article
spelling	doaj-f6287e152cbb49cbb6cbcede68b681022021-05-10T00:27:06ZengHindawi LimitedJournal of Mathematics2314-47852021-01-01202110.1155/2021/5535887Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pqYan Wang0Liantao Yan1Qing Tian2Liping Ding3School of ScienceSchool of ScienceSchool of ScienceSchool of ScienceDing 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.http://dx.doi.org/10.1155/2021/5535887
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Yan Wang Liantao Yan Qing Tian Liping Ding
spellingShingle	Yan Wang Liantao Yan Qing Tian Liping Ding Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq Journal of Mathematics
author_facet	Yan Wang Liantao Yan Qing Tian Liping Ding
author_sort	Yan Wang
title	Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq
title_short	Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq
title_full	Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq
title_fullStr	Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq
title_full_unstemmed	Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq
title_sort	autocorrelation and linear complexity of binary generalized cyclotomic sequences with period pq
publisher	Hindawi Limited
series	Journal of Mathematics
issn	2314-4785
publishDate	2021-01-01
description	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.
url	http://dx.doi.org/10.1155/2021/5535887
work_keys_str_mv	AT yanwang autocorrelationandlinearcomplexityofbinarygeneralizedcyclotomicsequenceswithperiodpq AT liantaoyan autocorrelationandlinearcomplexityofbinarygeneralizedcyclotomicsequenceswithperiodpq AT qingtian autocorrelationandlinearcomplexityofbinarygeneralizedcyclotomicsequenceswithperiodpq AT lipingding autocorrelationandlinearcomplexityofbinarygeneralizedcyclotomicsequenceswithperiodpq
_version_	1721453887914770432

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

Similar Items