期刊文献+

单圈T-函数输出序列的线性复杂度及稳定性 被引量:11

Linear Complexity and Stability of Output Sequences of Single Cycle T-Function
下载PDF
导出
摘要 根据单圈T-函数的基本性质,研究了基于单圈T-函数的流密码的性质,得到单字的单圈T-函数前2t位所构成序列的周期、线性复杂度及k-错线性复杂度.对某类含有2p个字的单圈T-函数,给出了连续输出状态中的任一固定位所构成的序列以及前2t位所构成序列的周期、线性复杂度及k-错线性复杂度,结果表明,由T-函数输出序列具有良好性质. Some properties of the stream cipher based on single cycle T-function is investigated with respected to single cycle T-function's special properties. And also the period, linear complexity and k- error linear complexity of the sequences which are constituted by the first 2t bits of all single word single cycle T-functions are obtained. For some 2^p words single cycle T-function, the period, linear complexity and k-error linear complexity of the sequences which are constituted by the some bit and that of the sequences constituted by the first 2t bits in the consecutive states are given respectively. The results give that the output sequences of the single cycle T-function have good properties.
作者 赵璐 温巧燕
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2008年第4期62-65,共4页 Journal of Beijing University of Posts and Telecommunications
基金 国家"863计划"项目(2006AA01Z419) 国家自然科学基金重大计划项目(90604023) 北京市自然科学基金项目(4072020)
关键词 流密码 单圈T-函数 周期 线性复杂度 K-错线性复杂度 stream cipher single cycle T-function period linear complexity k-error linear complexity
  • 相关文献

参考文献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. 被引量:1
  • 2Kolokotronis N. Cryptographic properties of stream ciphers based on T-functions[C] // ISIT 2006. USA. IEEE, 2006: 1604-1608. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1

同被引文献74

引证文献11

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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