known-key distinguisher on round-reduced 3d block cipher

ISCAS OpenIR

	known-key distinguisher on round-reduced 3d block cipher
	Dong Le; Wu Wenling; Wu Shuang; Zou Jian
	2012
会议名称	12th International Workshop on Information Security Applications, WISA 2011
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	55-69
会议日期	August 22, 2011 - August 24, 2011
会议地点	Jeju Island, Korea, Republic of
收录类别	EI
ISSN	0302-9743
ISBN	9783642278891
部门归属	(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
摘要	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 2²⁰⁰, 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 2²⁰⁰, which is clearly lower than the complexity of generic attack. © 2012 Springer-Verlag Berlin Heidelberg.
关键词	Security Of Data Three Dimensional
主办者	Ministry of Public Administration and Security (MoPAS); Korea Communications Commission (KCC)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15704
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Dong Le,Wu Wenling,Wu Shuang,et al. known-key distinguisher on round-reduced 3d block cipher[C],2012:55-69.