本原-LFSR序列的线性复杂度研究
doi: 10.3724/SP.J.1146.2008.01701
Research on Linear Complexity of Primitive -LFSR Sequences
-
摘要: 线性复杂度是衡量密钥流序列安全性的重要参数。该文考察了有限域上n级本原-LFSR序列的线性复杂度性质。首先得到了它的上下界并证明了界是紧致的，然后利用序列的根表示给出了计算本原-LFSR序列线性复杂度的方法。
-
关键词:
- 序列密码 /
- -本原线性反馈移位寄存器 /
- 线性复杂度 /
- 根表示
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. -
计量
- 文章访问数: 3360
- HTML全文浏览量: 92
- PDF下载量: 606
- 被引次数: 0
下载:
