苏州科技学院学报：自然科学版2012，Vol.29Issue(1)：1-6,12,7.
司期为2^n的线性复杂度为2^n-9二元序列的k错线性复杂度分布
K-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n--9
摘要
Abstract
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错线性复杂度分布Key words
stream cipher/periodic sequence/linear complexity/k -error linear complexity/k-error linear com-plexity distribution分类
电子信息工程引用本文复制引用
周建钦,崔洪成,赵起..司期为2^n的线性复杂度为2^n-9二元序列的k错线性复杂度分布[J].苏州科技学院学报：自然科学版,2012,29(1):1-6,12,7.基金项目
国家自然科学基金委与中国工程物理研究院联合基金资助项目 （）
浙江省自然科学基金资助项目 （）
上海市信息安全综合管理技术研究重点实验室开放课题 （）
