In recent years, the sequence theory over Galois rings has become a hot research problem.The No sequences over finite fields are a kind of pseudorandom sequences and they have an important role in stream cipher.By making use of the permutation on Galois rings, a new family of No sequences is constructed by this paper over Galois ring (Z) peand is researched on their linear complexities.The result of the research shows that such No sequences have extremely large linear complexities.%近年来,伽罗瓦环上的序列理论成为人们研究的热点问题.有限域上的No序列是一类伪随机序列,它在序列密码中占具十分重要的角色.本文利用伽罗瓦环上的置换,构造了伽罗瓦环(Z)pe上的一类新的No序列,并且研究了其线性复杂度.研究的结果表明此类No序列具有相当大的线性复杂度.
展开▼
