Module libplayrsa::primes

Functions

big_prime
extended_gcd	Extended Euclidean GCD algorithm Returns k, s,and t such that as + bt = k, where k is the gcd of a and b
invmod	Returns the multiplicative inverse of a modulo n.
is_prime
mod_exp
rsa_prime	An prime suitable for RSA with exponent e The prime p - 1 can't be a multiple of e