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

周期为2^n的二元序列的整体稳定性
引用本文:李鹤龄,戚文峰. 周期为2^n的二元序列的整体稳定性[J]. 计算机工程, 2009, 35(10): 152-154
作者姓名:李鹤龄  戚文峰
作者单位:解放军信息工程大学信息工程学院,郑州,450002
基金项目:国家自然科学基金,国家高技术研究发展计划(863计划) 
摘    要:讨论周期为2^n的二元序列k-错误线性复杂度问题。周期为2^n的二元序列线性复杂度严格大于2^n-1。从二元周期序列的整体稳定性开始给出最小的k,使得全体周期为2^n的二元序列中至少有一半序列的k-错误线性复杂度不大于2^n-1。对全体周期为2^n的平衡序列和非平衡序列分别进行研究,给出相应最小的k。

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

Entire Stability of Binary Sequences with Period 2n
LI He-ling,QI Wen-feng. Entire Stability of Binary Sequences with Period 2n[J]. Computer Engineering, 2009, 35(10): 152-154
Authors:LI He-ling  QI Wen-feng
Affiliation:School of Information Engineering;PLA Information Engineering University;Zhengzhou 450002
Abstract:This paper studies the k-error linear complexity of binary sequences with period 2n.It is well known that the linear complexity of binary sequences with period 2n is strictly larger than 2n-1.Form the entire stability of binary periodic sequences,the minimal value k is given for which there are at least half of the sequences with period 2n have k-error linear complexity not larger than 2n-1.The minimal value k is studied for balanced sequences and imbalanced sequences with period 2n respectively.
Keywords:stream cipher  linear complexity  k-error linear complexity  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号