--- pgp/src/genprime.h	2018/04/24 16:37:53	1.1.1.1
+++ pgp/src/genprime.h	2018/04/24 16:45:24	1.1.1.7
@@ -14,19 +14,8 @@
 	NOTE:  This assumes previous inclusion of "mpilib.h"
 */
 
-extern word16 primetable[]; /* table of small primes, zero-terminated.*/
-
-boolean primetest(unitptr p);
-	/* Returns TRUE iff p is a prime. */
-
-int nextprime(unitptr p);
-	/* Find next higher prime starting at p, returning result in p. */
-
-void randombits(unitptr p,short nbits);
-	/* Make a random unit array p with nbits of precision. */
-
 int randomprime(unitptr p,short nbits);
-	/* Makes a "random" prime p with nbits significant bits of precision. */
+/* Makes a "random" prime p with nbits significant bits of precision. */
 
 void mp_gcd(unitptr result,unitptr a,unitptr n);
 	/* Computes greatest common divisor via Euclid's algorithm. */
@@ -34,8 +23,3 @@ void mp_gcd(unitptr result,unitptr a,uni
 void mp_inv(unitptr x,unitptr a,unitptr n);
 	/* Euclid's algorithm extended to compute multiplicative inverse.
 	   Computes x such that a*x mod n = 1, where 0<a<n */
-
-int mp_sqrt(unitptr quotient,unitptr dividend); 
-	/* Quotient is returned as the square root of dividend. */
-
-