作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (4): 150-151. doi: 10.3969/j.issn.1000-3428.2010.04.052

• 安全技术 • 上一篇    下一篇

6阶W-广义割圆序列的线性复杂度

李淑清1,闫统江2   

  1. (1. 中国石油大学计算机与通信工程学院,东营 257061;2. 中国石油大学数学与计算科学学院,东营 257061)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-02-20 发布日期:2010-02-20

Linear Complexity of Sextic Whiteman Generalized Cyclotomic Sequences

LI Shu-qing1, YAN Tong-jiang2   

  1. (1. College of Computer and Communication Engineering, China University of Petroleum, Dongying 257061;2. College of Mathematics and Computational Science, China University of Petroleum, Dongying 257061)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-02-20 Published:2010-02-20

摘要: 在所有周期为pq的2k阶W-广义割圆序列的线性复杂度都已经得到准确计算的基础上,考虑周期为pq的6阶W-广义割圆序列的线性复杂度。结果表明这类序列的线性复杂度的下界是 。从密码学的角度看,多数的二元W-广义割圆序列具有良好的线性复杂度性质,以它们做密钥流序列的密码系统具有很强的抵抗B-M算法攻击的能力。

关键词: 流密码, 割圆类, 割圆序列, 线性复杂度

Abstract: This paper considers the linear complexity of binary sextic Whiteman generalized cyclotomic sequences with period pq. Results show that the lower bound of their linear complexity is . From the viewpoint of stream cipher cryptosystems, almost all these sequences have good linear complexity. They can resist attacks from the application of the Berlekamp-Massey algorithm.

Key words: stream cipher, cyclotomic class, cyclotomic sequences, linear complexity

中图分类号: