一类周期为pq^(2)的r元序列线性复杂度研究

Study of the Linear Complexity of A Class of r-ary Sequence with Period pq^(2)

利用模pq的欧拉商定义了周期为pq^(2)的r元序列,并确定了该序列线性复杂度的精确值.结果表明,新序列具有高的线性复杂度,可以抵抗Berlekamp Massey算法的攻击.

Based on the Euler quotient modulus pq,a class of r-ary sequence with period pq^(2)is defined.The exact value of the linear complexity of the new sequence is determined.The results show that the new defined sequence has high linear complexity and thus can resist Berlekamp Massey algorithm attack.