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

周期二元序列的部分4-错误序列计数公式
引用本文:周建钦,刘军.周期二元序列的部分4-错误序列计数公式[J].吉首大学学报(自然科学版),2012,33(3):32-35.
作者姓名:周建钦  刘军
作者单位:(1.杭州电子科技大学通信工程学院,浙江 杭州310018;2.安徽工业大学计算机学院,安徽 马鞍山243032)
基金项目:浙江省自然科学基金资助项目
摘    要:k-错线性复杂度是度量密钥流序列的密码强度的一个重要指标.为了更好地刻画和研究序列的随机性,研究了周期为2n的二元序列s的k-错线性复杂度(LCk(s的分布情况,讨论了满足LCks)=LC(s+e)条件下的k-错误序列e的分布情况.基于Games-Chan算法,通过将k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,给出了线性复杂度小于2n的2n周期二元序列的部分4-错误序列的计数公式.

关 键 词:序列密码  线性复杂度  k-错线性复杂度  k-错误序列

On the 4-Error Sequence Distribution of 2^n-Periodic Binary Sequences
ZHOU Jian-qin,LIU Jun.On the 4-Error Sequence Distribution of 2^n-Periodic Binary Sequences[J].Journal of Jishou University(Natural Science Edition),2012,33(3):32-35.
Authors:ZHOU Jian-qin  LIU Jun
Institution:(1.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China;2.Computer Science School,Anhui University of Technology,Ma’anshan 243032,Anhui China)
Abstract:The k-error linear complexity of a sequence has been used as one of the important measure of keystream strength.In order to better depict and study randomicity of sequences,the k-error sequences(e) distribution that corresponds with LCk(s)=LC(s+e) is discussed by studying the distribution of k-error linear complexity of binary sequences(s) with period 2n.Based on Games-Chan algorithm,it is proposed that the computation of k-error linear complexity should be converted to finding error sequences with minimal Hamming weight.For k=4,some the counting functions on the k-error sequences of 2n-periodic binary sequences with linear complexity less than 2n are derived.
Keywords:stream cipher  linear complexity  k-error linear complexity  k-error sequences
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《吉首大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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