3 * $Id: rabin.c,v 1.6 2001/06/16 12:56:38 mdw Exp $
5 * Miller-Rabin primality test
7 * (c) 1999 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.6 2001/06/16 12:56:38 mdw
34 * Fixes for interface change to @mpmont_expr@ and @mpmont_mexpr@.
36 * Revision 1.5 2000/10/08 12:11:22 mdw
37 * Use @MP_EQ@ instead of @MP_CMP@.
39 * Revision 1.4 2000/06/22 19:03:02 mdw
40 * Use the new @mp_odd@ function.
42 * Revision 1.3 1999/12/22 15:50:29 mdw
43 * Reworking for new prime-search system. Add function for working out how
44 * many iterations to use for a particular number.
46 * Revision 1.2 1999/12/10 23:29:48 mdw
47 * Change header file guard names.
49 * Revision 1.1 1999/11/19 13:17:57 mdw
50 * Prime number generator and tester.
54 /*----- Header files ------------------------------------------------------*/
57 #include "mpbarrett.h"
62 /*----- Main code ---------------------------------------------------------*/
64 /* --- @rabin_create@ --- *
66 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
67 * @mp *m@ = pointer to number to test
71 * Use: Precomputes some useful values for performing the
72 * Miller-Rabin probabilistic primality test.
75 void rabin_create(rabin
*r
, mp
*m
)
77 mp
*m1
= mp_sub(MP_NEW
, m
, MP_ONE
);
78 mpmont_create(&r
->mm
, m
);
79 r
->r
= mp_odd(MP_NEW
, m1
, &r
->s
);
80 r
->m1
= mp_sub(MP_NEW
, m
, r
->mm
.r
);
84 /* --- @rabin_destroy@ --- *
86 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
90 * Use: Disposes of a Rabin-Miller context when it's no longer
94 void rabin_destroy(rabin
*r
)
98 mpmont_destroy(&r
->mm
);
101 /* --- @rabin_test@ --- *
103 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
104 * @mp *g@ = base to test the number against
106 * Returns: Either @PGEN_FAIL@ if the test failed, or @PGEN_PASS@
109 * Use: Performs a single iteration of the Rabin-Miller primality
113 int rabin_test(rabin
*r
, mp
*g
)
116 mp
*dd
, *spare
= MP_NEW
;
120 /* --- Calculate %$y R = g^r R \bmod m$% --- *
122 * If %$y = 1$% or %$y = m - 1$% then %$m$% is prime. If course, note that
123 * @y@ here has an extra factor of %$R$%.
126 y
= mpmont_mul(&r
->mm
, MP_NEW
, g
, r
->mm
.r2
);
127 y
= mpmont_expr(&r
->mm
, y
, y
, r
->r
);
128 if (MP_EQ(y
, r
->mm
.r
) || MP_EQ(y
, r
->m1
)) {
133 /* --- Now for the main loop --- *
135 * If %$y^{2^j} \ne m - 1$% for any %$0 \le j < s$% then %$m$% is
136 * composite. Of course, %$j = 0$% has already been tested.
139 for (j
= 1; j
< r
->s
; j
++) {
140 dd
= mp_sqr(spare
, y
);
141 dd
= mpmont_reduce(&r
->mm
, dd
, dd
);
143 if (MP_EQ(y
, r
->mm
.r
))
145 if (MP_EQ(y
, r
->m1
)) {
160 /* --- @rabin_iters@ --- *
162 * Arguments: @unsigned len@ = number of bits in value
164 * Returns: Number of iterations recommended.
166 * Use: Returns the recommended number of iterations to ensure that a
167 * number with @len@ bits is really prime.
170 int rabin_iters(unsigned len
)
192 /* --- Binary search through the table --- */
195 q
= tab
+ (sizeof(tab
)/sizeof(tab
[0]));
200 if (len
>= p
[i
].b
&& len
< p
[i
+ 1].b
)
210 /*----- That's all, folks -------------------------------------------------*/