| Is this even solvable? It keeps telling me that the password needs to be 17 chars long, although it actually is. I also do not see any check in the CME whether the entered string is actually 17 chars long, it prints that unconditionally. A 17 chars long password that satisfies the necessary ASCII sum of 0x6E2 = 1762d is "alnzzzzzzzzzzz###". This should be valid, but I keep getting the "so close" message.
By the way: It's "disassembler", not "dissambler". |
==> |
| I'm stumbling over this loop:
00401844 | 0FB745 F0 | MOVZX EAX,WORD PTR SS:[EBP-0x10]
00401848 | 66:85C0 | TEST AX,AX
0040184B | 75 F7 | JNE findmysecret.401844
Why isn't that an infinite loop? The data copied to EAX should be constant, so the jump condition should never change. But it does after roughly 30 rounds, and it also changes the random number stored at 0x4063E8. Why and how? |
==> |
| This was fun to reverse. Straight forward, but nice rules for checking and just enough annoying (in a positive sence) spaghetti structure to keep it interesting. |
==> |