期刊文献+

一个计算指数周期序列的所有跃点的算法 被引量:1

An algorithm for computing all the critical points of exponent periodic sequences
下载PDF
导出
摘要 周期序列的k错线性复杂度是衡量流密码系统安全性能的一个重要指标,k错线性复杂度的值随着k值的增加呈下降趋势,其中发生严格下降的点称为跃点.这里关注有限域GF(pm)上的pn周期序列,p是任意素数,讨论了该类序列的k错线性复杂度的性质,同时给出了一个算法:对于任意给定的序列,计算出其包含的所有跃点. The k-error linear complexity of periodic sequences is an important security indice of stream cipher systems.The k-error linear complexity decreases as the number of errors k increases,that the critical points are those where a decrease occurs in the k-error linear complexity.The pn periodic sequences over the finite field GF(p^m)were focused upon,where pis a prime.Some properties of the k-error linear complexity were discussed,and an algorithm was presented for computing all the critical points for a given sequence.
作者 唐淼 王菊香 TANG Miao;WANG Juxiang(Department of Applied Mathematics, Anhui Agricultural University, Hefei 230036, China;School of Mathematics and Physics, Anhui J ianzhu University, Hefei 230601, China)
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2018年第2期105-110,共6页 JUSTC
基金 安徽省高校自然科学研究项目重点项目(KJ2017A136) 安徽省高校优秀青年人才支持计划重点项目(gxyqZD2016032) 安徽省教育厅自然科学基金一般项目(KJ2015JD18)资助
关键词 流密码 周期序列 K错线性复杂度 跃点 stream cipher periodic sequence k-error linear complexity critical point
  • 相关文献

参考文献5

二级参考文献30

  • 1Zhu Fengxiang Qi Wenfeng.THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1[J].Journal of Electronics(China),2007,24(3):390-395. 被引量:21
  • 2DING C S,XIAO G Z.SHAN W J.The Stability Theory of Stream Ciphers[M].Berlin:Springer-Verlag,1991.
  • 3STAMP M,MARTIN C E An algorithm for the k-error linear oomplexity of binary sequences with period 2'[J].IEEE Trans on Informalion Theory,1993,39(4):1398-1401.
  • 4KUROSAWA K,SATO F,IMAMURA T.A relationship between linear complexity and k-error linear complexity[J].IEEE Trans on Information Theory,2000,46(2):694-698.
  • 5ALY H,WINTERHOF A.On the Kerror linear complexity over Fp of legendre and sidelnikov sequences[J].Designs,Codes and Cryptography,2006,40(3):369-374.
  • 6EUN Y,SONG H,KYUREGHYAN G M.One-error linear complexity over Fp of sidelnikov sequences[A].Sequences and their Applications'04[C].Lecture Notes in Computer Sciences,2005,154-165.
  • 7IMAMURA K,MORIUCHI T.A fast algorithm for determining the linear complexity of P-ary sequence with period pn,P a prime[J].IEICE Tech Pep,1993,93(75):73-78.
  • 8UEHARA S.IMAMURA K,Linear complexity periodic sequences tion[J].IEICE Trans on Fundamentals,1996,79(10):1739-1740.tion[J].IEICE Trans on Fundamentals,1996,79(10):1739-1740.
  • 9NIEDERREITERH.The linear complexity profile and the jump complexty of keystream sequences[A].Advances in CryptologyEUROCRYPT'90[C].Lecture Notes in Computer Science,Berlin:Springer-Verlag,1991.473:174-188.
  • 10HAN Y K,CHUNG J H.YANG K.On the k-error linear complexity of pm-periodic binary sequences[J].IEEE Trans on Information Theory,2007,53(6):2297-2304.

共引文献12

同被引文献14

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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