8#ifndef BOTAN_NUMBER_THEORY_H_
9#define BOTAN_NUMBER_THEORY_H_
11#include <botan/bigint.h>
15class RandomNumberGenerator;
95 const BigInt& modulus);
184 RandomNumberGenerator& rng,
186 bool is_random = false);
197inline
bool BOTAN_DEPRECATED("Use
is_prime")
201inline bool BOTAN_DEPRECATED(
"Use is_prime")
205inline bool BOTAN_DEPRECATED(
"Use is_prime")
222 const BigInt& coprime = 0,
224 size_t equiv_mod = 2,
237 RandomNumberGenerator& prime_test_rng,
239 const BigInt& coprime,
262 BigInt& p_out, BigInt& q_out,
263 size_t pbits,
size_t qbits);
279 BigInt& p_out, BigInt& q_out,
280 size_t pbits,
size_t qbits,
281 const
std::vector<uint8_t>& seed,
#define BOTAN_PUBLIC_API(maj, min)
#define BOTAN_DEPRECATED_API(msg)
BigInt power_mod(const BigInt &base, const BigInt &exp, const BigInt &mod)
BigInt inverse_euclid(const BigInt &x, const BigInt &modulus)
BigInt random_prime(RandomNumberGenerator &rng, size_t bits, const BigInt &coprime, size_t equiv, size_t modulo, size_t prob)
BigInt lcm(const BigInt &a, const BigInt &b)
BigInt square(const BigInt &x)
size_t low_zero_bits(const BigInt &n)
BigInt abs(const BigInt &n)
const size_t PRIME_TABLE_SIZE
word monty_inverse(word a)
bool is_prime(const BigInt &n, RandomNumberGenerator &rng, size_t prob, bool is_random)
bool quick_check_prime(const BigInt &n, RandomNumberGenerator &rng)
bool generate_dsa_primes(RandomNumberGenerator &rng, BigInt &p, BigInt &q, size_t pbits, size_t qbits, const std::vector< uint8_t > &seed_c, size_t offset)
BigInt ct_inverse_mod_odd_modulus(const BigInt &n, const BigInt &mod)
BigInt generate_rsa_prime(RandomNumberGenerator &keygen_rng, RandomNumberGenerator &prime_test_rng, size_t bits, const BigInt &coprime, size_t prob)
BigInt mul_sub(const BigInt &a, const BigInt &b, const BigInt &c)
bool verify_prime(const BigInt &n, RandomNumberGenerator &rng)
BigInt gcd(const BigInt &a, const BigInt &b)
BigInt ressol(const BigInt &x, const BigInt &p)
BigInt normalized_montgomery_inverse(const BigInt &a, const BigInt &p)
BigInt is_perfect_square(const BigInt &C)
BigInt sub_mul(const BigInt &a, const BigInt &b, const BigInt &c)
int32_t jacobi(const BigInt &a, const BigInt &n)
BigInt random_safe_prime(RandomNumberGenerator &rng, size_t bits)
BigInt inverse_mod(const BigInt &n, const BigInt &mod)
size_t almost_montgomery_inverse(BigInt &result, const BigInt &a, const BigInt &p)
BigInt mul_add(const BigInt &a, const BigInt &b, const BigInt &c)
bool check_prime(const BigInt &n, RandomNumberGenerator &rng)