THE 2-ERROR LINEAR COMPLEXITY OF 2^n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2^n -1 |
| |
作者姓名: | Zhu Fengxiang Qi Wenfeng |
| |
作者单位: | Department of Applied Mathematics, Zhengzhou Informatin Engineering University, Zhengzhou 450002, China |
| |
基金项目: | Supported by the National Natural Science Foundation of China (No.60373092). |
| |
摘 要: | Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.
|
关 键 词: | 2-误差线性复杂性 周期二进制序列 k-误差线性复杂性 线性反馈移位寄存器 流密码 |
收稿时间: | 4 January 2006 |
修稿时间: | 2006-01-042006-06-19 |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息 |
|
点击此处可从《电子科学学刊(英文版)》下载全文 |