The Generalized Self-shrinking Sequence On GF(q)

The main purpose of this paper is to describe the generalized self-shrinking generator and discuss the linear complexity of the generalized self-shrinking generator based on the m-sequences of GF(q), and mainly describe the fourth class of generalized self-shrinking sequences on GF(3), proof the pseudo-randomness of a new class of generalized self-shrinking sequences.This paper at first reached the upper bound of the generalized self-shrinking generator linear complexity on GF(3),compared with fourth documents and transform the linear complexity upper bound from 2×3n-1 to2×3n-1-(?)-1.Fur-thermore, the linear complexity upper bound on GF(q) can have a better consequence...