This is no simple XOR algorithm. It is a double cipher XOR algorithm that uses a sophisticated method to alter a given root key. From a given set of random values, there is no way of knowing the number of values inserted into the modified key.I bet a spook could crack this with less than 1K of known plaintext. "double XOR" is just reducible to XOR. And as tilly already said, XOR is "seekret decoder ring" stuff.
Your code is worthless to me, and worthless to anyone I have influence on. And that's a pretty large set of the audience here. Please stop bragging -- it merely makes you look more foolish on each round.
-- Randal L. Schwartz, Perl hacker
In reply to Re: Re: Re (tilly) 1: CipherText
by merlyn
in thread CipherText
by NodeReaper
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |