[erlang-questions] Speedy unsort:shuffle/1,2 ?

[Kenji Rikitake]

In the message <E2189946-F6B4-4A25-91E2-F3192B5E9614@REDACTED>
dated Mon, May 31, 2010 at 01:08:29PM +1200,
Richard O'Keefe <ok@REDACTED> writes:
> On May 30, 2010, at 7:53 PM, Kenji Rikitake wrote:
> >For a testing purpose, the RNG doesn't really have to be
> >cryptographycally safe; it only has to have a uniform distribution.
> 
> Where did "cryptographically safe" come from?

Mea Culpa. I mixed up the context - some articles in the thread
mentioned the RNG in crypto module.

> By better, I meant
>  - faster
>  - having better statistical properties

Agreed.

> >Anybody has implemented a NIF or port version of Mersenne Twister or  
> >SFMT?
> >http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html
> 
> and those are excellent examples of what I meant.

Understood.

Kenji Rikitake