Tags: hash-collision cryptography 

Rating:

Fun challenge about a custom hash function to break. The solution exploits the birthday paradox to find collisions in intermediate hash computations, and leveraged with a subset sum solver we are able to find a file with the same hash as a target file.

Original writeup (https://gniot.fr/2025/03/03/ctf-writeup.html).