At 11:25 AM -0400 on 10/26/01, Edwards, Waverly wrote:


>There are small algorithms if you dont want to spend half you life making
>foolproof code.  If your concerned with the average person, they'll probably
>try little more than an XOR to unencrypt the code.  If you're concerned with
>hackers, you'd be better off using a well known (but complex) algorithm
>
>Here is a small one.
>
>http://www.ecst.csuchico.edu/~atman/Crypto/code/tea-encryption.alg.html

Thanks, I don't have a clue as to how that code works but I'll see if 
I can figure it out.  That page doesn't give any info on what 
parameters it takes.

I have found a few other pages that go into it further, maybe I can port it.
-- 
Heather Donahue
--
non sum qualis eram