🚀 go-pugleaf

<<<<
<  For better results you should not always start at the first byte of
< the files -- lseek in a random amount.  Depending on your security needs
< you could select a single file that is unchanging, a spelling dictionary
< might be adequate.  What becomes the secret key is where in the file you
< start from.  Either send that information or have a shared, secret function
< that generates the same start position for sender and receiver.

Better results for who? If you have a 100 Mbyte dictionary then you only have
to search through 100 million keys for an exhaustive search. Thats trivial.
Plus the non random nature of a dictionary can also be used to break it.


John Eaton
!hplabs!hp-pcd!john