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

Ding constructed a new cyclotomic class V 0 , V 1 . Based on it, a construction of generalized cyclotomic binary sequences with period p q is described, and their autocorrelation value, linear complexity, and minimal polynomial are confirmed. The autocorrelation function C S w is 3-level if p ≡ 3 mod 4 , and C S w is 5-level if p ≡ 1 mod 4 . The linear complexity LC S > p q / 2 if p ≡ 1 mod 8 , p > q + 1 , or p ≡ 3 mod 4 or p ≡ − 3 mod 8 . The results show that these sequences have quite good cryptographic properties in the aspect of autocorrelation and linear complexity.