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

周期为2~mp^n的二元序列的2-adic复杂度 被引量：1

2-adic complexity of binary sequences with period 2~mp^n
在线阅读 下载PDF
导出
摘要 有理逼近算法的提出,使得序列的2-adic复杂度成为衡量序列安全性的重要指标。对周期为2mpn的二元序列,给出了类似的扩展Games-Chan算法,并且利用这一算法,进一步确定了序列2-adic复杂度的一个有效上界。 The 2-adic complexity of a sequence had been taken an important standard to judge whether a sequence was safe or not, because of rational approximation algorithm. Focusing on the analysis of binary sequences with period 2mpn, provided an anolog of the extended Games-Chan algorithm. And furthermore, a tight upper bound for the 2-adic complexity is determined.
作者 陈兰芳 戚文峰
机构地区 郑州信息工程大学信息工程学院应用数学系
出处 《通信学报》 EI CSCD 北大核心 2005年第6期6-10,17,共6页 Journal on Communications
基金 国家自然科学基金资助项目(60373092) 全国优秀博士学位论文专项基金资助项目(200060)
关键词 二元周期序列 FCSR序列 扩展的Games-Chan算法 2-adic复杂度 periodic binary sequence FCSR sequence extended Games-Chan algorithm 2-adic complexity
分类号 O157.4 [理学—基础数学] TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献2

二级参考文献9

  • 1Klapper, A. , Goresky, M. , 2-adic shift registers, Fast Software Encryption LNCS 809, New York.Springer Verlag, 1994,174-178.
  • 2Klapper, A. , Goresky, M. , Large period nearly deBrujin FCSR sequences, Advances in Cryptology-Eurocrypt 1995 ,LNCS 921 ,New York :Springer Verlag, 1995,263-273.
  • 3Klapper A., Goresky M., Feedback shift registers, 2-adic span, and combiners with memory, J.Cryptology, 1997,10: 111-147.
  • 4Klapper A. , Goresky M. , Arithmetic cross-correlation of FCSR Sequences, IEEE Trans. Infom Theory,1997,36:842-846.
  • 5Goresky,M. ,Klapper A. ,Fourier transforms and the 2-adic span of periodic binary sequences,IEEE Trans. Infom. Theory, 2000,46 (2) : 687-691.
  • 6Rueppel ,R. ,Analysis and Design of Stream Ciphers ,New York:Springer Verlag,1986.
  • 7Seo,C. ,LEE,S. ,Sung,Y. ,et al. ,A lower bound on the linear span of an FCSR,IEEE Trans. Infom.Theory, 2000,46 (2) : 691-693.
  • 8Lidl, R., Niederreiter, H., Finite Fields, Encyclopaedia of mathematics and its applications 20,Combridge ,Cambridge University Press, 1983.
  • 9魏仕民,白国强,肖国镇.确定周期为p^n的二元周期序列的线性复杂度的一个快速算法[J].通信学报,1999,20(8):36-40. 被引量：18

共引文献10

同被引文献13

  • 1A Klapper, M Goresky. Feedback shift registers,2-adic span, and combiners with memory[ J]. J. Cryptology, 1997, 10(2): 111 - 147.
  • 2A Klapper. A survey of feedback with carry shift registers[A]. Sequences and Their Applications-SETA 2004: Third International Conference, LNCS 3486[C]. Seoul, Korea, 2005.56 - 71.
  • 3Francois Amault, Thierry P Berger. F-FCSR: design of a new class of stream cipher[A]. Fast Software Enctyption: 12th International Workshop, FSE 2005, LNCS 3557 [C]. Paris, France, 2005.83 - 97.
  • 4Francois Amault, Thierry P Berger. Design and properties of a new pseudorandom generator based on a filtered FCSR automaton[J]. IEEE Transactions on Computers, 2005,54( 11): 1374 - 1383.
  • 5Francois Amault, Thiery P. Berger, Abdelkadar Necer. Feedback with carry shift registers synthesis with the Euclidean algorithm[J]. IEEE. Trans Information Theory, 2004,50 (5) : 910 - 917.
  • 6Honggang Hu, Dcngguo Fcng. On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences [A]. Sequence and Its Application, SETA 2004, LNCS 3486 [C]. Berlin, Springer-verlag,2005.185 - 196.
  • 7Honggang Hu, Lei Hu, Dengguo Feng. On the expected value of the Joint 2-adic complexity of periodic binary multisequences [A]. Sequence and Its Application, SETA 2006, LNCS 4086 [C]. Berlin, Springer-Verlag, 2006.199 - 208.
  • 8Tian Tian,Wen-Feng Qi. On FCSR memory sequences[ A]. Sequence and Its Application, SETA 2006, LNCS 4086 [ C ]. Berlin, Springer-Verlag, 2006.323 - 333.
  • 9Eliane Jaulmes,Frederic Muller. Cryptanalysis of the F-FCSR stream cipher family [ A ]. Selected areas in cryptography, LNCS 3897[C]. Berlin, Springer-Verlag,2006,20 - 35.
  • 10Wilfried Meidl. Extended Games Chan algorithm for the 2- adic complexity of FCSR-sequences[J]. Theoretical Computer Science, 2003,290(3): 2045 - 2051.

引证文献1

通信学报
2005年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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