synthetic linear analysis: improved attacks on cubehash and rabbit

ISCAS OpenIR

	synthetic linear analysis: improved attacks on cubehash and rabbit
	Lu Yi; Vaudenay Serge; Meier Willi; Ding Liping; Jiang Jianchun
	2012
会议名称	14th International Conference on Information Security and Cryptology, ICISC 2011
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	248-260
会议日期	November 30, 2011 - December 2, 2011
会议地点	Seoul, Korea, Republic of
收录类别	EI
ISSN	0302-9743
ISBN	9783642319112
部门归属	(1) National Engineering Research Center of Fundamental Software Institute of Software Chinese Academy of Sciences Beijing China; (2) EPFL Lausanne Switzerland; (3) FHNW Windisch Switzerland
摘要	It has been considered most important and difficult to analyze the bias and find a large bias regarding the security of crypto-systems, since the invention of linear cryptanalysis. The demonstration of a large bias will usually imply that the target crypto-system is not strong. Regarding the bias analysis, researchers often focus on a theoretical solution for a specific problem. In this paper, we take a first step towards the synthetic approach on bias analysis. We successfully apply our synthetic analysis to improve the most recent linear attacks on CubeHash and Rabbit respectively. CubeHash was selected to the second round of SHA-3 competition. For CubeHash, the best linear attack on 11-round CubeHash with 2⁴⁷⁰ queries was proposed previously. We present an improved attack for 11-round CubeHash with complexity 2 ^414.2. Based on our 11-round attack, we give a new linear attack for 12-round CubeHash with complexity 2⁵¹³, which is sharply close to the security parameter 2⁵¹² of CubeHash. Rabbit is a stream cipher among the finalists of ECRYPT Stream Cipher Project (eSTREAM). For Rabbit, the best linear attack with complexity 2¹⁴¹ was recently presented. Our synthetic bias analysis yields the improved attack with complexity 2 ¹³⁶. Moreover, it seems that our results might be further improved, according to our ongoing computations. © 2012 Springer-Verlag.; It has been considered most important and difficult to analyze the bias and find a large bias regarding the security of crypto-systems, since the invention of linear cryptanalysis. The demonstration of a large bias will usually imply that the target crypto-system is not strong. Regarding the bias analysis, researchers often focus on a theoretical solution for a specific problem. In this paper, we take a first step towards the synthetic approach on bias analysis. We successfully apply our synthetic analysis to improve the most recent linear attacks on CubeHash and Rabbit respectively. CubeHash was selected to the second round of SHA-3 competition. For CubeHash, the best linear attack on 11-round CubeHash with 2⁴⁷⁰ queries was proposed previously. We present an improved attack for 11-round CubeHash with complexity 2 ^414.2. Based on our 11-round attack, we give a new linear attack for 12-round CubeHash with complexity 2⁵¹³, which is sharply close to the security parameter 2⁵¹² of CubeHash. Rabbit is a stream cipher among the finalists of ECRYPT Stream Cipher Project (eSTREAM). For Rabbit, the best linear attack with complexity 2¹⁴¹ was recently presented. Our synthetic bias analysis yields the improved attack with complexity 2 ¹³⁶. Moreover, it seems that our results might be further improved, according to our ongoing computations. © 2012 Springer-Verlag.
关键词	Security Of Data
主办者	National Security Research Institute (NSRI); Electronics and Telecommunications Research Institute (ETRI); Korea Internet and Security Agency (KISA); Ministry of Public Administration and Security (MOPAS)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15778
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Lu Yi,Vaudenay Serge,Meier Willi,et al. synthetic linear analysis: improved attacks on cubehash and rabbit[C],2012:248-260.