On Wed, Jun 18, 2008 at 8:26 AM, buyoppy <[EMAIL PROTECTED]> wrote: >> Try this implementation, which I have not tested (or >> even compiled).
(I realised subsequently that it reads past the end of the buffer if system memory is low and the input buffer was less than PLANB_BUF_SIZE; oops). > Thanks for your code, which may be useful when I would > have miss-erased zip extension of an archive. > But I mean 'encrypted' (NOT 'compressed') data. > Thanks. A common characteristic of encrypted data is that it has a low degree of redundancy; the method for which I provided code performs a rudimentary test for redundancy in the data simply by attempting to compress it. If you want a better method of attacking the problem, and to be sure there are more sophisticated techniques, you will need to learn about information theory. James. -- To UNSUBSCRIBE, email to [EMAIL PROTECTED] with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
