Computes greatest common divisor.
Extracts the seed value of the pseudorandom number generator from the context structure.
Generates a random probable prime number of the specified bitlength.
The functions described in this section refer to RSA primitives.
The application code for conducting a typical RSA encryption must perform the following sequence of operations, starting with building of a crypto system:
Carries out the RSA-SSA signature generation scheme of PKCS#1 v1.5 .
Performs the DSA digital signature signing operation.
Retrieves elliptic curve domain parameters over GF(p).
Sets private and/or public keys of the elliptic cryptosystem over GF(p).
Enables the use of base point-based pre-computed tables of standard elliptic curves.
Copies one point to another.