journal6 ›› 2012, Vol. 33 ›› Issue (3): 32-35.DOI: 10.3969/j.issn.1007-2985.2012.03.009

• 计算机 • 上一篇    下一篇

周期二元序列的部分4-错误序列计数公式

  

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

    浙江省自然科学基金资助项目(Y1100318;R1090138)

On the 4-Error Sequence Distribution of 2n-Periodic Binary Sequences

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

摘要:k-错线性复杂度是度量密钥流序列的密码强度的一个重要指标.为了更好地刻画和研究序列的随机性,研究了周期为2n的二元序列s的k-错线性复杂度(LCk(s的分布情况,讨论了满足LCks)=LC(s+e)条件下的k-错误序列e的分布情况.基于Games-Chan算法,通过将k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,给出了线性复杂度小于2n的2n周期二元序列的部分4-错误序列的计数公式.

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

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 sequencesedistribution that corresponds with LCk(sLC(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.

Key words: stream cipher, linear complexity, k-error linear complexity, k-error sequences

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