Collisions for variants of the BLAKE hash function

  • Authors:

  • Janoš Vidali;Peter Nose;Enes Pašalić

  • Affiliations:

  • University of Ljubljana, FRI, Ljubljana, Slovenia;University of Ljubljana, FRI, Ljubljana, Slovenia;University of Primorska, FAMNIT, Koper, Slovenia

  • Venue:
  • Information Processing Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.89

Visualization

Abstract

In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash function does not permute the message words and constants in the round computation of the compression function, and BRAKE additionally removes feedforward and zeroes the constants used in each round of the compression function. We show that in these cases we can efficiently find, for any intermediate hash value, a fixed-point block giving us an internal collision, thus producing collisions for messages of equal length in case of BLOKE, and internal collisions for BRAKE.