[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: (none)
On Wed, 20 Sep 1995, James A. Donald wrote:
> However the algorithm I described simply used less computation, but the
> overhead of continually doing MD5 is probably modest.
On a 486DX50 Solaris 2.4 I can do about 40,000 md5's per second.
(if input is < 56 bytes and contiguious).
With an mixing algorithm this fast, you could use it once per
byte and still have an acceptable RNG.
It is definitly my hash function of choice :-).
eric
--
Eric Young | Signature removed since it was generating
AARNet: [email protected] | more followups than the message contents :-)