numpy performance and random numbers

[Peter Pearson]

On Sun, 20 Dec 2009 21:02:02 -0800, Rami Chowdhury wrote:
>
> On Dec 20, 2009, at 17:41 , Peter Pearson wrote:
>
>> Why not use a good cipher, such as AES, to generate a pseudorandom
>> bit stream by encrypting successive integers?  
>
> Isn't the Fortuna PRNG based around that approximate concept?

Yes, although the interesting part of Fortuna is its strategy for
entropy accumulation, which is (I think) not of interest to the
Original Poster.  In cryptology, one finds many places where a
statistically significant departure from random behavior would
be a publishable discovery.

-- 
To email me, substitute nowhere->spamcop, invalid->net.