And/or what about an interpret or compile step in there?
And/or what about an interpret or compile step in there?
https://twitter.com/OverTheWireCTF/status/146574242275182182...
Someone who solved the challenge did a writeup:
- Guessing by hand.
- Bruteforce by programatically feeding input into QEMU (as in that writeup).
- Bruteforce by only emulating the "important" code, via something like Unicorn.
- Bruteforce by reimplementing the algorithm in another language (There are some tricks you can use to make it go fast - maybe I should write those up...)
- Reducing the search space by grepping for likely keywords.
- Bruteforce of remaining bytes of the RC4 key (also as in that writeup).
Yes, this exists: