SILC Core Library SILC Auth API SILC Channel API SILC Command API SILC ID API SILC ID Cache API SILC Modes SILC Notify API SILC Packet API SILC Argument API SILC Private API SILC Math Library SILC Math API SILC MP API SILC SFTP Library SILC SFTP API SILC SFTP Filesystems SILC Utility Library SILC Buffer API SILC Buffer Format API SILC Buffer Utility API SILC Hash Table API SILC Log and Debug API SILC Memory API SILC Mutex API SILC Thread API SILC Net API SILC Schedule API SILC Socket Connection API SILC Protocol API SILC Util API SILC Zip API SILC List API SILC Dynamic List API SILC Key Exchange Library SILC SKE API SILC SKE Status SILC Client Library SILC Client API SILC Crypto Library SILC Cipher API SILC Hash API SILC HMAC API SILC PKCS API SILC RNG API
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.
>> SilcMathAPI >> silc_math_gen_prime >> silc_math_prime_test