Converting meet-in-the-middle preimage attack into pseudo collision attack: application to SHA-2
作者： Ji Li , Takanori Isobe , Kyoji Shibutani
DOI: 10.1007/978-3-642-34047-5_16
关键词: SHA-2 、 Preimage attack 、 Hash function 、 Meet-in-the-middle attack 、 Theoretical computer science 、 Birthday attack 、 Algorithm 、 MD4 、 Computer science 、 Skein 、 Collision attack
摘要: In this paper, we present a new technique to construct collision attack from particular preimage which is called partial target attack. Since most of the recent meet-in-the-middle attacks can be regarded as attack, derived By using our technique, pseudo collisions 43-step reduced SHA-256 and 46-step SHA-512 obtained with complexities 2126 2254.5, respectively. As far know, results are best on both in literature. Moreover, show that extended 52 57 steps SHA-512, respectively, by combined SHA-2 bicliques. Furthermore, since proposed quite simple, it directly applied other hash functions. We apply algorithm several functions including Skein BLAKE, SHA-3 finalists. not only family, but also insight relation between
springer.com
sci-hub.se 参考文章(50)
Stefan Lucks, Jon Callas, The Skein Hash Function Family ,(2009)
Alex Biryukov, Mario Lamberger, Florian Mendel, Ivica Nikolić, Second-Order differential collisions for reduced SHA-256 international conference on the theory and application of cryptology and information security. pp. 270- 287 ,(2011) , 10.1007/978-3-642-25385-0_15
Jean-Paul Delescaille, Jean-Jacques Quisquater, How Easy is Collision Search? Application to DES (Extended Summary). theory and application of cryptographic techniques. pp. 429- 434 ,(1989)
Jean-Philippe Aumasson, Willi Meier, Luca Henzen, Raphael C.-W. Phan, SHA-3 proposal BLAKE ,(2009)
Andrey Bogdanov, Christian Rechberger, A 3-subset meet-in-the-middle attack: cryptanalysis of the lightweight block cipher KTANTAN international conference on selected areas in cryptography. ,vol. 6544, pp. 229- 240 ,(2010) , 10.1007/978-3-642-19574-7_16
Somitra Kumar Sanadhya, Palash Sarkar, Attacking reduced round SHA-256 applied cryptography and network security. pp. 130- 143 ,(2008) , 10.1007/978-3-540-68914-0_8
Gaëtan Leurent, MD4 is Not One-Way fast software encryption. pp. 412- 428 ,(2008) , 10.1007/978-3-540-71039-4_26
Aggelos Kiayias, Moti Yung, Polynomial reconstruction based cryptography selected areas in cryptography. pp. 129- 133 ,(2001) , 10.1007/3-540-45537-X_10
Markku-Juhani O. Saarinen, A Meet-in-the-Middle Collision Attack Against the New FORK-256 Lecture Notes in Computer Science. pp. 10- 17 ,(2007) , 10.1007/978-3-540-77026-8_2
Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams, Secure Two-Party Computation Is Practical international conference on the theory and application of cryptology and information security. pp. 250- 267 ,(2009) , 10.1007/978-3-642-10366-7_15