Linear Complexity of Generalized Cyclotomic Binary Sequences with Period 2pm+1qn+1
Dandan Li, Qiaoyan Wen, Jie Zhang, Liying Jiang · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2015
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 2pm+1qn+1. Furthermore, we establish the formula of the linear complexity of proposed sequences. The results reveal that such sequences with period 2pm+1qn+1 have a good balance property and high linear complexity.