周期为2^n的线性复杂度为2^n-9二元序列的k错线性复杂度分布  

K-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n--9

作　　者：周建钦[1,2] 崔洪成[2] 赵起[2] 

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

出　　处：《苏州科技学院学报（自然科学版）》2012年第1期1-6,12,共7页Journal of Suzhou University of Science and Technology （Natural Science Edition）

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

摘　　要：线性复杂度和k错线性复杂度分别是度量密钥流序列的密码强度和稳定性的重要指标。通过研究周期为2n的二元序列线性复杂度,提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列。基于Games-Chan算法,讨论周期为2n的线性复杂度为2n-9的二元序列的4错线性复杂度分布,并给出了其对应4错线性复杂度序列的计数公式。The linear complexity and the k-error linear complexity of a sequence have been used as important measures of key stream sequence strength and stability. By studying linear complexity of binary sequences with period 2n, it is proposed that the computation of k-error linear complexity should be converted to finding error sequences with minimal Hamming weight. Based on Games-Chan algorithm,4-error linear complexity distribution of 2^n-periodic binary sequences with linear complexity 2^n-9 is discussed, and the complete counting functions on the 4-error linear complexity of 2^n-periodic binary sequences with linear complexity 2^n-9 are presented.

关 键 词：流密码 周期序列 线性复杂度 K错线性复杂度 k错线性复杂度分布 

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