(pseudo) preimage attack on round-reduced grstl hash function and others

ISCAS OpenIR

	(pseudo) preimage attack on round-reduced grstl hash function and others
	Wu Shuang; Feng Dengguo; Wu Wenling; Guo Jian; Dong Le; Zou Jian
	2012
会议名称	19th International Workshop on Fast Software Encryption, FSE 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	127-145
会议日期	March 19, 2012 - March 21, 2012
会议地点	Washington, DC, United states
收录类别	EI
ISSN	0302-9743
ISBN	9783642340468
部门归属	(1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China; (2) Institute for Infocomm Research Singapore Singapore
摘要	The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash function for both 256-bit and 512-bit versions, i.e., we need to choose the initial value in order to invert the hash function. Pseudo preimage attack on 5(out of 10)-round Grøstl-256 has a complexity of (2^244.85,2^230.13) (in time and memory) and pseudo preimage attack on 8(out of 14)-round Grøstl-512 has a complexity of (2^507.32,2^507.00). To the best of our knowledge, our attacks are the first (pseudo) preimage attacks on round-reduced Grøstl hash function, including its compression function and output transformation. These results are obtained by a variant of meet-in-the-middle preimage attack framework by Aoki and Sasaki. We also improve the time complexities of the preimage attacks against 5-round Whirlpool and 7-round AES hashes by Sasaki in FSE 2011. © 2012 Springer-Verlag.; The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash function for both 256-bit and 512-bit versions, i.e., we need to choose the initial value in order to invert the hash function. Pseudo preimage attack on 5(out of 10)-round Grøstl-256 has a complexity of (2^244.85,2^230.13) (in time and memory) and pseudo preimage attack on 8(out of 14)-round Grøstl-512 has a complexity of (2^507.32,2^507.00). To the best of our knowledge, our attacks are the first (pseudo) preimage attacks on round-reduced Grøstl hash function, including its compression function and output transformation. These results are obtained by a variant of meet-in-the-middle preimage attack framework by Aoki and Sasaki. We also improve the time complexities of the preimage attacks against 5-round Whirlpool and 7-round AES hashes by Sasaki in FSE 2011. © 2012 Springer-Verlag.
关键词	Artificial Intelligence
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15749
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Wu Shuang,Feng Dengguo,Wu Wenling,et al. (pseudo) preimage attack on round-reduced grstl hash function and others[C],2012:127-145.