线性复杂度是度量序列随机性的一个重要指标。基于Ding-广义割圆序列,构造了GF(l)上一类新的周期为p~3的广义割圆序列(其中l为一奇素数h的幂),且该序列为平衡序列,并通过有限域上的多项式理论确定了该序列的线性复杂度。结果表明,该类序列具有良好的线性复杂度性质,以它们做密钥流序列的密码系统具有抵抗B-M算法攻击的能力。 Linear complexity is an important indicator of the randomness of a sequence. Based on the Ding-generalized cut-off sequence, a new generalized cut-off sequence with period p ~ 3 (where l is a power of odd prime h) is constructed on GF (l), and the sequence is a balanced sequence Polynomial theory over finite fields determines the linear complexity of the sequence. The results show that these sequences have good linear complexity properties. The cryptosystems that use them as keystream sequences have the ability to resist B-M attacks.