The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)
Jinling Wang · Dianzi xuebao · 2011
The purpose is to discuss the linear complexity of the generalized self-shrinking generator which is based on the m-sequences of GF(q),and analyze the linear complexity on the condition when prime q greater than 3.Reach the upper bound of the generalized self-shrinking generator linear complexity on GF(3),and diminish the linear complexity upper bound.The linear complexity upper bound on GF(q) can have better accurate value.