(In reply to
observation & idea by Larry)
FOR i = 1 TO LEN(s$) STEP 2
IF MID$(s$, i, 1) = " " THEN
PRINT " ";
ELSE
PRINT CHR$(ASC(MID$(s$, i, 1)) XOR (ASC(MID$(s$, i + 1, 1)) AND 31));
END IF
NEXT
PRINT
finds the words. It exclusively ORs the lowest 5 bits of each pair of letters (thanks Larry for pointing out all the groups of letters had an even number of letters). The resulting plaintext comes out to
Xor Is Half This Snake
However, I have no idea of the significance of this for a 10-letter word.
|
|
Posted by Charlie
on 2005-10-22 19:02:46 |
Ahhh! -- decryption
