A beginner pattern worth recognising, from a crackme I wrote for myself. The validation function does this:
static const unsigned char want[11] = {
0x15, 0x0a, 0x1f, 0x14, 0x77, 0x09, 0x1f, 0x09, 0x1b, 0x17, 0x1f
};
int check(const char *s) {
for (int i = 0; i < 11; i++)
if ((s[i] ^ 0x5a) != want[i])
return 0;
return s[11] == '\0';
}
In the disassembly you see a loop with xor eax, 0x5a, a cmp against bytes from a table in .rodata, and a counter up to 11. Do not run a brute force: each position is independent, and XOR is its own inverse. Just apply the same XOR to the table:
want = bytes([0x15,0x0a,0x1f,0x14,0x77,0x09,0x1f,0x09,0x1b,0x17,0x1f])
print(bytes(b ^ 0x5a for b in want).decode())
It prints the 11-character password. The general lesson: when the check is per character and reversible, you read the transformation and invert it. The checks that deserve a SAT solver or a debugger are the ones where every output byte depends on all the input bytes.
The cat, for the record, has not solved it. She sat on the keyboard and typed zzzzzzzzzzz. Eleven characters, wrong password, but I admire the length.