/* -*-c-*-
*
- * $Id: rabin.h,v 1.3 1999/12/22 15:50:29 mdw Exp $
+ * $Id$
*
* Miller-Rabin primality test
*
* 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
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 ------------------------------------------------*/
* 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@ --- *
*
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@ --- *