Abstract: This paper considers the linear complexity of binary sextic Whiteman generalized cyclotomic sequences with period pq. Results show that the lower bound of their linear complexity is . From the viewpoint of stream cipher cryptosystems, almost all these sequences have good linear complexity. They can resist attacks from the application of the Berlekamp-Massey algorithm.

Key words: stream cipher, cyclotomic class, cyclotomic sequences, linear complexity

摘要： 在所有周期为pq的2k阶W-广义割圆序列的线性复杂度都已经得到准确计算的基础上，考虑周期为pq的6阶W-广义割圆序列的线性复杂度。结果表明这类序列的线性复杂度的下界是 。从密码学的角度看，多数的二元W-广义割圆序列具有良好的线性复杂度性质，以它们做密钥流序列的密码系统具有很强的抵抗B-M算法攻击的能力。

关键词: 流密码, 割圆类, 割圆序列, 线性复杂度

CLC Number: 

• TN918.4