期刊文献+

计算几类周期序列的最小周期 被引量:2

Least Periods Computing of Some Classes of Periodic Sequences
原文传递
导出
摘要 在流密码中,周期序列的周期是一个重要指标。在周期序列的线性复杂度相同的情况下,序列的最小周期越大越好。我们证明,如果由一个非退化组合函数Fn所组合的n个周期序列的”个最小周期两两互素,则由Fn所产生的输出序列的最小周期达到最大值。笔者推出的另一个好的主要的结果是,如果由一个非退化组合函数Fn所组合的n个GF(2)上最大长度线性反馈移位寄存器的长度是不同的且大于2,则由Fn所产生的输出序列的最小周期也达到最大值。最后我们给山一个后例,它表明第二个结果对非二元域不成立。 In stream cipher, the period of periodic sequence is an important measure. Under the condition that linear complexities of periodic sequences are equal, the larger the least periods of these sequences, the better. It is proved that if n least periods of nperiodic sequences combined by a non-degenerate combining function Fn are pairwise relatively prime, the least period of the output sequence produced by Fnattains maximal value.Another principal result derived in this paper is that if the lengths ofnmaximum-length GF(2) LFSR' s combined by a non degenerate combining function Fn are different and greater than two, the least period of the output sequence produced by Fnalso attains maximal value. Finally, an example shows that the second result is not true for non-binary fields.
出处 《信息安全与通信保密》 2009年第8期260-264,267,共6页 Information Security and Communications Privacy
关键词 周期序列 最小周期 线性反馈移位寄存器 非退化组合生成器 非退化组合函数 极小多项式 多项式的阶 元素的阶 periodic sequence the least period LFSR(linear feedback shift register) non-degenerate combination generator non-degenerate combining function minimal polynomial order of polynomial order of element
  • 相关文献

参考文献5

  • 1Lidl R, Niederreiter H. Finite Fields[M]. [s.l.]: Addison- Wesley Publishing Company, 1983.
  • 2Rueppel R A. Analysis and Design of Stream Ciphers[M]. Berlin:Springer Verlage, 1986.
  • 3Rueppel R A, Staffelbach O J. Products of Linear Recurring sequences with Maximum Complexity[J].IEEE Trans. On Information Theory, Jan.,1987, It-33(1):124-131.
  • 4董文军,李云强.FCSR的研究现状和发展[J].信息安全与通信保密,2007,29(8):9-11. 被引量:2
  • 5沈静,杜育松,王大星.RC4及其密钥流区分器[J].信息安全与通信保密,2006,28(12):182-183. 被引量:2

二级参考文献20

  • 1[1]Alfred J Menezes,Paul C van Oorschot,Scott A Vanstone.Handbook of Applied Cryptography.New York:CRC Press,1996,192-195.
  • 2[3]Itsik Mantin,Adi Shamir.A practical attack on broadcast RC4 Fast Software Encryption.Lecture Notes in Computer Science:Fast Software Encryption,2002,(2355):152-164.
  • 3[4]R Wash.Lecture Notes on Stream Ciphers and RC4.http://acm.cwru.edu/files/.2002.
  • 4[1]Klapper A,Goresky M.2-Aidc Shift Registers[A].Fast Software Encryption:Proceedings of 1993 Cambridge Algorithms Workshop,LNCS 809,Springer Verlag,1994,174~178.
  • 5[2]Klapper A,Goresky M.Feedback Shift Registers,2-adic Span,and Combiners with Memory[J].Journal of Cryptology,1997,10(2):111~147.
  • 6[3]Klapper A,Goresky M.Large period nearly de Bruijn sequences[A].Advances in Cryptology-Eurocrypt' 95[C].1995,263~273.
  • 7[4]Klapper A,Goresky M.Arithmetic Cross-Correlation of FCSR Sequences[J].IEEE Trans.Info.Theory,1997,43(4):1342~1346.
  • 8[5]QI W F,XU H..Partial period distribution of FCSR sequence[J].IEEE Trans Inform Theory,2003,49(3):761~765.
  • 9[6]Goresky M,Klapper A,Murty R.Shparlinski I.On decimations of 1-sequence.SIAM J.Discr.Math,2004,(18):130~140.
  • 10[7]Xu Hong,Qi Wenfeng.Further Results on the Distinctness of Decimations of 1-sequences.Appl.Math.J.Chinese Univ.Ser.B 2003,18 (3):318~324.

共引文献2

同被引文献9

  • 1董文军,李云强.FCSR的研究现状和发展[J].信息安全与通信保密,2007,29(8):9-11. 被引量:2
  • 2贝斯.数字信号处理的FPGA实现[M].刘凌,译.北京:清华大学出版社.2002.
  • 3MARCOVITZ A B.逻辑设计基础[M].北京:清华大学出版社,2006.
  • 4KLIMOV A, SHAMIR A. Cryptographic Application of T-functions[C]. Berlin : Springer-Verlag, 2004 : 248-261.
  • 5LIDL R, NIEDERREITER H. Finite fields[M]. [s.l.]: Addison- Wesley publishing Company, 1983 : 63-65.
  • 6肖国镇 梁传甲 王育民.伪随机序列及其应用[M].北京:国防工业出版社,1985..
  • 7THOMAS,MOORBY P R.硬件描述语言Verilog[M].北京:清华大学出版社,2001.
  • 8廖翠玲,余昭平.多值“加法型”组合生成器分析[J].信息安全与通信保密,2009(8):268-270. 被引量:1
  • 9刘依依.eSTREAM和流密码分析现状[J].信息安全与通信保密,2009,31(12):47-49. 被引量:13

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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