Welcome to the resource topic for 2009/479
Title:
Preimage Attacks on 41-Step SHA-256 and 46-Step SHA-512
Authors: Yu Sasaki, Lei Wang, Kazumaro Aoki
Abstract:In this paper, we propose preimage attacks on 41-step SHA-256 and 46-step SHA-512, which drastically increase the number of attacked steps compared to the best previous preimage attack working for only 24 steps. The time complexity for 41-step SHA-256 is 2^{253.5} compression function operations and the memory requirement is 2^{16}\times 10 words. The time complexity for 46-step SHA-512 is 2^{511.5} compression function operations and the memory requirement is 2^{3}\times 10 words. Our attack is a meet-in-the-middle attack. We first consider the application of previous meet-in-the-middle attack techniques to SHA-2. We then analyze the message expansion of SHA-2 by considering all previous techniques to find a new independent message-word partition. We first explain the attack on 40-step SHA-256 whose complexity is 2^{249} to describe the ideas. We then explain how to extend the attack.
ePrint: https://eprint.iacr.org/2009/479
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .