hacker.org

For those having a hard time with this challenge. Unless it gets changed, there is more to this challenge than is stated in the problem.

fixed now, thanks!

I don't exactly understand "the same cipher as in Didactic XOR 2" and how to turn it into a four-byte cipher.

I have tried the answer to XOR 2, which is a word of n letters, taking the first four letters as cipher. But that didnt work.

And i have tried the cipher from XOR 2, which is a single byte value, filled up with leading zeros to become a "four-byte cipher". But that didnt work either.

I guess im lost

knox, in this challenge you have to guess the value of the four bytes.

tails wrote:guess the value of the four bytes.

So there is no relation to the other challenge mentioned except that both use XOR?

knox wrote:So there is no relation to the other challenge mentioned except that both use XOR?

Right, there is no relation among the keys. Good luck!

tails wrote:no relation among the keys

Thanks a lot for clarifying this to me! Obviously i have mixed up the terms "cipher" and "key" (should have consulted a dictionary)...

my problem with didactic xor long cipher is that the hex-word is 213 bytes long. imo 213 mod 4 =1.
what can i do with that damned 1 byte i cannot decrypt to a full character.

muffi wrote:my problem with didactic xor long cipher is that the hex-word is 213 bytes long. imo 213 mod 4 =1.
what can i do with that damned 1 byte i cannot decrypt to a full character.

Are you sure ? I didn't count myself but groovy script said it's 212

the_impaler wrote:

muffi wrote:my problem with didactic xor long cipher is that the hex-word is 213 bytes long. imo 213 mod 4 =1.
what can i do with that damned 1 byte i cannot decrypt to a full character.

Are you sure ? I didn't count myself but groovy script said it's 212

ok, sorry i trusted "wc -m" without checking "echo 1 | wc -m" so now i know that i have to suntract 1 from the result. so there are 212 bytes. so it has to work also for me and i have to think further about this problem.