Welcome to the resource topic for 2010/057
Title:
Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256
Authors: Cagdas Calik, Meltem Sonmez Turan
Abstract:Hamsi is one of the second round candidates of the SHA-3 competition. In this study, we present non-random differential properties for the compression function of the hash function Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that requires a few evaluations of the compression function and extend the distinguisher to 5 rounds with complexity 2^{83}. Then, we present a message recovery attack with complexity of 2^{10.48} compression function evaluations. Also, we present a pseudo-preimage attack for the compression function with complexity 2^{254.25}. The pseudo-preimage attack on the compression function is easily converted to a pseudo second preimage attack on Hamsi-256 hash function with the same complexity.
ePrint: https://eprint.iacr.org/2010/057
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 .