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

CORC > 软件研究所 > 软件所图书馆 > 会议论文

	(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
会议日期	March 19, 2012 - March 21, 2012
会议地点	Washington, DC, United states
关键词	Artificial intelligence
页码	127-145
中文摘要	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.
收录类别	EI
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
语种	英语
ISSN号	0302-9743
ISBN号	9783642340468
内容类型	会议论文
源URL	[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]. 见:19th International Workshop on Fast Software Encryption, FSE 2012. Washington, DC, United states. March 19, 2012 - March 21, 2012.