Z_4上周期为2p^2的四元广义分圆序列的线性复杂度

Linear Complexity of Quaternary Sequences over Z_4 Derived from Generalized Cyclotomic Classes Modulo 2p^2

该文根据特征为4的Galois环理论,在Z4上利用广义分圆构造出一类新的周期为2p2(p为奇素数)的四元序列,并且给出了它的线性复杂度。结果表明,该序列具有良好的线性复杂度性质,能够抗击Berlekamp-Massey(B-M)算法的攻击,是密码学意义上性质良好的伪随机序列。

Based on the theory of Galois rings of characteristic 4, a new class of quaternary sequences with period 2p2 is established over Z4 using generated cyclotomy, where p is an odd prime. The linear complexity of the new sequences is determined. Results show that the sequences have larger linear complexity and resist the attack by Berlekamp-Massey （B-M） algorithm. It is a good sequence from the viewpoint of cryptography.