k错线性复杂度的分布研究  

Study on the Distribution of k-error Linear Complexity

作　　者：肖维民[1] 张赛[1] 

机构地区：[1]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《吉林师范大学学报（自然科学版）》2016年第2期124-130,共7页Journal of Jilin Normal University:Natural Science Edition

基　　金：国家自然科学基金委员会与中国工程物理研究院联合基金项目(10776077);安徽省自然科学基金项目(1208085MF106)

摘　　要：线性复杂度的复杂程度大小对研究序列密码的安全性是至关重要的,引出了k错线性复杂度的研究.使用构造方法、方体理论研究第一下降点为k=4错的线性复杂度,第二下降点为k=8错的线性复杂度的二元周期序列的分布情况.同时,推导了4错的线性复杂度是第一下降点且8错的线性复杂度是第二下降点的计数公式.事实上,用此方法也可研究k错的线性复杂度第三下降点的序列的分布规律.The linear complexity has been used as important foundation in study the security of sequences cipher,leading to the study of k-error linear complexity. The distribution of binary periodic sequence of k-error linear complexity with first descent point k = 4 and second descent point k = 8 were studied. Finally,the counting functions of binary sequences with 4-error linear complexity as first descent point and 8-error linear complexity as second point were obtained. In fact,the distribution of binary period sequences with the third descent point of k-error linear complexity was studied by the same methods.

关 键 词：线性复杂度 K错线性复杂度 方体理论 周期序列 

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