Published: August 8, 2010
Author(s)
Çağdaş Çalık, Meltem Sönmez Turan
Conference
Name: First International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2010
Dates: 08/08/2010 - 08/11/2010
Location: Puebla, Mexico
Citation: vol. 6212, pp. 205-221
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 Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that requires a few evaluations of the compression function. Then, we present a message recovery attack with a complexity of 2^10.48 compression function evaluations. Also, we present a pseudo-preimage attack for the compression function with complexity 2^254.25.
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 Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that requires a few evaluations of the compression...
See full 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 Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that requires a few evaluations of the compression function. Then, we present a message recovery attack with a complexity of 2^10.48 compression function evaluations. Also, we present a pseudo-preimage attack for the compression function with complexity 2^254.25.
Hide full abstract
Keywords
hash functions; pseudo-preimage attacks; SHA-3 competition
Control Families
None selected
) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)
