Sample
The bitwise operation we use is \(Z = A \oplus B\):
A B Z ----- 0 0 0 0 1 1 1 0 1 1 1 0
If we use an 'a' (0110 0001) and plain text of "shape" we get:
's' 'h' 'a' 'p' 'e' Input: 01110011 01101000 01100001 01110000 01100101 Key: 01100001 01100001 01100001 01100001 01100001 --------------------------------------------------- Cipher 00010010 00001001 00000000 00010001 00000100
If we use an 'a' (0110 0001) again we get:
Input: 00010010 00001001 00000000 00010001 00000100 Key: 01100001 01100001 01100001 01100001 01100001 --------------------------------------------------- Decoded 01110011 01101000 01100001 01110000 01100101 's' 'h' 'a' 'p' 'e'
The required table is here: