1 #ifndef PRIMEGENERATOR_H
2 #define PRIMEGENERATOR_H
7 #include "../misc/randomness.h"
26 unsigned long long getPrime(
unsigned long long lowerBound,
unsigned long long upperBound,
double errorProbability);
39 unsigned long long potMod(
unsigned long long x,
unsigned long long b,
unsigned long long m);
bool isMillerRabinPrime(unsigned long long candidate, double errorProbability)
Miller-Rabin primality test.
unsigned long long potMod(unsigned long long x, unsigned long long b, unsigned long long m)
Calculates "x^b mod m".
unsigned long long getPrime(unsigned long long lowerBound, unsigned long long upperBound, double errorProbability)
Returns a number [lowerBound, upperBound] which is prime with probablity 1-errorProbability.
Generates numbers which are (most likely) prime numbers.