Cryptography[EDIT]

A message M is encrypted as follows: There are 52 keys $K_1$ - $K_{52}$ in total but consider only 6 keys for sake of convenience and simplicity; Also consider the encryption to be a 8 bit binary fold;(Although it is a 256 - bit encryption security); The necessary information are as follows: Note that (+) denotes BITWISE-XOR operation * $K_1=01100111 , K_2=10001010,K_3=00011001,K_4=11011001,K_5=11001001,K_6=10011000$ * Defragmentation: M is defragmented into 4 parts say $A$ , $B$ , $C$ and $D$ respectively as in the binary string STEP 0: $A=A \times K_1,B=B + K_2, C= C + K_3,D=D \times K_4$ STEP 1: $E=A (+) C$ $F=B (+) D$ $E=E \times K_5$ $F= F+ E$ $F = F \times K_6$ $F=F + E$ $A = A (+) F$ $C= C (+) F$ $SWAP(B,C)$ Given the following values of $A$ , $B$ $C$ and $D$ after the final step(i.e step 1) obtain the original values of $A$ , $B$ $C$ and $D$ and thus the binary string corresponding to M . The binary string obtained simply by concatenating the values of A ,B C and D $A=1111111110001100111010$ $B=101111110111100000000$ $C=1000000011001100$ $D=0100000001101100$