That isn't a problem. What you wrote is the same thing as what I wrote.
Code:
let `~` = XOR
Search for all x such that `x ~ 0xB0 == 0x22`
x ~ 0xB0 == 0x22
x ~ 0xB0 ~ 0xB0 == 0x22 ~ 0xB0
x ~ (0xB0 ~ 0xB0) == 0x22 ~ 0xB0
x ~ 0 = 0x22 ~ 0xB0
x = 0x22 ~ 0xB0
Search for all x such that `x = 0x22 ~ 0xB0`
All of the above operations come from the fact that the integers equipped with xor is an abelian group. also `0x22 ~ 0xB0 == 0xB0 ~ 0x22`
If you want something more complicated (e.g. if the xor key changes), use a custom type. _________________
I don't know where I'm going, but I'll figure it out when I get there.
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You cannot attach files in this forum You can download files in this forum