CLEFIA密码的Square攻击

唐学海; 李超; 谢端强

doi:10.3724/SP.J.1146.2008.01206

CLEFIA密码的Square攻击

doi: 10.3724/SP.J.1146.2008.01206

唐学海^①;李超,
李超,
谢端强

基金项目:

国家自然科学基金(60803156, 60573028)和东南大学移动通信国家重点实验室开放基金(w200805)资助课题

计量
- 文章访问数: 3414
- HTML全文浏览量: 109
- PDF下载量: 885
- 被引次数: 0
出版历程
- 收稿日期: 2008-09-19
- 修回日期: 2009-04-28
- 刊出日期: 2009-09-19

Square Bttack on CLEFIA

摘要

摘要: 该文根据CLEFIA密码的结构特性，得到了Square攻击的新的8轮区分器，并指出了设计者提出的错误8轮区分器。利用新的8轮区分器对CLEFIA密码进行了10到12轮的Square攻击，攻击结果如下：攻击10轮CLEFIA-128\192\256的数据复杂度和时间复杂度分别为297和292.7；攻击11轮CLEFIA-192\256的数据复杂度和时间复杂度分别为298和2157.6；攻击12轮CLEFIA-256的数据复杂度和时间复杂度分别为298.6和2222。攻击结果表明：在攻击10轮CLEFIA时，新的Square攻击在数据复杂度和时间复杂度都优于设计者给出的Square攻击。
- 密码; CLEFIA; 区分器; Square攻击
Abstract: According to the structure properties of CLEFIA , new 8-round distinguishers for Square attack are presented, and the wrong 8-round distinguishers originally found by the designers are pointed out. Based on the new distinguisher, the square attack on CLEFIA can be improved as follows: 10-round CLEFIA-128\192\256 is attacked with data complexity 297 and time complexity 292.7, 11-round CLEFIA-192/256 is attacked with data complexity 298 and time complexity 2157.6, and 12-round CLEFIA-256 is breakable with data complexity 298.6 and time complexity 2222. These results demonstrate that under the case of 10-round CLEFIA, both data and time complexity of our attack are better than those given by the designers.

HTML全文

参考文献(1)

Shirai T, Shibutani K, Akishita T, Moriai S, and Iwata T.The 128-bit block cipher CLEFIA [C]. Fast SoftwareEncryption 2007, Springer, Heidelbeng , 2007, Vol. 4593:181-195.[2]Sony Corporation. The 128-bit Blockcipher CLEFIA:Algorithm Specification. Revision 1.0 June 1, 2007.[3]Sony Corporation. The 128-bit Blockcipher CLEFIA:Security and Performance Evaluation. Revision 1.0 June 1,2007.[4]Biham E and Shamir A. Differential cryptanalysis ofDES-like cryptosystems[J].Journal of Cryptology.1991, 4(1):3-72[5]Matsui M. Linear cryptanalysis of the data encryptionstandard[C]. Proceedings of Eurocrypt' 93, Springer-Verlag,1994, LNCS 765: 386-397.[6]Langford S K and Hellman M E. Differential-linearcryptanalysis[C]. Proceedings of Crypto' 94, Springer-Verlag, 1994, LNCS 839: 17-25.[7]Knudsen L R. Truncated and higher order differentials[C].Fast Software Encryption: Second International Workshop,Springer-Verlag , 1994, LNCS1008: 196-211.[8]Biham E, Biryukov A, and Shamir A. Cryptanalysis ofskipjack reduced to 31 rounds using impossibledifferentials[C]. Proceedings of Eurocrypt' 99, Springer-Verlag, 1999, LNCS 1592: 12-23.[9]Daemen J, Knudsen L, and Rijmen V. The block ciphersquare[C]. Fast Software Encryption 1997, Springer-Verlag,1997, LNCS 1267: 149-165.[10]Biham E. New types of cryptanalytic attacks using relatedkeys[J]. Journal of Cryptology, 1994, 7(4): 229-246.[11]Chen Hua, Wu Wen-ling, and Feng Deng-guo. Differentialfault analysis on CLEFIA[C]. International Conference onInformation and Communications Security, Birmingham, UK,2008, LNCS 4861: 284-295.[12]Takahashi J and Fukunaga T. Improved differential faultanalysis on CLEFIA[C]. Fault Diagnosis and Tolerance inCryptography 2008, Washington, DC, USA, 2008: 25-34.[13]Wang Wei and Wang Xiao-yun. Improved impossibledifferential cryptanalysis of CLEFIA[R]. IACR ePrint archive:Report 2007/466.[14]Tsunoo Y, Tsujihara E, Shigeri M, Saito T, Suzaki T, andKubo H. Impossible differential cryptanalysis of CLEFIA[C].Fast Software Encryption 2008, Lausanne, Switzerland, 2008:398-411.

施引文献

资源附件(0)

访问统计