The linear complexity of new generalized cyclotomic binary sequences of order four

被引：10
作者：
Yan, Tongjiang [1 ,2 ]
Hong, Li [3 ]
Xiao, Guozhen [2 ]
机构：
[1] China Univ Petr, Coll Math & Computat Sci, Dongying 257061, Peoples R China
[2] Xidian Univ, ISN Natl Key Lab, Xian 710071, Peoples R China
[3] China Univ Petr, Coll Comp & Commun Engn, Dongying 257061, Peoples R China
来源：
INFORMATION SCIENCES | 2008年 / 178卷 / 03期
基金：
中国国家自然科学基金;
关键词：
stream ciphers; sequences; generalized cyclotomy; linear complexity; minimal polynomial;
D O I：
10.1016/j.ins.2007.09.012
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Whiteman generalized cyclotomic sequences are proven to exhibit a number of good randomness properties. In this paper we determine the linear complexity of some newly generalized cyclotomic sequences, of order four with period pq which are defined by Ding and Helleseth. The results show that all of these sequences have high linear complexity. (c) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码：807 / 815
页数：9
相关论文
共 16 条
12