I need to bake it!

problem.py

We are given problem.py, which is a interesting cipher/hash algorithm.

Solution

The hash basically takes our input, multiplies it with basically a random number for our purposes, and XORs every element with a fixed value, and adds the value a whole bunch of times to the last number(not sure if this was a typo)

Since XOR is reversible, we simply reverse the XOR, and take the GCD of multiple attempts

Strangely the flag is different before and after the ctf, not exactly sure why