Improving Local Collisions: New Attacks on Reduced SHA-256
In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and show how to turn them into collisions. We present a collision attack on 28 steps of the hash function with practical complexity. Using a two-block approach we are able to turn a semi-free-start collision into a collision for 31 steps with a complexity of at most 265.5. The main improvement of our work is to extend the size of the local collisions used in these attacks. To construct differential characteristics and confirming message pairs for longer local collisions, we had to improve the search strategy of our automated search tool. To test the limits of our techniques we present a semi-free-start collision for 38 steps.
Keywordshash functions SHA-2 cryptanalysis collisions semi-free-start collisions differential characteristics automatic search tool
- 7.Lamberger, M., Mendel, F.: Higher-Order Differential Attack on Reduced SHA-256. Cryptology ePrint Archive, Report 2011/037 (2011), http://eprint.iacr.org/
- 13.National Institute of Standards and Technology: FIPS PUB 180-3: Secure Hash Standard. Federal Information Processing Standards Publication 180-3, U.S. Department of Commerce (October 2008), http://www.itl.nist.gov/fipspubs
- 14.National Institute of Standards and Technology: SHA-3 Selection Announcement (October 2012), http://csrc.nist.gov/groups/ST/hash/sha-3/sha-3_selection_announcement.pdf