Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:20:18 ADT
Lewis McCarthy (lmccarth@cs.umass.edu)
Sun, 12 Jul 1998 23:32:07 -0400
Bill Frantz wrote:
>>> When we generate a random number, we compute enough MD5(entire pool || 8
>>> byte sequence counter) to meet fill the requested size. The 8 byte
>>> sequence counter is incremented for each new calculation.
Bram writes:
> Unfortunately that can result in hashing a large number of similar
> bitstrings, making those available is an attack most hash functions aren't
> really meant to withstand.
Pardon? I assume we are discussing cryptographic hash functions whose
designs are public. An attacker can certainly choose a large set of inputs,
hash them all, and examine the resulting hash values. In what sense is this
"an attack most hash functions aren't really meant to withstand"?
-Lewis
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:20:18 ADT