in reply to Cryptographic Random Numbers

There are several strata of pseudo-random number generators (PRNG). For 99% of the requirements performed in Perl, the built-in rand() works just fine. It is even smart enough to use an internally defined seeding strategy if no seeding was already performed, usually out-doing anyone's naive code that tries to mix $$ ^ time().

What you are recommending is a high-cost solution to fulfill the last 1% of PRNG users. Crypto-hard PRNG, as you say, needs to incorporate feedback from other available entropy sources. These perturb the normal chains so that even knowing the past history of generated numbers won't help in predicting the next number.

However, I have to point out two weaknesses here.

I won't even discuss runtime costs, because perhaps there are some magic ways of gaining entropy for free.

I agree with your sentiment: a standard for accessing CPRNG resources is desirable, but not appropriate within the Perl interpreter.

--
[ e d @ h a l l e y . c c ]