In message <[EMAIL PROTECTED]> on Wed, 24 Sep 2003 11:38:37 -0700, "David Schwartz"
<[EMAIL PROTECTED]> said:
davids> > It is, of course, trivial to prove that anything with
davids> > arbitrary length input and fixed length output is not
davids> > reversible. I missed the rest of this discussion though :-)
davids>
davids> Nonsense. See US patent 5,533,051 (Compression of
davids> Random Data) and 5,488,364 (Recursive Data Compression).
davids> Basically, you separate the ones from the zeroes and compress
davids> them independently.
Unless this is a joke, you might want to think about what "fixed
length output" means. For SHA-1, it means 20 octets of output. No
more, no less, independent of the length of the input.
--
Richard Levitte \ Tunnlandsvägen 3 \ [EMAIL PROTECTED]
[EMAIL PROTECTED] \ S-168 36 BROMMA \ T: +46-8-26 52 47
\ SWEDEN \ or +46-708-26 53 44
Procurator Odiosus Ex Infernis -- [EMAIL PROTECTED]
Member of the OpenSSL development team: http://www.openssl.org/
Unsolicited commercial email is subject to an archival fee of $400.
See <http://www.stacken.kth.se/~levitte/mail/> for more info.
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
