摘要
针对基于GF(q)上m-序列的广义自缩序列,本文利用一种新手段给出线性复杂度上界值.主要讨论素数q大于等于3时,GF(q)上广义自缩序列的线性复杂度.对于GF(3)上广义自缩序列,把以往GF(3)上广义自缩序列的线性复杂度的上界缩小得到一个更精确地上界值.拓展到大于3的素数,给出GF(q)上广义自缩序列的线性复杂度精确上界值.
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.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2011年第2期414-418,共5页
Acta Electronica Sinica
基金
河南省教育厅自然科学指导性计划项目(No.200510459003)
关键词
线性复杂度
广义自缩序列
M-序列
特征多项式
流密码
linear complexity
m-sequences
generalized self-shrinking
characteristic polynomial
stream cipher
