| Fp上pn-周期序列k-错线性复杂度的期望 |
| |
| 引用本文： | 信息工程大学信息工程学院,河南 郑州.Fp上pn-周期序列k-错线性复杂度的期望[J].信息工程大学学报,2007,8(3):257-260. |
| |
| 作者姓名： | 信息工程大学信息工程学院 河南 郑州 |
| |
| 作者单位： | 信息工程大学,信息工程学院,河南,郑州,450002 |
| |
| 摘 要： | 线性复杂度和k-错线性复杂度是衡量密钥流序列随机性的两个重要标准。文章运用广义Chan-Games算法,研究了Fp上pn-周期序列k-错线性复杂度,给出其k-错线性复杂度期望的上、下界。
|
| 关 键 词： | Fp上pn-周期序列 广义Chan-Games算法 k-错线性复杂度 期望 |
| 文章编号： | 1671-0673（2007）03-0257-04 |
| 修稿时间： | 2007-01-15 |
On the Expected Value of the k-Error Linear Complexity for a pn-Periodic Sequence over Fp |
| |
| Institute of Information Engineering,Information Engineering University,Zhengzhou,China.On the Expected Value of the k-Error Linear Complexity for a pn-Periodic Sequence over Fp[J].Journal of Information Engineering University,2007,8(3):257-260. |
| |
| Authors: | Institute of Information Engineering Information Engineering University Zhengzhou China |
| |
| Affiliation: | Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, China |
| |
| Abstract: | Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences.For a pn-periodic sequence over Fp,the upper and lower bounds for the expect value of k-error linear complexity are provided by Generalized Chan-Games algorithm. |
| |
| Keywords: | pn-periodic sequence over Fp the generalized Chan-Games algorithm k-error linear complexity expected value |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《信息工程大学学报》浏览原始摘要信息 |
|
点击此处可从《信息工程大学学报》下载全文 |
