Tweet
By the way vev. I see you're online I finally found the encryption scheme they were using.
However, it looks non-recoverable since y is random.
k, the encryption:
x = random number from 1 to 31
output binary 5 bit binary encoding of x
output x random bits
for each character a in the input string:
__b = binary encoding of a
__y = random number from 0 to 1
__output y
__if (y == 0)
____output flip1(b)
__if (y == 1)
____output flip2(b)
output x random bits
output = flipS(output)
done
flip1, given an 8 character string, outputs it in the order: 2,1,4,3,6,5,8,7
flip2, given an 8 character string, outputs it in the order: 3,4,1,2,7,8,5,6
flipS, given an input string, outputs it in reverse order.
Decryption is obvious, just very tedious, which is why we're letting the computer do it
x = random number from 1 to 31
output binary 5 bit binary encoding of x
output x random bits
for each character a in the input string:
__b = binary encoding of a
__y = random number from 0 to 1
__output y
__if (y == 0)
____output flip1(b)
__if (y == 1)
____output flip2(b)
output x random bits
output = flipS(output)
done
flip1, given an 8 character string, outputs it in the order: 2,1,4,3,6,5,8,7
flip2, given an 8 character string, outputs it in the order: 3,4,1,2,7,8,5,6
flipS, given an input string, outputs it in reverse order.
Decryption is obvious, just very tedious, which is why we're letting the computer do it
Comment