| 司期为2^n的线性复杂度为2^n-9二元序列的k错线性复杂度分布 |
| |
| 引用本文： | 周建钦,崔洪成,赵起.司期为2^n的线性复杂度为2^n-9二元序列的k错线性复杂度分布[J].苏州科技学院学报(自然科学版),2012,29(1):1-6,12. |
| |
| 作者姓名： | 周建钦 崔洪成 赵起 |
| |
| 作者单位： | 1. 杭州电子科技大学通信工程学院,浙江杭州310018／安徽工业大学计算机学院,安徽马鞍山243002
2. 安徽工业大学计算机学院,安徽马鞍山,243002 |
| |
| 基金项目： | 国家自然科学基金委与中国工程物理研究院联合基金资助项目，浙江省自然科学基金资助项目，上海市信息安全综合管理技术研究重点实验室开放课题 |
| |
| 摘 要： | 线性复杂度和k错线性复杂度分别是度量密钥流序列的密码强度和稳定性的重要指标。通过研究周期为2^n的二元序列线性复杂度．提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列。基于Games-Chan算法．讨论周期为2^n的线性复杂度为2^n-9的二元序列的4错线性复杂度分布，并给出了其对应4错线性复杂度序列的计数公式。
|
| 关 键 词： | 流密码 周期序列 线性复杂度 庇错线性复杂度 k错线性复杂度分布 |
K-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n--9 |
| |
| ZHOU Jianqin,CUI Hongcheng,ZHAO Qi.K-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n--9[J].Journal of University of Science and Technology of Suzhou,2012,29(1):1-6,12. |
| |
| Authors: | ZHOU Jianqin CUI Hongcheng ZHAO Qi |
| |
| Affiliation: | 1.College of Telecommunication,Hangzhou Dianzi University,Hangzhou 310018,China;2.College of Computer Science and Technology,Anhui University of Technology,Ma’anshan 243002,China) |
| |
| 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 2n-periodic binary sequences with linear complexity 2n-9 is discussed,and the complete counting functions on the 4-error linear complexity of 2n-periodic binary sequences with linear complexity 2n-9 are presented. |
| |
| Keywords: | stream cipher periodic sequence linear complexity k -error linear complexity k-error linear com-plexity distribution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
