Jakub Narebski wrote: > > Why not borrow one of algorithms, e.g. taus[1] from GSL (GNU > Scientific Library)? > > If I understand "Random Number Generator Performance" chapter in GSL > Manual it is of comparable performance of the above BSD `rand` > generator, and is of simulation quality. > > [1] maximally equidistributed combined Tausworthe generator by L'Ecuyer > Interesting paper (the algorithm is on page 8): http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=F2BD39FF5C24221B424E12D9ED4E68B7?doi=10.1.1.43.4155&rep=rep1&type=pdf The reason I suggested SHA-1 is because we already have SHA-1 code involved (in fact, we even have a bunch of precalculated SHA-1s available to us) and performance matters not one iota in this application. -hpa -- H. Peter Anvin, Intel Open Source Technology Center I work for Intel. I don't speak on their behalf. -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html