序列的线性复杂度与序列的安全性息息相关。本文利用Galois理论,研究了一类在有限域F4上具有较高线性复杂度的四元序列,得到了其在Galois环Z4上的线性复杂度的确切值。结果显示,这类序列在Galois环Z4上也具有较高的线性复杂度,可以较好地抵抗Reeds-Sloane算法的攻击。The linear complexity of a sequence is closely related to its cryptographic security. In this paper, we employ Galois theory to investigate a class of quaternary sequence over the finite field F4 with high linear complexity, and determine the exact value of its linear complexity over the Galois ring Z4. The results demonstrate that such sequence maintain relatively high linear complexity in the Galois ring Z4, thereby exhibiting strong resistance against attacks by the Reeds-Sloane algorithm.
