Reworking for new prime-search system. Add function for working out how

[u/mdw/catacomb] / rabin.h

diff --git a/rabin.h b/rabin.h
index a161fa9..fca099d 100644 (file)
--- a/rabin.h
+++ b/rabin.h
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: rabin.h,v 1.2 1999/12/10 23:29:48 mdw Exp $
+ * $Id: rabin.h,v 1.3 1999/12/22 15:50:29 mdw Exp $
  *
  * Miller-Rabin primality test
  *
@@ -30,6 +30,10 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: rabin.h,v $
+ * Revision 1.3  1999/12/22 15:50:29  mdw
+ * Reworking for new prime-search system.  Add function for working out how
+ * many iterations to use for a particular number.
+ *
  * Revision 1.2  1999/12/10 23:29:48  mdw
  * Change header file guard names.
  *
@@ -55,8 +59,8 @@
 #  include "mpmont.h"
 #endif
 
-#ifndef CATACOMB_PGEN_H
-#  include "pgen.h"
+#ifndef CATACOMB_PFILT_H
+#  include "pfilt.h"
 #endif
 
 /*----- Data structures ---------------------------------------------------*/
@@ -100,7 +104,7 @@ extern void rabin_destroy(rabin */*r*/);
  * Arguments:  @rabin *r@ = pointer to Rabin-Miller context
  *             @mp *g@ = base to test the number against
  *
- * Returns:    Either @PGEN_COMPOSITE@ if the test failed, or @PGEN_MAYBE@
+ * Returns:    Either @PGEN_FAIL@ if the test failed, or @PGEN_TRY@
  *             if it succeeded.
  *
  * Use:                Performs a single iteration of the Rabin-Miller primality
@@ -109,6 +113,18 @@ extern void rabin_destroy(rabin */*r*/);
 
 extern int rabin_test(rabin */*r*/, mp */*g*/);
 
+/* --- @rabin_iters@ --- *
+ *
+ * Arguments:  @unsigned len@ = number of bits in value
+ *
+ * Returns:    Number of iterations recommended.
+ *
+ * Use:                Returns the recommended number of iterations to ensure that a
+ *             number with @len@ bits is really prime.
+ */
+
+extern int rabin_iters(unsigned /*len*/);
+
 /*----- That's all, folks -------------------------------------------------*/
 
 #ifdef __cplusplus