期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

确定周期序列k错线性复杂度的一个快速算法 被引量：8

An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences
在线阅读 下载PDF
导出
摘要 文中提出GF(q)上计算周期为 2pn 的序列k 错线性复杂度的一个快速算法 (这里p和q是素数 ,并且q是一个模p2 的本原根 ) .新算法的计算复杂度为O(N) (这里N是序列的周期 ) . An efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q)is presented,where p and q are primes,and q is a primitive root of modulo p2.It is a generalization of an algorithm for determining the linear complexity of a sequence with period 2pn presented by Wei,Xiao and Chen.The computation complexity of the new algorithm is O(N),where N is the period of the sequence.
作者 魏仕民
机构地区 淮北煤炭师范学院计算机科学与技术系
出处 《电子学报》 EI CAS CSCD 北大核心 2004年第5期705-708,共4页 Acta Electronica Sinica
基金 国家自然科学基金(No.60172015) 安徽省自然科学基金(No.03042204) 安徽省教育厅自然科学研究计划项目(No.2004kj317) 国家重点基础研究规划发展项目(No.G1999035804)
关键词 流密码 序列 线性复杂度 K-错线性复杂度 stream cipher sequence linear complexity k-error linear complexity
分类号 TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献9

  • 1Ding C,Xiao G,Shan W.The Stability Theory of Stream Ciphers[M].Lecture Notes in Computer Science Vol.561.Berlin/Heidelberg,Germany:Springer-Verlag,1991.
  • 2Stamp M,Martin C F.An algorithm for k-error linear complexity of binary sequences with period 2n[J].IEEE Trans on Inform.Theory,1993,39(4):1398-1401.
  • 3Games R A,Chan A H.A fast algorithm for determining the complexity pseudo-random sequence with period 2n[J].IEEE Trans on Information Theory,29(1):144-146.
  • 4Kaida T,Uehara S,Imamura K.An algorithm for the k-error linear complexity of sequences over GF(pm)with period pn,p a prime[J].Information and Computation,1999,151(1):134-147.
  • 5Wei S,Chen Z,Xiao G.A fast algorithm for k-error linear complexity of a binary sequence[A].Zhong Y X,Zhao Q.2001 International Conferences on Info-tech and Info-net Proceedings[C].IEEE Press,2001.No Conference E,152-157.
  • 6Wei S,Xiao G,Chen Z.An efficient algorithm for k-error linear complexity[J].Chinese Journal of Electronics,2002,11(2):265-267.
  • 7Wei S,Xiao G,Chen Z.A fast algorithm for determining the minimal polynomial of a sequence with period 2pn over GF(q)[J].IEEE Trans on Information Theory,2002,48(10):2754-2758.
  • 8冯登国,肖国镇.序列的周期稳定性的新度量指标[J].电子学报,1994,22(4):86-89. 被引量：5
  • 9陈克非.序列的d-复杂度[J].电子学报,1989,17(1):112-113. 被引量：3

二级参考文献1

  • 1Ding C，The stability theory of stream ciphers，1991年

共引文献5

同被引文献32

  • 1白恩健,刘晓娟,肖国镇.确定周期为P^n的二元序列k-错复杂度曲线的快速算法[J].通信学报,2004,25(10):1-7. 被引量：4
  • 2赵耀东,戚文峰.二元周期序列的k错误线性复杂度[J].电子学报,2005,33(1):12-16. 被引量：5
  • 3冯登国,肖国镇.序列的周期稳定性的新度量指标[J].电子学报,1994,22(4):86-89. 被引量：5
  • 4周建钦.求周期序列线性复杂度的快速算法[J].华中科技大学学报（自然科学版）,2007,35(2):43-46. 被引量：5
  • 5Stamp M, Martin C F. An Algorithm for K - error Linear Com- plexity of Binary Sequences with Period 2 [ J]. IEEE Trims on Inform. Theory,1993,39(4) :1398 - 1401.
  • 6Games R A , Chart A H. A Fast Algorithm for Determining the Complexity Pseudo -random Sequence with Period 2n [ J]. IEEE Trans on Information Theory ,1983 29 (1) :144 - 146.
  • 7Stamp M,Martin C F.An Algorithm for The k-error Linear Complexity of Binary Sequences with Period 2n[J].IEEE Trans.on Information Theory,1993,39(4):1398-1401.
  • 8Ding C,Xiao G,Shan W.The Stability Theory of Stream Ciphers[M].Lecture Notes in Computer Science.Berlin:Springer-Verlag,1991.
  • 9Kurosawa K,Sato F,Sakata T,et al.A Relationship Between Linear Complexity and k-error Linear Complexity[J].IEEE Trans.on Information Theory,2000,46(2):694-698.
  • 10Meidl W.How Many Bits Have to Be Changed to Decrease the Linear Complexity[J].Design Codes and Crytography,2004,33(2):109-122.

引证文献8

二级引证文献11

电子学报
2004年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部