Posted: Sat Jul 18, 2009 3:32 pm
Really really liked this one. Definitely made me think
No bruteforce needed indeed
sabretooth
No bruteforce needed indeed
sabretooth
Surely you're joking...marko9900 wrote:Any guidance for me?
Code: Select all
k = {unknown byte}
for (i = 0; i < len(txt); i++)
c = txt[i] ^ k
print c
k = c
Code: Select all
k = c
Code: Select all
k = txt[i]
It is true! Thank you @aurquiel.aurquiel wrote:In this code
ThisCode: Select all
k = {unknown byte} for (i = 0; i < len(txt); i++) c = txt[i] ^ k print c k = c
Code: Select all
k = c
should be this
Code: Select all
k = txt[i]
I don't think there is problem with the challenge.Miyazawa wrote:It is true! Thank you @aurquiel.aurquiel wrote:In this code
ThisCode: Select all
k = {unknown byte} for (i = 0; i < len(txt); i++) c = txt[i] ^ k print c k = c
Code: Select all
k = c
should be this
Code: Select all
k = txt[i]
The algorithm is wrong so I have wasted a lot of time by doing this challange...
You should correct this...