cryptographically secure?

malik.hammoutene at malik.hammoutene at
Thu Sep 16 15:49:31 CEST 2004

Thank you for your answer.

What I want to know by saying "cryptographically secure", is not if one can
easily determine the seed from samples or not. The question is: EVEN if the seed
is "cryptographically secure", are the random functions of GMP
"cryptographically secure"? Is it possible for anybody to determine the
algorithm from samples?

It's the difference between cryptographic and algorithmic...

Best regards,


PS: sorry for my english ;o)

> 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.
> Dave.
> 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