首页 | 官方网站   微博 | 高级检索  
     

2n周期平衡二元序列的8错线性复杂度
引用本文:周建钦,赵起,崔洪成.2n周期平衡二元序列的8错线性复杂度[J].吉首大学学报(自然科学版),2012,33(2):28-34.
作者姓名:周建钦  赵起  崔洪成
作者单位:(1.安徽工业大学计算机学院,安徽 马鞍山 243002;2.杭州电子科技大学通信工程学院,浙江 杭州 310018)
基金项目:安徽省自然科学基金资助项目
摘    要:线性复杂度和k错线性复杂度分别是流密码密钥流序列强度和稳定性的重要度量指标.通过研究周期为2n的二元序列线性复杂度,基于Games-Chan算法,讨论了线性复杂度小于2n的2n-周期二元序列的8错线性复杂度的分布,给出其对应8错线性复杂度为2n-2,2n-3,2n-4和2n-3-2n-j的原始二元序列计数公式.

关 键 词:周期序列  线性复杂度  k错线性复杂度  k错线性复杂度分布

8-Error Linear Complexity of 2n-Periodic Balanced Binary Sequences
ZHOU Jian-qin,ZHAO Qi,CUI Hong-cheng.8-Error Linear Complexity of 2n-Periodic Balanced Binary Sequences[J].Journal of Jishou University(Natural Science Edition),2012,33(2):28-34.
Authors:ZHOU Jian-qin  ZHAO Qi  CUI Hong-cheng
Affiliation:(1.Computer Science School,Anhui University of Technology,Ma’anshan 243002,Anhui China;2.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China)
Abstract:The linear complexity and the k-error linear complexity of a sequence have been used as the important measurement of keystream sequence strength.By studying linear complexity of binary sequences with period 2n,based on Games-Chan algorithm,8-error linear complexity distribution of 2n-periodic binary sequences with linear complexity less than 2n is discussed.The complete counting functions on 2n-periodic balanced binary sequences with 8-error linear complexity 2n-2,2n-3,2n-4 and 2n-3-2n-j are derived respectively.
Keywords:periodic sequence  linear complexity  k-error linear complexity  k-error linear complexity dis-tribution
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《吉首大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号