3 * $Id: rabin.c,v 1.1 1999/11/19 13:17:57 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.1 1999/11/19 13:17:57 mdw
34 * Prime number generator and tester.
38 /*----- Header files ------------------------------------------------------*/
45 /*----- Main code ---------------------------------------------------------*/
47 /* --- @rabin_create@ --- *
49 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
50 * @mp *m@ = pointer to number to test
54 * Use: Precomputes some useful values for performing the
55 * Miller-Rabin probabilistic primality test.
58 void rabin_create(rabin
*r
, mp
*m
)
60 mp
*m1
= mp_sub(MP_NEW
, m
, MP_ONE
);
64 /* --- Find @r@ and @s@ --- */
66 mpmont_create(&r
->mm
, m
);
69 while (mp_step(&sc
)) {
75 r
->r
= mp_lsr(MP_NEW
, m1
, s
);
77 /* --- Compute %$(m - 1)R \bmod m$% --- */
79 r
->m1
= mpmont_mul(&r
->mm
, MP_NEW
, m1
, r
->mm
.r2
);
83 /* --- @rabin_destroy@ --- *
85 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
89 * Use: Disposes of a Rabin-Miller context when it's no longer
93 void rabin_destroy(rabin
*r
)
97 mpmont_destroy(&r
->mm
);
100 /* --- @rabin_test@ --- *
102 * Arguments: @rabin *r@ = pointer to Rabin-Miller context
103 * @mp *g@ = base to test the number against
105 * Returns: Either @PGEN_COMPOSITE@ if the test failed, or @PGEN_MAYBE@
108 * Use: Performs a single iteration of the Rabin-Miller primality
112 int rabin_test(rabin
*r
, mp
*g
)
115 mp
*dd
, *spare
= MP_NEW
;
117 int rc
= PGEN_COMPOSITE
;
119 /* --- Calculate %$y R = g^r R \bmod m$% --- *
121 * If %$y = 1$% or %$y = m - 1$% then %$m$% is prime. If course, note that
122 * @y@ here has an extra factor of %$R$%.
125 y
= mpmont_expr(&r
->mm
, g
, r
->r
);
126 if (MP_CMP(y
, ==, r
->mm
.r
) || MP_CMP(y
, ==, r
->m1
)) {
131 /* --- Now for the main loop --- *
133 * If %$y^{2^j} \ne m - 1$% for any %$0 \le j < s$% then %$m$% is
134 * composite. Of course, %$j = 0$% has already been tested.
137 for (j
= 1; j
< r
->s
; j
++) {
138 dd
= mpmont_mul(&r
->mm
, spare
, y
, y
); spare
= y
; y
= dd
;
139 if (MP_CMP(y
, ==, r
->mm
.r
))
141 if (MP_CMP(y
, ==, r
->m1
)) {
156 /*----- That's all, folks -------------------------------------------------*/