X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/dfdacfdcd7e3376072506d6bdf69271a0e6bd2e0..f0c52873e4c1e3a16bb2d5a086df2526f698e4ac:/rabin.h

diff --git a/rabin.h b/rabin.h
index fca099d..a491625 100644
--- a/rabin.h
+++ b/rabin.h
@@ -1,13 +1,13 @@
 /* -*-c-*-
  *
- * $Id: rabin.h,v 1.3 1999/12/22 15:50:29 mdw Exp $
+ * $Id$
  *
  * Miller-Rabin primality test
  *
  * (c) 1999 Straylight/Edgeware
  */
 
-/*----- Licensing notice --------------------------------------------------* 
+/*----- Licensing notice --------------------------------------------------*
  *
  * This file is part of Catacomb.
  *
@@ -15,33 +15,18 @@
  * it under the terms of the GNU Library General Public License as
  * published by the Free Software Foundation; either version 2 of the
  * License, or (at your option) any later version.
- * 
+ *
  * Catacomb is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  * GNU Library General Public License for more details.
- * 
+ *
  * You should have received a copy of the GNU Library General Public
  * License along with Catacomb; if not, write to the Free
  * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
  * MA 02111-1307, USA.
  */
 
-/*----- 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.
- *
- * Revision 1.1  1999/11/19 13:17:57  mdw
- * Prime number generator and tester.
- *
- */
-
 #ifndef CATACOMB_RABIN_H
 #define CATACOMB_RABIN_H
 
@@ -69,7 +54,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 ------------------------------------------------*/
@@ -79,13 +64,13 @@ typedef struct rabin {
  * Arguments:	@rabin *r@ = pointer to Rabin-Miller context
  *		@mp *m@ = pointer to number to test
  *
- * Returns:	---
+ * Returns:	Zero on success, nonzero for failure.
  *
  * Use:		Precomputes some useful values for performing the
  *		Miller-Rabin probabilistic primality test.
  */
 
-extern void rabin_create(rabin */*r*/, mp */*m*/);
+extern int rabin_create(rabin */*r*/, mp */*m*/);
 
 /* --- @rabin_destroy@ --- *
  *
@@ -99,18 +84,20 @@ extern void rabin_create(rabin */*r*/, mp */*m*/);
 
 extern void rabin_destroy(rabin */*r*/);
 
-/* --- @rabin_test@ --- *
+/* --- @rabin_test@, @rabin_rtest@ --- *
  *
  * 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
- *		test.
+ *		test.  The @rtest@ variant assumes that %$g$% is either
+ *		already in Montgomery representation, or you don't care.
  */
 
+extern int rabin_rtest(rabin */*r*/, mp */*g*/);
 extern int rabin_test(rabin */*r*/, mp */*g*/);
 
 /* --- @rabin_iters@ --- *