SilcBool silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits,
                                 SilcBool verbose, SilcRng rng);

    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.  If the `rng' is NULL then global
    RNG is used, if non-NULL then `rng' is used to generate the random
    number number.