摘要
线性复杂度是衡量密钥流序列安全性的重要参数。该文考察了有限域上n级本原σ-LFSR序列的线性复杂度性质。首先得到了它的上下界并证明了界是紧致的,然后利用序列的根表示给出了计算本原σ-LFSR序列线性复杂度的方法。
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.
出处
《电子与信息学报》
EI
CSCD
北大核心
2009年第12期2897-2900,共4页
Journal of Electronics & Information Technology
基金
国家863计划项目(2006AA01Z425)
国家自然科学基金(90704003)资助课题
关键词
序列密码
本原σ-线性反馈移位寄存器
线性复杂度
根表示
Stream cipher
Primitive σ-LFSR（Linear Feedback Shift Register）
Linear complexity
Root representation
