[erlang-questions] All possible internal states of Erlang/OTP random module are practically computable

Jesper Louis Andersen <>
Thu Dec 25 03:32:28 CET 2014


A quick guess would be no. I'm pretty sure such a solution would have two
problems:

* It would not pass the necessary statistical tests well enough.
* It would be considerably slower than appropriating a PRNG made for the
purpose.

On Wed Dec 24 2014 at 11:55:35 AM Eric Pailleau <>
wrote:

> ____
> make_ref()
>
> Returns an almost unique reference.
>
> The returned reference will reoccur after approximately 2^82 calls;
> therefore it is unique enough for most practical purposes.
> ____
>
> hi,
> could this function a base for a better non cryptographic  random
> generator ?
> phash2 on such make_ref() value does not help with 2^32 cycle...
> regards
>
>
>
>
> « Envoyé depuis mon mobile » Eric
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20141225/85b9d223/attachment.html>


More information about the erlang-questions mailing list