ISCAS OpenIR
known-key distinguisher on round-reduced 3d block cipher
Dong Le; Wu Wenling; Wu Shuang; Zou Jian
2012
Conference Name12th International Workshop on Information Security Applications, WISA 2011
SourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages55-69
Conference DateAugust 22, 2011 - August 24, 2011
Conference PlaceJeju Island, Korea, Republic of
Indexed TypeEI
ISSN0302-9743
ISBN9783642278891
Department(1) State Key Lab of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University of Chinese Academy of Sciences Beijing 100149 China
English Abstract3D block cipher is an AES-based block cipher which has a three-dimensional state. Besides some traditional attacks, Knudsen and Rijmen introduced a new tool, known-key distinguisher, to identify the weak pseudo-randomness of a block cipher. In this paper, we present a known-key distinguisher on 15-round 3D cipher, which has 22 rounds in total. In our attack, we use the rebound attack to construct two differential paths, and integrate them by a technique of solving a system of nonlinear equations. It can be done with a negligible complexity and sufficient random degrees are provided for the subsequent attack. We extend the differential trail to 15 rounds and give a known-key distinguisher based on the 15-round differential path. The complexity of finding a right pair is 2200, which is clearly lower than the complexity of generic attack. © 2012 Springer-Verlag Berlin Heidelberg.; 3D block cipher is an AES-based block cipher which has a three-dimensional state. Besides some traditional attacks, Knudsen and Rijmen introduced a new tool, known-key distinguisher, to identify the weak pseudo-randomness of a block cipher. In this paper, we present a known-key distinguisher on 15-round 3D cipher, which has 22 rounds in total. In our attack, we use the rebound attack to construct two differential paths, and integrate them by a technique of solving a system of nonlinear equations. It can be done with a negligible complexity and sufficient random degrees are provided for the subsequent attack. We extend the differential trail to 15 rounds and give a known-key distinguisher based on the 15-round differential path. The complexity of finding a right pair is 2200, which is clearly lower than the complexity of generic attack. © 2012 Springer-Verlag Berlin Heidelberg.
KeywordSecurity Of Data Three Dimensional
SponsorshipMinistry of Public Administration and Security (MoPAS); Korea Communications Commission (KCC)
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/15704
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Dong Le,Wu Wenling,Wu Shuang,et al. known-key distinguisher on round-reduced 3d block cipher[C],2012:55-69.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Dong Le]'s Articles
[Wu Wenling]'s Articles
[Wu Shuang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Dong Le]'s Articles
[Wu Wenling]'s Articles
[Wu Shuang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Dong Le]'s Articles
[Wu Wenling]'s Articles
[Wu Shuang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.