Collisions for 5 Rounds of the ECHO-256 Hash Function


In this work, we present a collision attack on 5 out of 8 rounds of the ECHO256 hash function with a complexity of 2 in time and 2 memory. In this work, we further show that the merge inbound phase can still be solved in the case of hash function attacks on ECHO. As correctly observed by Jean et al., the merge inbound phase of previous hash function attacks… (More)

2 Figures and Tables


  • Presentations referencing similar topics