2p^n周期二元序列稳定性的进一步分析  

Further Analysis of Stability for 2p^n Periodic Binary Sequences

作　　者：朱凤翔[1] 戚文峰[1] 

机构地区：[1]郑州信息工程大学应用数学系,郑州450002

出　　处：《计算机工程》2007年第3期4-5,11,共3页Computer Engineering

基　　金：全国优秀博士学位论文专项基金资助项目(200060);国家自然科学基金资助项目(60373092)

摘　　要：序列的线性复杂度与k-错线性复杂度是度量密钥序列伪随机性的两个重要指标。在p(p>3)为奇素数且2是模p2本原根的情况下,对于周期为2pn的二元序列,文章进一步分析了满足k-错线性复杂度严格小于序列复杂度的k的最小值的上界,并指出当周期为2p(p>3)时,在大多数情况下可以达到该上界。Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences. In this paper, for the period length 2p^n（p〉3）, where p is an odd prime and 2 is a primitive root modulo p2 the upper bound on the minimum value k for which the k-error linear complexity is strictly less than the linear complexity is further analyzed and this upper bound can be reached mostly for the period length 2p is proved.

关 键 词：序列密码 线性复杂度 K-错线性复杂度 

分 类 号：TN918.1[电子电信—通信与信息系统]