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

周期序列线性复杂度的k位置错误谱 被引量：3

k Positions Error Spectrum of Linear Complexity for Periodic Sequences
下载PDF
导出
摘要 周期序列的线性复杂度是衡量流密码系统安全性能的一个重要指标。事实表明周期序列中的若干位置上值的变化会影响改变后的周期序列的线性复杂度。基于此点该文提出了周期序列的线性复杂度k位置错误谱的概念以便于追踪错误位置对线性复杂度的影响。特别是对周期为2n的二元序列,发现了这类序列线性复杂度的1位置错误谱的周期并且给出了具有同样图像谱特征的序列数目。并把结果推广到了定义在Fp上周期为pn的序列上。 The linear complexity of periodic sequences is an important security index of stream cipher systems. It is noticeable that the linear complexity of a periodic sequence will be influenced when the values in some positions change. According to this, this paper proposes the concept of the k positions error spectrum to trace this influence on the linear complexity. Especially for 2＂ -periodic binary sequences, the periods of the lposition error spectrum for this kind of sequences are discovered and the number of the sequences with the same characteristic of the spectrum is given. These results are generalized to pn-periodic sequences over Fp.
作者 苏明
机构地区 南开大学信息技术科学学院
出处 《计算机工程》 CAS CSCD 北大核心 2007年第22期1-3,共3页 Computer Engineering
关键词 流密码 周期序列 线性复杂度 K错线性复杂度 k位置错误谱 stream cipher periodic sequence linear complexity k error linear complexity k positions error spectrum
分类号 TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献15

  • 1Cusick T W,Ding C,Renvall A.Stream Ciphers and Number Theory[M].North-Holland:Elsevier,1998.
  • 2Ding Cunsheng,Xiao Guozhen,Shan Weijuan.The Stability Theory of Stream Ciphers[C]//Lecture Notes in Computer Science,561,New York/Berlin:Springer-Verlag,1991:176-179.
  • 3Meidl W,Niederreiter H.On the Expected Value of the Linear Complexity and the k-Error Linear Complexity of Periodic Sequences[J].IEEE Trans.on Information Theory,2002,48(11):2817-2825.
  • 4Meidl W,Niederreiter H.Linear Complexity.k-Error Linear Complexity,and the Discrete Fourier Transform[J].J.Complexity,2002,18(1):87-103.
  • 5苏明,符方伟.随机周期序列k错线性复杂度的期望上界[J].通信学报,2005,26(2):60-65. 被引量：4
  • 6苏明,符方伟.随机周期序列k错线性复杂度的方差估计[J].电子学报,2005,33(2):279-283. 被引量：3
  • 7Fu Fangwei,Niederreiter H,Su Ming.The Expectation and Variance of the Joint Linear Complexity of Random Periodic Multisequences[J].J.Complexity,2005,21(6):804-822.
  • 8Su Ming.The Distribution of the Complexity for Periodic Sequences[D].天津:南开大学,2004.
  • 9Fu Fangwei,Niederreiter H,Su Ming.The Characterization of 2n -periodic Binary Sequences with Fixed 1-error Linear Complexity[C]//Proc.of the 4th International Conference on Sequences and Their Applications.2006.
  • 10Su Ming,Chen L.The Properties of the 1-error Linear Complexity of pn -periodic Sequences over Fp[C]//Proc.of 2006 IEEE International Symposium on Information Theory.2006.

二级参考文献11

  • 1M Stamp,C F Martin.An algorithm for the k-error linear complexity of binary sequences with period 2n[J].IEEE Trans Information Theory,1993,39:1398-1401.
  • 2W Meidl.Linear complexity,k-error linear complexity,and the discrete fourier transform[J].J Complexity,2002,118:87-103.
  • 3W Meidl,H Niederreiter.On the expected value of the linear complexity and the k-error linear complexity of periodic sequences[J].IEEE Trans Information Theory,2002,48(11):2817-2825.
  • 4H Niederreiter.Periodic sequences with large k-error linear complexity[J].IEEE Trans Information Theory,2003,49:501-505.
  • 5STAMP M, MARTIN C F. An algorithm for the k-error linear complexity of binary sequences with period 2n [J]. IEEE Trans Information Theory, 1993, 39(7): 1398-1401.
  • 6MEIDL W. Linear complexity, k-error linear complexity, and the discrete fourier transform[J]. J Complexity, 2002, 18(1): 87-103.
  • 7MEIDL W, NIEDERREITER H. On the expected value of the linear complexity and the k-error linear complexity of periodic sequences[J].IEEE Trans Information Theory, 2002, 48(11): 2817-2825.
  • 8NIEDERREITER H. Periodic sequences with large k-error linear complexity[J]. IEEE Trans Information Theory, 2003, 49(2): 501-505.
  • 9XIAO G, WEI S, LAM K Y, lMAMURA K. A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q) [J]. IEEE Trans Information Theory, 2000, 46(9): 2203-2205.
  • 10ROMANS. Coding and Information Theory[M]Springer-Verlag, 1992. 171.

共引文献4

同被引文献23

  • 1Meidl W, Niederreiter H.On the excepted value of the linear complexity and the k-error linear complexity of periodic sequences [J]. IEEE Trans on Information Theory,2002,48(11):2817-2825.
  • 2Fu Fangwei, Niederreiter H, Su Ming. The expectation and variance of the joint linear complexity of random periodic multisequences [J].J Complexity, 2005,21 (6):804-822.
  • 3Meidl W. On the stability of 2^n -periodic binary sequences [J]. IEEE Trans on Information Theory,2005,51 (3): 1151-1155.
  • 4Kurosawa 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.
  • 5Su Ming, Chen L.The properties of the 1-error linear complexity of p^n-periodic sequences over Fp[C].Proc of IEEE International Symposium on Information Theory,2006:40-50.
  • 6Su Ming,Chen L.The properties of the 1-error linear complexity ofpn -periodic sequences over Fp[C].Proc oflEEE International Symposium on Information Theory, 2006:103-123.
  • 7Lauder A G B,Paterson K G.Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/[J]. IEEE Trans on Information Theory, 2003,49(1):273-280.
  • 8Salagean A.On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two[J]. IEEE Trans on Information Theory,2005,51 (3): 1145-1150.
  • 9Ding Cunsheng, Xiao Guozhen, Shan Weijuan. The Stability Theory of Stream Ciphers[M]. Berlin, Germany: Springer-Verlag, 1991: 176-179.
  • 10Games R A, Chart A H. A Fast Algorithm for Determining the Complexity of A Binary Sequence with Period 2n[J]. IEEE Trans. on Information Theory, 1983, 29(1): 144-146.

引证文献3

二级引证文献3

计算机工程
2007年 第22期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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