Search found 1 match
- Tue Sep 08, 2009 10:58 am
- Forum: Challenges
- Topic: Didactic XOR Long Cipher
- Replies: 16
- Views: 27831
I split the encrypted text into 4 parts as follows. s[0] = txt[0] txt[4] txt[8] ... s[1] = txt[1] txt[5] txt[9] ... s[2] = txt[2] txt[6] txt[10] ... s[3] = txt[3] txt[7] txt[11] ... If we define key as k[0] k[1] k[2] k[3] for representation, we could find the k is only XORed with every elements in s...