Copyright © 2001 - 2002 SILC Project SILC Project Website | SILC Toolkit Reference Manual

SILC Toolkit Reference Manual SILC Core Library SILC Authentication Interface SILC Channel Interface SILC Command Interface SILC ID Interface SILC ID Cache Interface SILC Modes SILC Notify Interface SILC Argument Interface SILC Private Message Interface Packet Protocol Interface SILC Math Library SILC MP Interface SILC Math Interface SILC SFTP Library SILC SFTP Interface SFTP Filesystems Interface SILC Utility Library SILC Buffer Interface SILC Buffer Format Interface SILC Hash Table Interface SILC Logging Interface SILC Memory Interface SILC Mutex Interface SILC Thread Interface SILC Network Interface SILC Schedule Interface SILC Socket Interface SILC Protocol Interface SILC Config Interface SILC File Util Interface SILC Util Interface SILC List Interface SILC Dynamic List Interface SILC Zip API SILC Key Exchange Library SILC SKE Interface SKE Status Types SKE Diffie Hellman Groups SKE Payloads SILC Client Library Using SILC Client Library Client Library Interface SILC Crypto Library Introduction to SILC RNG SILC RNG Interface SILC Cipher API SILC Hash API SILC HMAC API SILC PKCS API Resource Links SILC Project Website SILC Protocol Documentation SILC White Paper SILC FAQ
Function silc_math_gen_prime SYNOPSIS
        int silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 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

Copyright © 2001 - 2002 SILC Project SILC Project Website | SILC Toolkit Reference Manual