improved integral attacks on reduced-round clefia block cipher

ISCAS OpenIR

	improved integral attacks on reduced-round clefia block cipher
	Li Yanjun; Wu Wenling; Zhang Lei
	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)
页码	28-39
会议日期	August 22, 2011 - August 24, 2011
会议地点	Jeju Island, Korea, Republic of
收录类别	EI
ISSN	0302-9743
ISBN	9783642278891
部门归属	(1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University of Chinese Academy of Sciences Beijing 100049 China; (3) Beijing Electronic Science and Technology Institute Beijing 100070 China
摘要	In this paper a new 9-round integral distinguisher of CLEFIA is proposed based on byte-pattern, which is proved in detail. Then by using the partial sum technique we improve the previous result on 11-round CLEFIA and proposed integral attack on 12-, 13-and 14-round CLEFIA with the whitening keys. The 12-round CLEFIA-128/192/256 is attacked with data complexity 2¹¹³ and time complexity 2^116.7, 13-round CLEFIA-192/256 is attacked with data complexity 2¹¹³ and time complexity 2^180.5, and 14-round CLEFIA-256 is breakable with data complexity 2¹¹³ and time complexity 2^244.5. These results demonstrate that based on the byte-pattern we can improve the integral attacks on CLEFIA two more rounds than those given by the designers. © 2012 Springer-Verlag Berlin Heidelberg.; In this paper a new 9-round integral distinguisher of CLEFIA is proposed based on byte-pattern, which is proved in detail. Then by using the partial sum technique we improve the previous result on 11-round CLEFIA and proposed integral attack on 12-, 13-and 14-round CLEFIA with the whitening keys. The 12-round CLEFIA-128/192/256 is attacked with data complexity 2¹¹³ and time complexity 2^116.7, 13-round CLEFIA-192/256 is attacked with data complexity 2¹¹³ and time complexity 2^180.5, and 14-round CLEFIA-256 is breakable with data complexity 2¹¹³ and time complexity 2^244.5. These results demonstrate that based on the byte-pattern we can improve the integral attacks on CLEFIA two more rounds than those given by the designers. © 2012 Springer-Verlag Berlin Heidelberg.
关键词	Security Of Data
主办者	Ministry of Public Administration and Security (MoPAS); Korea Communications Commission (KCC)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15689
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Li Yanjun,Wu Wenling,Zhang Lei. improved integral attacks on reduced-round clefia block cipher[C],2012:28-39.