Example. If I have the following Plain text, OMBVVH, with a key 3.
To perform the encryption, 3 will be converted to its binary equivalent and it becomes, 00110011.
This will be XOR with the binary equivalent of the first alphabet O (01001111)
Such that ; 00110011
01001111
01111100
if we convert it back to value, it becomes |
The binary equivalent of | which is 01111100 will be XOR with the binary equivalent of the next
alphabet M (01001101)
Such that ; 01111100
01001101
00110001
if we convert it back to value, it becomes 1
The binary equivalent of 1 which is 00110001 will be XOR with the binary equivalent of the next
alphabet B (01000010)
Such that ; 00110001
01000010
01110011
if we convert it back to value, it becomes s
The binary equivalent of s which is 01110011 will be XOR with the binary equivalent of the next alphabet
V (01010110)
Such that ; 01110011
01010110
00100101
if we convert it back to value, it becomes %
The binary equivalent of % which is 00100101 will be XOR with the binary equivalent of the next
alphabet V (01010110)
Such that ; 00100101
01010110
01110011
if we convert it back to value, it becomes s
The binary equivalent of s which is 01110011 will be XOR with the binary equivalent of the next alphabet
H (01001000)
Such that ; 01110011
01001000
00111011
if we convert it back to value, it becomes ;
Finally, my encrypted plain text becomes |1s%s;
Sir, i hope i simplified it enough for you to understand, but basically what it does is,
Given any plain text and a numbered key, it takes the binary of the numbered key and XORED it with the
first alphabet , after this it XORs the binary equivalent of the next alphabet with the result of the
previous one and does it all for the plain text. Finally it converts all the results to its ASCII value.
[in XOR, 1+1 =0
1+0 =1
0+1 =1
0+0 =0 ]