I just finished reading Applied Cryptography and in the very beginning Bruce talks about XOR and how it is an embarrassment of an algorithm. I was wondering if an implementation of XOR with a sliding window, a 32 byte key, and 16 rounds is also a simple task to decrypt for a cryptanalysist.
Thanks,
MadCow