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

T函数Walsh谱值与差分转移概率快速算法

Efficient algorithm for computing Walsh spectrum and differential probability
下载PDF
导出
摘要 根据T函数自身输入与输出结构特点,结合T函数窄度相关定义,研究了T函数线性性质和差分性质。通过构造马尔可夫链和概率转移矩阵,给出了其Walsh谱值与差分转移概率计算的多项式时间快速算法,时间复杂度为O(n),并将该算法应用于对TSC系列T函数的研究,得到任意输入输出线性组合的Walsh谱值表达式。 According to the characteristic of T-functions, along with the definition of narrow T-functions, the linear prop- erty and differential property were studied. Markov chain and transition matrices were constructed to propose fast algo- rithm for computing Walsh spectrum and differential probability, of which the time complexity is O（n）. In addition, the algorithm is applied in the T-functions in TSC-family and finally the result expression is given.
作者 刘燕 胡斌 徐立平
机构地区 解放军信息工程大学密码工程学院
出处 《通信学报》 EI CSCD 北大核心 2015年第5期167-173,共7页 Journal on Communications
基金 国家自然科学基金资助项目(61272041 61202491 61272488)~~
关键词 T函数 窄度 Walsh谱值 差分转移概率 马尔可夫链 T-function narrowness Walsh spectrum differential probability Markov chain
分类号 TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献13

  • 1KLIMOV A, SHAMIR A. A new class of invertible mappings[A]. Workshop on Cryptographic Hardware and Embedded Systems (CHES)[C]. 2003.470-483.
  • 2WIRT K. ASC-A stream cipher with built-in Mac functionality[J]. International Journal of Computer Science, 2007, 2(2): 131.
  • 3HONG, J LEE D, YEOM Y, HAND. A new class of single cycle T-functions[J]. Fast Software Encryption, Springer,2005, 3557:68-82.
  • 4HONG J, LEE D, YEOM Y, HAN D, CHEE S. T-function based stream cipher TSC-3, 2005[EB/OL]. http://www.ecrypt.eu.org/stream/ ciphers/tsc3/tsc3.pdf.
  • 5MOON D, KWON D, HAN D, et al. T-function based stream cipher TSC-4, 2005[EB/OL]. http://www.ecrypt.eu.org/ stream /ciphers /tsc4/tsc4.pdf.
  • 6MAXIMOV A. A new stream cipher "Mir-I" [EB/OL]. http://www. ecrypt.eu.org/stream,2008.
  • 7DAUM M. Narrow T-function[J]. Fast Software Encryption, Springer, 2005, 3557:50-67.
  • 8ANASHIN V, KHRENNILOV A. Applied algebraic dynamics[J]. P-Adic Numbers, Ultrahcetric Analysis, and Application, 2010, 2(4): 360-362.
  • 9ANASHIN V, KHRENNILOV A, YUROVA E. T-function revisited: new criteria for bijectivity/transitivity[J]. Designs, Codes and Cryp- tography, 2014, 71(3): 383-407.
  • 10NYBERG K, WALLEN J. Improved linear distinguishers for S N OW2.0[J]. Fast Software Encryption, Springer,2006,4047:144-162.

二级参考文献11

  • 1张龙,吴文玲,温巧燕.mod 2^n加运算与F2上异或运算差值的概率分布和递推公式[J].北京邮电大学学报,2007,30(1):85-89. 被引量：12
  • 2Matsui M. Linear cryptanalysis method for DES cipher[C]//Hellesth T. Advances in Cryptology-Eurocrypt 1993. Loftus: Springer-Verlag, 1993: 386-397.
  • 3Doug W, Bruce S, Stefan L, et al. Helix: Fast encryption and authentication in a single cryptographic primitive [C]//Ross A. Fast Software Encryption 2003. Berlin: Springer-Verlag, 2003: 330-347.
  • 4James M, Gurgen K, Melsik K, etal. Nomination of 5afer+ + as candidate algorithm for the new european schemes for signatures, integrity, and encryption (NESSIE) [EB/OL]. (2006-02-27) [2009-05-07]. http://www. cryptonessie, org.
  • 5David A, Scott F. The stream cipher LEVIATHAN [EB/OL]. (2007-03-01) [2009-05-07]. http://www. cryptonessie, org.
  • 6Miyano H. Addend dependency of differential/linear probability of addition [ J ]. IEICE Transactions,1998, E81-A(1):106-109.
  • 7Helger L, Shiho M. Efficient algorithms for computing differential properties of addition[C]//Mitsure M. Fast Software Encryption 2001. Yokohama:Springer-Verlag, 2002: 336-350.
  • 8Wallen J. Linear approximations of addition modulo 2^n [C]//Kaisa N. Fast Software Eneryption 2008. Lausanne,Springer-Verlag, 2009 : 261-273.
  • 9Helger L. On differential properties of pseudo-hadamard transform and related mappings [C]//Alfred M. Progress in Cryptology Indoerypt-2002. Hyderabad: Springer-Verlag, 2002: 48-61.
  • 10Kaisa N, Johan W. Improved Linear distinguishers for SNOW 2. 0 [C]//Matthew J. Fast Software Encryption 2006. Graz: Springer-Verlag, 2007 : 144-162.

共引文献1

通信学报
2015年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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