首页 | 本学科首页   官方微博 | 高级检索  
     

2n-周期二元序列的3-错误序列分布
引用本文:周建钦,刘军.2n-周期二元序列的3-错误序列分布[J].电子与信息学报,2012,34(8):1923-1927.
作者姓名:周建钦  刘军
作者单位:杭州电子科技大学通信工程学院;安徽工业大学计算机学院
基金项目:浙江省自然科学基金(Y1100318);安徽省自然科学基金(1208085MF106)资助课题
摘    要:线性复杂度和k- 错线性复杂度是度量密钥流序列密码强度的重要指标。为了更好地研究序列的随机性,该文通过将序列的k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,讨论了序列不同k-错线性复杂度条件下对应的k-错误序列的分布情况。基于Games-Chan算法,该文给出了线性复杂度为2n的2n-周期二元序列的3错误序列的计数公式,计算机编程验证了该文方法的正确性。

关 键 词:序列密码    线性复杂度    k-错线性复杂度    k-错误序列
收稿时间:2011-12-12

On the 3 error Sequence Distribution of 2~n- periodic Binary Sequences
Zhou Jian-qin Liu Jun.On the 3 error Sequence Distribution of 2~n- periodic Binary Sequences[J].Journal of Electronics & Information Technology,2012,34(8):1923-1927.
Authors:Zhou Jian-qin Liu Jun
Affiliation:Zhou Jian-qin①② Liu Jun① ①(Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China) ②(Computer Science School,Anhui University of Technology,Ma’anshan 243032,China)
Abstract:The linear complexity and the k.-error linear complexity of a sequence are used as important measures of keystream strength.By studying linear complexity of binary sequences with period,it is proposed that the computation of k.-error linear complexity can be converted to finding error sequences with minimal Hamming weight.In order to study sequence randomness,the k.-error sequences distribution that corresponds with the k.-error linear complexity of sequence is discussed.Based on Games-Chan algorithm,for,the counting functions on the k.-error sequences of periodic binary sequences with linear complexity 2~n- are derived and the effectiveness is proved with computer programming.
Keywords:Stream cipher  Linear complexity  k-error linear complexity  k-error sequences
本文献已被 CNKI 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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