Pollard's rho algorithm for computing discrete logs.

[u/mdw/catacomb] / rabin.h

diff --git a/rabin.h b/rabin.h
index fca099d..d57efcd 100644 (file)
--- a/rabin.h
+++ b/rabin.h
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: rabin.h,v 1.3 1999/12/22 15:50:29 mdw Exp $
+ * $Id: rabin.h,v 1.5 2000/07/09 21:32:16 mdw Exp $
  *
  * Miller-Rabin primality test
  *
@@ -30,6 +30,12 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: rabin.h,v $
+ * Revision 1.5  2000/07/09 21:32:16  mdw
+ * rabin_test: Correct error in comment.
+ *
+ * Revision 1.4  2000/06/17 11:52:48  mdw
+ * Typesetting fix.
+ *
  * 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.
@@ -69,7 +75,7 @@ typedef struct rabin {
   mpmont mm;                           /* Montgomery arithmetic context */
   size_t s;                            /* %$m = 2^s r + 1$% */
   mp *r;                               /* %$m = 2^s r + 1$% */
-  mp *m1;                              /* %$(m - 1)R \bmod m */
+  mp *m1;                              /* %$(m - 1)R \bmod m$% */
 } rabin;
 
 /*----- Functions provided ------------------------------------------------*/
@@ -104,7 +110,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_FAIL@ if the test failed, or @PGEN_TRY@
+ * Returns:    Either @PGEN_FAIL@ if the test failed, or @PGEN_PASS@
  *             if it succeeded.
  *
  * Use:                Performs a single iteration of the Rabin-Miller primality