Re: [Caml-list] portablility of random.mli in the stdlib

[Andrei Formiga <andrei.formiga@gmail.com>]

Yes, the RNG algorithm changed from 3.11 (linear feedback shift
register) to 3.12 (a lagged Fibonacci with some adaptations). Neither
are suitable for use with cryptography.

-- 
[]s, Andrei Formiga


2011/4/30 Christophe Raffalli <craff73@gmail.com>:
> Le 30/04/11 13:26, Török Edwin a écrit :
>> Why should a random generator give the same results over multiple
>> versions and architectures?
> To be able to replay a game on various architecture saving only the seed
> and the user movement (which is very small).
>> Starting from same seed is useful only for debugging.
> This is really untrue in a lot of applications for instance in cryptography.
> But I do not know if random.ml is good enough for assymetric cryptography
> (where the secret key in the seed and the coding is simply xor with a
> random sequence of bit)
> This require not only passing all randomness test, but also making it
> hard to recover the key from
> a generated sequence of random bits.
>
> Cheers,
> Christophe
>
>
>