Function silc_math_gen_prime
SYNOPSIS
int silc_math_gen_prime(SilcMPInt *prime, uint32 bits, bool verbose);
DESCRIPTION
Find appropriate prime. It generates a number by taking random bytes.
It then tests the number that it's not divisible by any of the small
primes and then it performs Fermat's prime test. I thank Rieks Joosten
(r.joosten@pijnenburg.nl) for such a good help with prime tests.
If argument verbose is TRUE this will display some status information
about the progress of generation.