G'Day Bodo,
A descent solution here is just to update to the documentation,
since the man page says it generates a num bit prime but in certain
cases, it does not :-) (num < 15?)
Some mention to the randomness of the prime at low num might
also be worthy (if indeed there is some issue arou
On Fri, Jan 31, 2003 at 08:12:41AM +0100, Cameron Gregory via RT wrote:
> for num < 15 .. always get the same result.. and it's larger than
> expected...
Reason: The internal OpenSSL function 'probable_prime' (in
crypto/bn/bn_prime.c) uses a built-in list of small primes for sieving
out candidat
for num < 15 .. always get the same result.. and it's larger than
expected...
We are using small primes to verify the correctness of our system.
thanks,
Cameron
#include
#include
/*
* @author Cameron Gregory, http://www.bloke.com/
*/
char *me=NULL;
int debug=0;
int main(int argc, char
