| 本原σ-LFSR序列的线性复杂度研究 |
| |
| 引用本文： | 刘向辉,曾光,韩文报.本原σ-LFSR序列的线性复杂度研究[J].电子与信息学报,2009,31(12):2897-2900. |
| |
| 作者姓名： | 刘向辉 曾光 韩文报 |
| |
| 作者单位： | 解放军信息工程大学信息工程学院,郑州,450002 |
| |
| 基金项目： | 国家863计划项目，国家自然科学基金(90704003)资助课题 |
| |
| 摘 要： | 线性复杂度是衡量密钥流序列安全性的重要参数。该文考察了有限域上n级本原σ-LFSR序列的线性复杂度性质。首先得到了它的上下界并证明了界是紧致的，然后利用序列的根表示给出了计算本原σ-LFSR序列线性复杂度的方法。
|
| 关 键 词： | 序列密码 σ-本原线性反馈移位寄存器 线性复杂度 根表示 |
| 收稿时间： | 2008-12-15 |
| 修稿时间： | 2009-4-27 |
Research on Linear Complexity of Primitive σ-LFSR Sequences |
| |
| Liu Xiang-hui,Zeng Guang,Han Wen-bao.Research on Linear Complexity of Primitive σ-LFSR Sequences[J].Journal of Electronics & Information Technology,2009,31(12):2897-2900. |
| |
| Authors: | Liu Xiang-hui Zeng Guang Han Wen-bao |
| |
| Affiliation: | Information Engineering Institute, PLA Information Engineering University, Zhengzhou 450002, China |
| |
| Abstract: | Linear complexity is an important parameter of sequences’ security. In this paper, the linear complexity properties of primitive σ-LFSR sequences are studied. Firstly, the bounds of the linear complexity for one n stages primitive σ-LFSR sequence is given and it is proved that the bounds are tight; then, with the tool of root representation, a method to get the linear complexity of one primitive LFSR sequence is obtained. |
| |
| Keywords: | Stream cipher Primitive LFSR(Linear Feedback Shift Register) Linear complexity Root representation |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
