More primes and primality testing

1 files changed, 8 insertions, 2 deletions

diff --git a/primes.h b/primes.h
index 61e5fc7..744fa3e 100644
--- a/primes.h
+++ b/primes.h
@@ -11,9 +11,15 @@ void fillsmallprimes();
 //for use in RSA (pass target number of bits of N)
 std::pair<Bigint,Bigint> genprimepair(int nbits);
 
-//finds random in range [low,high]; throws domain_error if no prime found
+//finds random in range [low,high]; throws range_error("No primes") if no prime found
 //Will call fillsmallprimes() if not yet done
 Bigint randprime(const Bigint &low,const Bigint &high);
 
+//checks Fermat [pseudo- or actual] primality
+bool strongPseudoPrime2(const Bigint &n);
+
+//checks Lucas [pseudo- or actual] primality
+bool strongLucasPrime(const Bigint &n,int D,int P,int Q);
+
 //checks primality
-bool bailliePSW(const Bigint&);
+bool bailliePSW(const Bigint &n);