期刊文献+

Linear complexity of sequences produced by single cycle T-function

Linear complexity of sequences produced by single cycle T-function
原文传递
导出
摘要 Four kinds of sequences generated by single cycle triangular function (T-function) are investigated to check the possibility for a single cycle T-function to be a cryptographic component in stream ciphers. Based on the special properties of single cycle T-function and an algorithm due to Wei, linear complexities of these four kinds of sequence are all acquired. The results show that single cycle T-function sequences have high linear complexity. Therefore, T-function satisfies the essential requirements being a basic component of stream cipher. Four kinds of sequences generated by single cycle triangular function (T-function) are investigated to check the possibility for a single cycle T-function to be a cryptographic component in stream ciphers. Based on the special properties of single cycle T-function and an algorithm due to Wei, linear complexities of these four kinds of sequence are all acquired. The results show that single cycle T-function sequences have high linear complexity. Therefore, T-function satisfies the essential requirements being a basic component of stream cipher.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2011年第4期123-128,共6页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China (60833008,60803149) the Scientific Research Foundation of Education Department of Shaanxi Provincial Government of China (11JK0503) the Youth Science and Technology Foundation of Xi’an University of Architecture and Technology (QN0831,QN1024)
关键词 stream cipher single cycle T-function linear complexity stream cipher, single cycle T-function, linear complexity
  • 相关文献

参考文献1

二级参考文献6

  • 1Klimov A, Shamir A. A new class of invertible mappings [C] // Workshop on Cryptographic Hardware and Embeded Systems ' 02, LNCS. [ S. l. ] : Springer-Verlag, 2003 : 470-483.
  • 2Kolokotronis N. Cryptographic properties of stream ciphers based on T-functions[C] // ISIT 2006. USA. IEEE, 2006: 1604-1608.
  • 3Zhang Wenying, Wu Chuankun. The algebraic normal form, linear complexity and k-error linear complexity of single cycle T-function [ DB/OL]. Heidelberg: Springer Berlin, 2005 [ 2007-09-02 ]. http://www. springerlink. com/index/x8t648x51124p087. pdf.
  • 4Molland H, Helleseth T. A linear weakness in the Klimov-Shamir T-function[ C] //Proc IEEE Syrup Inf Theory. Spain: IEEE Transactions on Information Theory Society, 2005. 1106-1110.
  • 5Kurosawa K, Sato F, Sakata T, et al. A relationship between linear complexity and k-error linear complexity [J]. IEEE Trans Inf Theory, 2000, 46(2). 694-698.
  • 6Games R A, Chan A H. A fast algorithm for determining the complexity of a binary sequence with period 2^n [J]. IEEE Trans Inf Theory, 1983, 29(4) : 144-146.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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