Re: Replace /dev/random input mix polynomial with Brent's xorgen?

["Theodore Ts'o" <tytso@mit.edu>]

On Sat, Dec 14, 2013 at 04:06:07AM -0500, George Spelvin wrote:
> Richard Brent extended some efficient XOR-based PRNGs designed by George
> Marsaglia into a family of "xorgen" generators which are efficent,
> non-sparse, maximal-period polynomials of length 64, 128, 256,... 4096
> bits.
> 
> Anyway, the algorithm boils down to
> 
> t1 = x[i-r];	t2 = x[i-s];
> t1 ^= t1 << a;	t2 ^= t2 << c;
> t1 ^= t1 >> b;	t2 ^= t2 >> d;
> x[i] = t1 ^ t2;
> 
> For various constants r = 2..128, s < r, and shifts a, b, c and d.
> Both 32- and 64-bit versions are included.


The mixing function doesn't have to be a good quality PRNG, since
that's not its function.  One of the things that is highly desirable,
though, is that it "smears" recently mixed in data across the entire
pool as quickly as possible.  The above algorithm is more efficient
because it only needs to touch two memory locations --- but for our
use case, we want to be able to read from multiple memory locations.

In particular, it's important that when we mix the hash back into pool
to prevent backtracking attacks, and extract from the pool again and
re-hash (see extract_entropy), it's important that when we mix in the
hash, it affects the portion of the pool that we rehash.  We could
work around this if we changed the mixing function, true, but I'm not
sure I see the benefit of making this change.

I'm much more inclined to think about changing how we generate random
numbers from the output pool by switching from using SHA to AES in
some one-way random function mode (i.e., such as the Davies-Meyer
construction), since that is where we are spending most of our CPU
time in the random driver at the moment.

Regards,

						- Ted