large file must be "compressed" in a secure manner before being
'' encrypted with a private (secret) key under a public-key cryptosystem
'' such as RSA.
''
'' The MD5 algorithm is designed to be quite fast on 32-bit machines. In
'' addition, the MD5 algorithm does not require any large substitution
'' tables; the algorithm can be coded quite compactly.
''
'' The MD5 algorithm is an extension of the MD4 message-digest algorithm
'' 1,2]. MD5 is slightly slower than MD4, but is more "conservative" in
'' design. MD5 was designed because it was felt that MD4 was perhaps
'' being adopted for use more quickly than justified by the existing
'' critical review; because MD4 was designed to be exceptionally fast,
'' it is "at the edge" in terms of risking successful cryptanalytic
'' attack. MD5 backs off a bit, giving up a little in speed for a much
'' greater likelihood of ultimate security. It incorporates some
'' suggestions made by various reviewers, and contains additional
'' optimizations. The MD5 algorithm is being placed in the public domain
'' for review and possible adoption as a standard.
''
'' RFC Author:
'' Ronald L.Rivest
'' Massachusetts Institute of Technology
'' Laboratory for Computer Science
'' NE43 -324545 Technology Square
'' Cambridge, MA 02139-1986
'' Phone: (617) 253-5880
'' EMail: Rivest@ theory.lcs.mit.edu
''
''
''
'' CHANGE HISTORY:
''
'' 0.1.0 RMH 1999/12/29 Original version
''
''
''=
''= Class Constants
''=
Private Const OFFSET_4 = 4294967296#
Private Const MAXINT_4 = 2147483