cryptographically secure?

DTAshley at DTAshley at
Thu Sep 16 15:34:19 CEST 2004

The usual notion of cryptographic security in the case of something that uses a seed value and generates a new value, updating the seed, is that from a certain number of samples, one can't easily determine the seed (and of course, once the seed is determined, all future random numbers are easily generated).

It is usually a question of whether one has a computationally tractable way to predict future random numbers from a sequence of past random numbers.

I do not see any particular reason that the GMP random number functions would be secure in that sense.

Also, please define "cryptologically secure".  This is very ambiguous.


In a message dated 9/16/2004 4:21:44 AM Eastern Daylight Time, malik.hammoutene at writes:

>Good morning,
>I'm developping some cryptographic protocol and I'm using GMP. My question is to
>know if the random functions of GMP are cryptographically secure. Nothing is
>said in the documentation.
>I hope having an answer,
>Best Regards,
>M. Hammoutène,
>gmp-discuss mailing list
>gmp-discuss at

More information about the gmp-discuss mailing list