周期为2p^n的q元序列m紧错线性复杂度  

m-Tight Error Linear Complexity of Sequences with Period 2p^n over GF(q)

作　　者：周建钦[1,2] 上官成[2] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018 [2]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《吉首大学学报（自然科学版）》2011年第6期27-32,共6页Journal of Jishou University(Natural Sciences Edition)

基　　金：浙江省自然科学基金资助项目(Y1100318;R1090138);国家自然科学基金委员会与中国工程物理研究院联合基金资助(10776077);上海市信息安全综合管理技术研究重点实验室开放课题(AGK2009007)

摘　　要：结合k错线性复杂度曲线和最小错误的理论,提出m紧错线性复杂度的概念来研究序列线性复杂度的稳定性.首先优化魏-肖-陈算法的结构,即GF(q)上求周期为2pn的q元序列线性复杂度的快速算法;然后通过采用联合代价的方法,给出一个GF(q)上求周期为2pn的q元序列k错线性复杂度的快速算法;接着给出周期为2pn的q元序列的m紧错线性复杂度快速算法,其中p和q是奇素数,q为模p2的一个本原根.Using the theories of the minimum error and the k-error linear complexity profile of sequences,m-tight error linear complexity is presented to study the stability of the linear complexity of sequences.First,the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences with period 2pn over GF(q) is optimized,where p and q are odd primes and q is a primitive root(mod p2).Second,the union cost is used,so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q) is derived,where p and q are odd primes and q is a primitive root(mod p2).Finally,an efficient algorithm for computing m-tight error linear complexity of sequences with period 2pn over GF(q) is given,where p and q are odd primes and q is a primitive root(mod p2).

关 键 词：流密码 序列 线性复杂度 K错线性复杂度 m紧错线性复杂度 

分 类 号：TN91[电子电信—通信与信息系统]