Linear Complexity of Generalized Cyclotomic Binary Sequences with Period 2p^m+1qⁿ⁺¹

Abstract

The linear complexity of binary sequences plays a fundamental part in cryptography. In the paper, we construct more general forms of generalized cyclotomic binary sequences with period 2p^m+1qⁿ⁺¹. Furthermore, we establish the formula of the linear complexity of proposed sequences. The results reveal that such sequences with period 2p^m+1qⁿ⁺¹ have a good balance property and high linear complexity.