Cryptology ePrint Archive: Report 2008/271

A Combinatorial Analysis of Recent Attacks on Step Reduced SHA-2 Family

Somitra Kumar Sanadhya and Palash Sarkar

Abstract: We perform a combinatorial analysis of SHA-2 compression function. This analysis explains in a unified way the recent attacks against reduced round SHA-2. We start with a general class of local collisions and show that the previously used local collision by Nikolić and Biryukov (NB) and Sanadhya and Sarkar (SS) are special cases. The study also clarifies several advantages of the SS local collision over the NB local collision. Deterministic constructions of up to 22-round SHA-2 collisions are described using the SS local collision and up to 21-round SHA-2 collisions are described using the NB local collision. For 23 and 24-round SHA-2, we describe a general strategy and then apply the SS local collision to this strategy. The resulting attacks are faster than those proposed by Indesteege et al using the NB local collision. We provide colliding message pairs for 22, 23 and 24-round SHA-2. Although these attacks improve upon the existing reduced round SHA-256 attacks, they do not threaten the security of the full SHA-2 family. \footnote{This work builds upon and subsumes previous work done by us. Whereas the previous works focused on obtaining collisions for fixed number of rounds, the current work provides the combinatorial framework for understanding how such collisions arise.}

Category / Keywords: Cryptanalysis, SHA-2 hash family, reduced round attacks

Date: received 12 Jun 2008, last revised 3 Dec 2008

Contact author: somitra_r at isical ac in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: This is a substantially revised version.

Version: 20081203:103424 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]