journal6 ›› 2012, Vol. 33 ›› Issue (2): 28-34.DOI: 10.3969/j.issn.1007-2985.2012.02.008

• 计算机 • 上一篇    下一篇

2n周期平衡二元序列的8错线性复杂度

  

  1. (1.安徽工业大学计算机学院,安徽 马鞍山 243002;2.杭州电子科技大学通信工程学院,浙江 杭州 310018)
  • 出版日期:2012-03-25 发布日期:2012-05-28
  • 作者简介:周建钦(1963-),男,山东巨野人,安徽工业大学计算机学院教授,硕士,主要从事通信、密码学与理论计算机科学研究.
  • 基金资助:

    安徽省自然科学基金资助项目(1208085MF106)

8-Error Linear Complexity of 2n-Periodic Balanced Binary Sequences

  1. (1.Computer Science School,Anhui University of Technology,Ma’anshan 243002,Anhui China;2.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China)
  • Online:2012-03-25 Published:2012-05-28

摘要:线性复杂度和k错线性复杂度分别是流密码密钥流序列强度和稳定性的重要度量指标.通过研究周期为2n的二元序列线性复杂度,基于Games-Chan算法,讨论了线性复杂度小于2n的2n-周期二元序列的8错线性复杂度的分布,给出其对应8错线性复杂度为2n-2,2n-3,2n-42n-3-2n-j的原始二元序列计数公式.

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

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.

Key words: periodic sequence, linear complexity, k-error linear complexity, k-error linear complexity distribution

公众号 电子书橱 超星期刊 手机浏览 在线QQ