周期为pq的平衡四元广义分圆序列的线性复杂度

结合Gray映射和分圆理论,在Z4上构造了一类周期为pq的广义分圆序列。在有限域F_r(r≥5为奇素数)上确定新序列对应的傅里叶谱序列,并基于傅里叶谱序列的重量来确定新序列的线性复杂度。 结果表明, 该序列具有良好的线性复杂度性质, 能够抗击B-M算法的攻击, 是密码学意义上性质良好的伪随机序列。

Linear complexity of balanced quaternary generalized cyclotomic sequences with Period pq

Combined the theory of Gray mapping and cyclostomes, a new class of sequences over Z4 with Period pq was established. we will determine the corresponding Fourier spectral sequence of the new sequence on the finite field of F_r(r≥5, prime). Then, we will obtain the linear complexity of the new sequence from the weights of its Fourier spectral sequence. Results show that the sequences have larger linear complexity and can resist the attack by B-M algorithm. Its a good sequence from the viewpoint of cryptography.