【摘要】 针对基于GF(q)上m-序列的广义自缩序列,本文利用一种新手段给出线性复杂度上界值.主要讨论素数q大于等于3时,GF(q)上广义自缩序列的线性复杂度.对于GF(3)上广义自缩序列,把以往GF(3)上广义自缩序列的线性复杂度的上界缩小得到一个更精确地上界值.拓展到大于3的素数,给出GF(q)上广义自缩序列的线性复杂度精确上界值.更多还原

【Abstract】 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.更多还原