[Date Prev][Date Next]
[Chronological]
[Thread]
[Top]
lutil_entropy()
I commited what routine that should be good enough for one
type use keys (such as those needed for DIGEST-MD5
implementation).
The code uses, if available, /dev/urandom (or equivalent).
Otherwise is fallbacks to an algorithm suggested Phil Karn in
"practical randomness" discussions. Paraphasing: The worse
case is if that each 16-bytes is a MD5 hash of a counter.
As long as MD5 is a cryptograhically strong hash, this
should be fairly resistent to attack.
----
Kurt D. Zeilenga <kurt@boolean.net>
Net Boolean Incorporated <http://www.boolean.net/>