作者: Somitra Kumar Sanadhya , Palash Sarkar
DOI: 10.1007/978-3-540-70500-0_19
关键词:
摘要: Most of the attacks against (reduced) SHA-2 family in literature have used local collisions which are valid for linearized version hash functions. Recently, at FSE '08, an attack reduced round SHA-256 was presented by Nikolic and Biryukov a collision is actual function. It 9-step starts introducing modular difference 1 two messages. succeeds with probability roughly 1/3. We build on work provide generalized nonlinear accepts arbitrary initial message difference. This 1. Using this we present 18-step SHA-512 Both these succeed then special cases our show different differential paths attacking 20-step SHA-512. One same as while other one new path. Messages following both can be found improves previous result where success Finally, 21-step SHA-512, The probabilities 2? 15and 17which improve having 19reported earlier. examples pairs all up to SHA-256. also first real colliding