[Haskell-cafe] Re: True Random Numbers

[Alex Rozenshteyn]

The Rand monad you linked seems to be a step in the right direction for what
I want, but it uses getStdGen, which appears to end up using cpu time to
seed the generator.

On Sat, Apr 3, 2010 at 9:21 AM, Ertugrul Soeylemez <es at ertes.de> wrote:

> Matthew Hayden <mrehayden at googlemail.com> wrote:
>
> > What's wrong with the System.Random.StdGen implementation of
> > RandomGen?[1] (I'm not sure if it's cryptographically safe)
>
> It's a poor PRNG.  And no, it's not anywhere near suitable for
> cryptographic applications.
>
>
> > Someone (Cale IIRC) has already implemented a Rand monad[2] which is
> > like a state monad but it keeps a RandomGen instead.
>
>   http://hackage.haskell.org/package/MonadRandom
>
>   by "Cale Gibbard and others"
>
>
> Greets,
> Ertugrul
>
>
> --
> nightmare = unsafePerformIO (getWrongWife >>= sex)
> http://blog.ertes.de/
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>



-- 
         Alex R
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100403/05c70cd1/attachment.html