30 Apr
2003
30 Apr
'03
1:15 a.m.
At 03:42 PM 4/28/03 +0100, Peter Fairbrother wrote:
If you have perfect compression, and you encrypt a message which has been compressed, any decryption will look sensible.
You do understand that building this kind of compressor implies passing the Turing test, right? For the messages to be sensible, they have to have some underlying meaning that makes sense. This isn't just compression in the sense of fast implementations of statistical models of text....
Peter Fairbrother
--John Kelsey, kelsey.j@ix.netcom.com PGP: FA48 3237 9AD5 30AC EEDD BBC8 2A80 6948 4CAA F259