"Osma" == Osma Ahvenlampi [EMAIL PROTECTED] writes:
Osma Arnold G. Reinhold [EMAIL PROTECTED] writes:
1. Mr. Kelsey's argument that entropy should only be added in
large quanta is compelling, but I wonder if it goes far enough. I
would argue that entropy collected from different sources
"Arnold" == Arnold G Reinhold [EMAIL PROTECTED] writes:
Arnold I have found this discussion very stimulating and
Arnold enlightening. I'd like to make a couple of comments:
Arnold 1. Mr. Kelsey's argument that entropy should only be added in
Arnold large quanta is compelling, but I wonder
"Osma" == Osma Ahvenlampi [EMAIL PROTECTED] writes:
Osma Looking at this discussing going round and round, I'm very
Osma inclined to fetch the latest freeswan-snapshot, grep for
Osma /dev/random, and replace all reads with a routine that has it's
Osma own internal Yarrow-like SHA mixer that
"John" == John Denker [EMAIL PROTECTED] writes:
John At 10:09 AM 8/2/99 -0400, Paul Koning wrote:
1. Estimating entropy. Yes, that's the hard one. It's
orthogonal from everything else. /dev/random has a fairly simple
approach; Yarrow is more complex.
It's not c
"John" == John Denker [EMAIL PROTECTED] writes:
John At 01:50 PM 8/2/99 -0400, Paul Koning wrote:
I only remember a few proposals (2 or 3?) and they didn't seem to
be [unduly weak]. Or do you feel that what I've proposed is this
weak? If so, why? I've seen comment
"Paul" == Paul Koning [EMAIL PROTECTED] writes:
Paul 2. Pool size. /dev/random has a fairly small pool normally but
Paul can be made to use a bigger one. Yarrow argues that it makes
Paul no sense to use a pool larger than N bits if an N bit mixing
Paul function is used, so it
