二元序列的错误线性复杂度性质  

Properties of Error Linear Complexity of Binary Sequences

作　　者：常祖领[1,2] 王宁[3] 

机构地区：[1]郑州大学数学与统计学院,河南郑州450001 [2]福建师范大学福建省网络安全与密码技术重点实验室,福建福州350007 [3]中原工学院理学院,河南郑州450007

出　　处：《郑州大学学报（理学版）》2016年第1期32-36,40,共6页Journal of Zhengzhou University:Natural Science Edition

基　　金：国家自然科学基金联合基金资助项目(u1301604);河南省教育厅科学技术研究重点项目(14A110022);福建省网络安全与密码技术重点实验室(福建师范大学)开放课题(15005)

摘　　要：详细研究了二元2的幂次周期序列的错误线性复杂度的性质.利用Games-Chan算法作为基本工具,详细分析了2的幂次周期并且严格点少的二元序列的密码学性质.给出了具有两个严格点的序列的详细性质以及具有三个严格点的序列的结构.The properties of error linear complexity of binary sequences with period power of 2 were studied. With Games-chan algorithm as the main tool,the cryptographic properties of binary sequences with period power of 2 and few critical points were considered. The properties of sequences with two critical points and the structure of sequences with three critical points were provided.

关 键 词：二元序列 Games-Chan算法 错误线性复杂度 严格点 

分 类 号：TN918.1[电子电信—通信与信息系统]