3 * $Id: mpcrt.c,v 1.3 2000/10/08 12:11:22 mdw Exp $
5 * Chinese Remainder Theorem computations (Gauss's algorithm)
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.3 2000/10/08 12:11:22 mdw
34 * Use @MP_EQ@ instead of @MP_CMP@.
36 * Revision 1.2 1999/12/10 23:22:32 mdw
37 * Interface changes for suggested destinations. Use Barrett reduction.
39 * Revision 1.1 1999/11/22 20:50:57 mdw
40 * Add support for solving Chinese Remainder Theorem problems.
44 /*----- Header files ------------------------------------------------------*/
48 #include "mpbarrett.h"
50 /*----- Main code ---------------------------------------------------------*/
52 /* --- @mpcrt_create@ --- *
54 * Arguments: @mpcrt *c@ = pointer to CRT context
55 * @mpcrt_mod *v@ = pointer to vector of moduli
56 * @size_t k@ = number of moduli
57 * @mp *n@ = product of all moduli (@MP_NEW@ if unknown)
61 * Use: Initializes a context for solving Chinese Remainder Theorem
62 * problems. The vector of moduli can be incomplete. Omitted
63 * items must be left as null pointers. Not all combinations of
64 * missing things can be coped with, even if there is
65 * technically enough information to cope. For example, if @n@
66 * is unspecified, all the @m@ values must be present, even if
67 * there is one modulus with both @m@ and @n@ (from which the
68 * product of all moduli could clearly be calculated).
71 void mpcrt_create(mpcrt
*c
, mpcrt_mod
*v
, size_t k
, mp
*n
)
75 /* --- Simple initialization things --- */
80 /* --- Work out @n@ if I don't have it already --- */
86 for (i
= 1; i
< k
; i
++)
87 n
= mp_mul(n
, n
, v
[i
].m
);
90 /* --- A quick hack if %$k = 2$% --- */
94 /* --- The %$n / n_i$% values are trivial in this case --- */
97 v
[0].n
= MP_COPY(v
[1].m
);
99 v
[1].n
= MP_COPY(v
[0].m
);
101 /* --- Now sort out the inverses --- *
103 * @mp_gcd@ will ensure that the first argument is negative.
106 if (!v
[0].ni
&& !v
[1].ni
) {
107 mp_gcd(0, &v
[0].ni
, &v
[1].ni
, v
[0].n
, v
[1].n
);
108 v
[0].ni
= mp_add(v
[0].ni
, v
[0].ni
, v
[1].n
);
118 x
= mp_mul(MP_NEW
, v
[j
].n
, v
[j
].ni
);
119 x
= mp_sub(x
, x
, MP_ONE
);
120 mp_div(&x
, 0, x
, v
[i
].n
);
125 /* --- Set up the Barrett context --- */
127 mpbarrett_create(&c
->mb
, n
);
129 /* --- Walk through filling in @n@, @ni@ and @nnir@ --- */
131 for (i
= 0; i
< k
; i
++) {
133 mp_div(&v
[i
].n
, 0, n
, v
[i
].m
);
135 mp_gcd(0, &v
[i
].ni
, 0, v
[i
].n
, v
[i
].m
);
137 v
[i
].nni
= mp_mul(MP_NEW
, v
[i
].n
, v
[i
].ni
);
145 /* --- @mpcrt_destroy@ --- *
147 * Arguments: @mpcrt *c@ - pointer to CRT context
151 * Use: Destroys a CRT context, releasing all the resources it holds.
154 void mpcrt_destroy(mpcrt
*c
)
158 for (i
= 0; i
< c
->k
; i
++) {
159 if (c
->v
[i
].m
) mp_drop(c
->v
[i
].m
);
160 if (c
->v
[i
].n
) mp_drop(c
->v
[i
].n
);
161 if (c
->v
[i
].ni
) mp_drop(c
->v
[i
].ni
);
162 if (c
->v
[i
].nni
) mp_drop(c
->v
[i
].nni
);
164 mpbarrett_destroy(&c
->mb
);
167 /* --- @mpcrt_solve@ --- *
169 * Arguments: @mpcrt *c@ = pointer to CRT context
170 * @mp *d@ = fake destination
171 * @mp **v@ = array of residues
173 * Returns: The unique solution modulo the product of the individual
174 * moduli, which leaves the given residues.
176 * Use: Constructs a result given its residue modulo an array of
177 * coprime integers. This can be used to improve performance of
178 * RSA encryption or Blum-Blum-Shub generation if the factors
179 * of the modulus are known, since results can be computed mod
180 * each of the individual factors and then combined at the end.
181 * This is rather faster than doing the full-scale modular
185 mp
*mpcrt_solve(mpcrt
*c
, mp
*d
, mp
**v
)
191 for (i
= 0; i
< c
->k
; i
++) {
192 x
= mp_mul(x
, c
->v
[i
].nni
, v
[i
]);
193 x
= mpbarrett_reduce(&c
->mb
, x
, x
);
198 a
= mpbarrett_reduce(&c
->mb
, a
, a
);
204 /*----- Test rig ----------------------------------------------------------*/
208 static int verify(size_t n
, dstr
*v
)
210 mpcrt_mod
*m
= xmalloc(n
* sizeof(mpcrt_mod
));
211 mp
**r
= xmalloc(n
* sizeof(mp
*));
217 for (i
= 0; i
< n
; i
++) {
218 r
[i
] = *(mp
**)v
[2 * i
].buf
;
219 m
[i
].m
= *(mp
**)v
[2 * i
+ 1].buf
;
224 a
= *(mp
**)v
[2 * n
].buf
;
226 mpcrt_create(&c
, m
, n
, 0);
227 b
= mpcrt_solve(&c
, MP_NEW
, r
);
230 fputs("\n*** failed\n", stderr
);
231 fputs("n = ", stderr
);
232 mp_writefile(c
.mb
.m
, stderr
, 10);
233 for (i
= 0; i
< n
; i
++) {
234 fprintf(stderr
, "\nr[%u] = ", i
);
235 mp_writefile(r
[i
], stderr
, 10);
236 fprintf(stderr
, "\nm[%u] = ", i
);
237 mp_writefile(m
[i
].m
, stderr
, 10);
238 fprintf(stderr
, "\nN[%u] = ", i
);
239 mp_writefile(m
[i
].n
, stderr
, 10);
240 fprintf(stderr
, "\nM[%u] = ", i
);
241 mp_writefile(m
[i
].ni
, stderr
, 10);
243 fputs("\nresult = ", stderr
);
244 mp_writefile(b
, stderr
, 10);
245 fputs("\nexpect = ", stderr
);
246 mp_writefile(a
, stderr
, 10);
251 for (i
= 0; i
< n
; i
++)
258 assert(mparena_count(MPARENA_GLOBAL
) == 0);
262 static int crt1(dstr
*v
) { return verify(1, v
); }
263 static int crt2(dstr
*v
) { return verify(2, v
); }
264 static int crt3(dstr
*v
) { return verify(3, v
); }
265 static int crt4(dstr
*v
) { return verify(4, v
); }
266 static int crt5(dstr
*v
) { return verify(5, v
); }
268 static test_chunk tests
[] = {
269 { "crt-1", crt1
, { &type_mp
, &type_mp
,
271 { "crt-2", crt2
, { &type_mp
, &type_mp
,
274 { "crt-3", crt3
, { &type_mp
, &type_mp
,
278 { "crt-4", crt4
, { &type_mp
, &type_mp
,
283 { "crt-5", crt5
, { &type_mp
, &type_mp
,
292 int main(int argc
, char *argv
[])
295 test_run(argc
, argv
, tests
, SRCDIR
"/tests/mpcrt");
301 /*----- That's all, folks -------------------------------------------------*/