构造了GF(q)上一种新型的自缩序列模型,利用有限域理论,研究了生成序列的周期和线性复杂度,得到如下结论:周期上界qn(q-1)/2,下界q(q-1)「n/q」;线性复杂度上界qn(q-1)/2,下界q(q-1)「n/q」-1。这些结果表明生成序列是一种良好的密钥流序列。且当q=2时,恰是GF(2)上的自缩序列。 A new type of self-shrinking sequence model on GF (q) is constructed. Using the theory of finite field, the periodicity and linear complexity of the generated sequence are studied. The following conclusions are obtained: the upper bound qn (q-1) (q-1) “n / q”; the linear complexity upper bound qn (q-1) / 2 and the lower bound q (q-1) “n / q” -1. These results show that the generated sequence is a good keystream sequence. And when q = 2, it is exactly the contraction sequence on GF (2).