期刊文献+

随机周期序列k错线性复杂度的方差估计 被引量:3

The Estimated Bounds for the Variance of k-Error Linear Complexity of Random Periodic Sequences
下载PDF
导出
摘要 周期序列的k错线性复杂度是衡量流密码系统的安全性能的一个重要指标 .本文首次给出了随机周期序列k错线性复杂度方差的一个表达公式 ,同时给出了一些情形下的随机周期序列k错线性复杂度方差的上下界的估计和特定情形下的精确结果 . The k error linear complexity of periodic sequences is one of the important security indices of stream cipher systems.A general computation formula for the variance of the k error linear complexity of random periodic sequences is given.Some upper bounds,lower bounds for the variance of the k -error linear complexity of random periodic sequences with certain periods are obtained.Furthermore,the exact value of the variance of the k error linear complexity of a specific random periodic sequence is determined.
作者 苏明 符方伟
出处 《电子学报》 EI CAS CSCD 北大核心 2005年第2期279-283,共5页 Acta Electronica Sinica
基金 国家自然科学基金 (No .60 1 72 0 60 ) 教育部跨世纪优秀人才培养计划基金资助 高等学校骨干教师计划基金
关键词 流密码系统 周期序列 错线性复杂度 期望 方差 stream cipher systems periodic sequences k-error linear complexity expectation variance
  • 相关文献

参考文献4

  • 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.

同被引文献25

  • 1牛志华,白恩健,肖国镇.周期序列线性复杂度与κ-错复杂度的数学期望[J].电子与信息学报,2004,26(11):1787-1791. 被引量:1
  • 2苏明,符方伟.随机周期序列k错线性复杂度的期望上界[J].通信学报,2005,26(2):60-65. 被引量:4
  • 3Fu F,Niederreiter H.The Expectation and Variance of the Joint Linear Complexity of Random Periodic Multisequences[J].Journal of Complexity,2005,21(6):804-822.
  • 4Meidl 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.
  • 5Meidl W,Niederreiter H.The Expected Value of the Joint Linear Complexity of Periodic Multisequences[J].Journal of Complexity,2003,19(1):61-72.
  • 6Meidl W.Linear Complexity,K-error Linear Complexity and the Discrete Fourier Transform[J].Journal of Complexity,2002,18(1):87-103.
  • 7Games R A,Chan A H.A Fast Algorithm for Determining the Complexity of a Pesudo-random seQuence with Period 2n[J].IEEE Trans.on Inform.Theory,1983,29(1):144-146.
  • 8Xiao G,Wei S,Lam K Y,et al.A Fast Algorithm for Determining the Linear Complexity of a Sequence with Period pn over GF(q)[J].IEEE Trans.on Information Theory,2000,46(6):2203-2205.
  • 9Kaida 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].Inform.and Comput,1999,151(1/2):134-147.
  • 10Ding C,Xiao G.The Stability Theory of Stream Ciphers[M].New York:Springer-Verlag,1991:176-179.

引证文献3

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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