d3409d5e |
1 | /* -*-c-*- |
2 | * |
4640a0dd |
3 | * $Id: mpmont.c,v 1.15 2001/06/16 13:00:20 mdw Exp $ |
d3409d5e |
4 | * |
5 | * Montgomery reduction |
6 | * |
7 | * (c) 1999 Straylight/Edgeware |
8 | */ |
9 | |
10 | /*----- Licensing notice --------------------------------------------------* |
11 | * |
12 | * This file is part of Catacomb. |
13 | * |
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. |
18 | * |
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. |
23 | * |
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, |
27 | * MA 02111-1307, USA. |
28 | */ |
29 | |
30 | /*----- Revision history --------------------------------------------------* |
31 | * |
32 | * $Log: mpmont.c,v $ |
4640a0dd |
33 | * Revision 1.15 2001/06/16 13:00:20 mdw |
34 | * Use the generic exponentiation functions. |
35 | * |
b096ec7f |
36 | * Revision 1.14 2001/02/22 09:04:26 mdw |
37 | * Cosmetic fix. |
38 | * |
f1140c41 |
39 | * Revision 1.13 2001/02/03 12:00:29 mdw |
40 | * Now @mp_drop@ checks its argument is non-NULL before attempting to free |
41 | * it. Note that the macro version @MP_DROP@ doesn't do this. |
42 | * |
52cdaca9 |
43 | * Revision 1.12 2000/10/08 15:48:35 mdw |
44 | * Rename Karatsuba constants now that we have @gfx_kmul@ too. |
45 | * |
032099d1 |
46 | * Revision 1.11 2000/10/08 12:04:27 mdw |
47 | * (mpmont_reduce, mpmont_mul): Cope with negative numbers. |
48 | * |
c9d4c30b |
49 | * Revision 1.10 2000/07/29 17:05:43 mdw |
50 | * (mpmont_expr): Use sliding window exponentiation, with a drop-through |
51 | * for small exponents to use a simple left-to-right bitwise routine. This |
52 | * can reduce modexp times by up to a quarter. |
53 | * |
d34decd2 |
54 | * Revision 1.9 2000/06/17 11:45:09 mdw |
55 | * Major memory management overhaul. Added arena support. Use the secure |
56 | * arena for secret integers. Replace and improve the MP management macros |
57 | * (e.g., replace MP_MODIFY by MP_DEST). |
58 | * |
01f6ed1a |
59 | * Revision 1.8 1999/12/22 15:55:00 mdw |
60 | * Adjust Karatsuba parameters. |
61 | * |
f5f35081 |
62 | * Revision 1.7 1999/12/11 01:51:14 mdw |
63 | * Use a Karatsuba-based reduction for large moduli. |
64 | * |
ef5f4810 |
65 | * Revision 1.6 1999/12/10 23:18:39 mdw |
66 | * Change interface for suggested destinations. |
67 | * |
52e4b041 |
68 | * Revision 1.5 1999/11/22 13:58:40 mdw |
69 | * Add an option to disable Montgomery reduction, so that performance |
70 | * comparisons can be done. |
71 | * |
93feaa6e |
72 | * Revision 1.4 1999/11/21 12:27:06 mdw |
73 | * Remove a division from the Montgomery setup by calculating |
74 | * %$R^2 \bmod m$% first and then %$R \bmod m$% by Montgomery reduction of |
75 | * %$R^2$%. |
76 | * |
79a34029 |
77 | * Revision 1.3 1999/11/21 11:35:10 mdw |
78 | * Performance improvement: use @mp_sqr@ and @mpmont_reduce@ instead of |
79 | * @mpmont_mul@ for squaring in exponentiation. |
80 | * |
17ad212e |
81 | * Revision 1.2 1999/11/19 13:17:26 mdw |
82 | * Add extra interface to exponentiation which returns a Montgomerized |
83 | * result. |
84 | * |
d3409d5e |
85 | * Revision 1.1 1999/11/17 18:02:16 mdw |
86 | * New multiprecision integer arithmetic suite. |
87 | * |
88 | */ |
89 | |
90 | /*----- Header files ------------------------------------------------------*/ |
91 | |
92 | #include "mp.h" |
93 | #include "mpmont.h" |
4640a0dd |
94 | #include "mpmont-exp.h" |
d3409d5e |
95 | |
52e4b041 |
96 | /*----- Tweakables --------------------------------------------------------*/ |
97 | |
98 | /* --- @MPMONT_DISABLE@ --- * |
99 | * |
100 | * Replace all the clever Montgomery reduction with good old-fashioned long |
101 | * division. |
102 | */ |
103 | |
104 | /* #define MPMONT_DISABLE */ |
105 | |
4640a0dd |
106 | /*----- Reduction and multiplication --------------------------------------*/ |
d3409d5e |
107 | |
108 | /* --- @mpmont_create@ --- * |
109 | * |
110 | * Arguments: @mpmont *mm@ = pointer to Montgomery reduction context |
111 | * @mp *m@ = modulus to use |
112 | * |
113 | * Returns: --- |
114 | * |
115 | * Use: Initializes a Montgomery reduction context ready for use. |
ef5f4810 |
116 | * The argument @m@ must be a positive odd integer. |
d3409d5e |
117 | */ |
118 | |
52e4b041 |
119 | #ifdef MPMONT_DISABLE |
120 | |
121 | void mpmont_create(mpmont *mm, mp *m) |
122 | { |
123 | mp_shrink(m); |
124 | mm->m = MP_COPY(m); |
125 | mm->r = MP_ONE; |
126 | mm->r2 = MP_ONE; |
f5f35081 |
127 | mm->mi = MP_ONE; |
52e4b041 |
128 | } |
129 | |
130 | #else |
131 | |
d3409d5e |
132 | void mpmont_create(mpmont *mm, mp *m) |
133 | { |
f5f35081 |
134 | size_t n = MP_LEN(m); |
d34decd2 |
135 | mp *r2 = mp_new(2 * n + 1, 0); |
f5f35081 |
136 | mp r; |
137 | |
ef5f4810 |
138 | /* --- Validate the arguments --- */ |
139 | |
140 | assert(((void)"Montgomery modulus must be positive", |
141 | (m->f & MP_NEG) == 0)); |
142 | assert(((void)"Montgomery modulus must be odd", m->v[0] & 1)); |
143 | |
d3409d5e |
144 | /* --- Take a copy of the modulus --- */ |
145 | |
146 | mp_shrink(m); |
147 | mm->m = MP_COPY(m); |
148 | |
f5f35081 |
149 | /* --- Determine %$R^2$% --- */ |
d3409d5e |
150 | |
f5f35081 |
151 | mm->n = n; |
152 | MPX_ZERO(r2->v, r2->vl - 1); |
153 | r2->vl[-1] = 1; |
d3409d5e |
154 | |
f5f35081 |
155 | /* --- Find the magic value @mi@ --- */ |
156 | |
157 | mp_build(&r, r2->v + n, r2->vl); |
158 | mm->mi = MP_NEW; |
159 | mp_gcd(0, 0, &mm->mi, &r, m); |
160 | mm->mi = mp_sub(mm->mi, &r, mm->mi); |
d3409d5e |
161 | |
162 | /* --- Discover the values %$R \bmod m$% and %$R^2 \bmod m$% --- */ |
163 | |
f5f35081 |
164 | mm->r2 = MP_NEW; |
165 | mp_div(0, &mm->r2, r2, m); |
166 | mm->r = mpmont_reduce(mm, MP_NEW, mm->r2); |
167 | MP_DROP(r2); |
d3409d5e |
168 | } |
169 | |
52e4b041 |
170 | #endif |
171 | |
d3409d5e |
172 | /* --- @mpmont_destroy@ --- * |
173 | * |
174 | * Arguments: @mpmont *mm@ = pointer to a Montgomery reduction context |
175 | * |
176 | * Returns: --- |
177 | * |
178 | * Use: Disposes of a context when it's no longer of any use to |
179 | * anyone. |
180 | */ |
181 | |
182 | void mpmont_destroy(mpmont *mm) |
183 | { |
184 | MP_DROP(mm->m); |
185 | MP_DROP(mm->r); |
186 | MP_DROP(mm->r2); |
f5f35081 |
187 | MP_DROP(mm->mi); |
d3409d5e |
188 | } |
189 | |
190 | /* --- @mpmont_reduce@ --- * |
191 | * |
192 | * Arguments: @mpmont *mm@ = pointer to Montgomery reduction context |
193 | * @mp *d@ = destination |
ef5f4810 |
194 | * @mp *a@ = source, assumed positive |
d3409d5e |
195 | * |
196 | * Returns: Result, %$a R^{-1} \bmod m$%. |
197 | */ |
198 | |
52e4b041 |
199 | #ifdef MPMONT_DISABLE |
200 | |
ef5f4810 |
201 | mp *mpmont_reduce(mpmont *mm, mp *d, mp *a) |
52e4b041 |
202 | { |
203 | mp_div(0, &d, a, mm->m); |
204 | return (d); |
205 | } |
206 | |
207 | #else |
208 | |
ef5f4810 |
209 | mp *mpmont_reduce(mpmont *mm, mp *d, mp *a) |
d3409d5e |
210 | { |
f5f35081 |
211 | size_t n = mm->n; |
212 | |
213 | /* --- Check for serious Karatsuba reduction --- */ |
214 | |
52cdaca9 |
215 | if (n > MPK_THRESH * 3) { |
f5f35081 |
216 | mp al; |
217 | mpw *vl; |
218 | mp *u; |
219 | |
220 | if (MP_LEN(a) >= n) |
221 | vl = a->v + n; |
222 | else |
223 | vl = a->vl; |
224 | mp_build(&al, a->v, vl); |
225 | u = mp_mul(MP_NEW, &al, mm->mi); |
226 | if (MP_LEN(u) > n) |
227 | u->vl = u->v + n; |
228 | u = mp_mul(u, u, mm->m); |
229 | d = mp_add(d, a, u); |
230 | mp_drop(u); |
231 | } |
d3409d5e |
232 | |
f5f35081 |
233 | /* --- Otherwise do it the hard way --- */ |
d3409d5e |
234 | |
d3409d5e |
235 | else { |
f5f35081 |
236 | mpw *dv, *dvl; |
237 | mpw *mv, *mvl; |
238 | mpw mi; |
239 | size_t k = n; |
240 | |
241 | /* --- Initial conditioning of the arguments --- */ |
242 | |
d34decd2 |
243 | a = MP_COPY(a); |
244 | if (d) |
245 | MP_DROP(d); |
246 | d = a; |
247 | MP_DEST(d, 2 * n + 1, a->f); |
248 | |
f5f35081 |
249 | dv = d->v; dvl = d->vl; |
250 | mv = mm->m->v; mvl = mm->m->vl; |
d3409d5e |
251 | |
f5f35081 |
252 | /* --- Let's go to work --- */ |
d3409d5e |
253 | |
f5f35081 |
254 | mi = mm->mi->v[0]; |
255 | while (k--) { |
256 | mpw u = MPW(*dv * mi); |
257 | MPX_UMLAN(dv, dvl, mv, mvl, u); |
258 | dv++; |
259 | } |
d3409d5e |
260 | } |
261 | |
f5f35081 |
262 | /* --- Wrap everything up --- */ |
d3409d5e |
263 | |
f5f35081 |
264 | memmove(d->v, d->v + n, MPWS(MP_LEN(d) - n)); |
265 | d->vl -= n; |
032099d1 |
266 | if (MPX_UCMP(d->v, d->vl, >=, mm->m->v, mm->m->vl)) |
267 | mpx_usub(d->v, d->vl, d->v, d->vl, mm->m->v, mm->m->vl); |
268 | if (d->f & MP_NEG) { |
269 | mpx_usub(d->v, d->vl, mm->m->v, mm->m->vl, d->v, d->vl); |
270 | d->f &= ~MP_NEG; |
271 | } |
f5f35081 |
272 | MP_SHRINK(d); |
d3409d5e |
273 | return (d); |
274 | } |
275 | |
52e4b041 |
276 | #endif |
277 | |
d3409d5e |
278 | /* --- @mpmont_mul@ --- * |
279 | * |
280 | * Arguments: @mpmont *mm@ = pointer to Montgomery reduction context |
281 | * @mp *d@ = destination |
ef5f4810 |
282 | * @mp *a, *b@ = sources, assumed positive |
d3409d5e |
283 | * |
284 | * Returns: Result, %$a b R^{-1} \bmod m$%. |
285 | */ |
286 | |
52e4b041 |
287 | #ifdef MPMONT_DISABLE |
288 | |
ef5f4810 |
289 | mp *mpmont_mul(mpmont *mm, mp *d, mp *a, mp *b) |
52e4b041 |
290 | { |
291 | d = mp_mul(d, a, b); |
292 | mp_div(0, &d, d, mm->m); |
293 | return (d); |
294 | } |
295 | |
296 | #else |
297 | |
ef5f4810 |
298 | mp *mpmont_mul(mpmont *mm, mp *d, mp *a, mp *b) |
d3409d5e |
299 | { |
52cdaca9 |
300 | if (mm->n > MPK_THRESH * 3) { |
ef5f4810 |
301 | d = mp_mul(d, a, b); |
302 | d = mpmont_reduce(mm, d, d); |
303 | } else { |
304 | mpw *dv, *dvl; |
305 | mpw *av, *avl; |
306 | mpw *bv, *bvl; |
307 | mpw *mv, *mvl; |
308 | mpw y; |
309 | size_t n, i; |
f5f35081 |
310 | mpw mi; |
ef5f4810 |
311 | |
312 | /* --- Initial conditioning of the arguments --- */ |
313 | |
314 | if (MP_LEN(a) > MP_LEN(b)) { |
315 | mp *t = a; a = b; b = t; |
316 | } |
317 | n = MP_LEN(mm->m); |
d3409d5e |
318 | |
ef5f4810 |
319 | a = MP_COPY(a); |
320 | b = MP_COPY(b); |
d34decd2 |
321 | MP_DEST(d, 2 * n + 1, a->f | b->f | MP_UNDEF); |
ef5f4810 |
322 | dv = d->v; dvl = d->vl; |
323 | MPX_ZERO(dv, dvl); |
324 | av = a->v; avl = a->vl; |
325 | bv = b->v; bvl = b->vl; |
326 | mv = mm->m->v; mvl = mm->m->vl; |
327 | y = *bv; |
328 | |
329 | /* --- Montgomery multiplication phase --- */ |
330 | |
331 | i = 0; |
f5f35081 |
332 | mi = mm->mi->v[0]; |
ef5f4810 |
333 | while (i < n && av < avl) { |
334 | mpw x = *av++; |
f5f35081 |
335 | mpw u = MPW((*dv + x * y) * mi); |
ef5f4810 |
336 | MPX_UMLAN(dv, dvl, bv, bvl, x); |
337 | MPX_UMLAN(dv, dvl, mv, mvl, u); |
338 | dv++; |
339 | i++; |
340 | } |
d3409d5e |
341 | |
ef5f4810 |
342 | /* --- Simpler Montgomery reduction phase --- */ |
d3409d5e |
343 | |
ef5f4810 |
344 | while (i < n) { |
f5f35081 |
345 | mpw u = MPW(*dv * mi); |
ef5f4810 |
346 | MPX_UMLAN(dv, dvl, mv, mvl, u); |
347 | dv++; |
348 | i++; |
349 | } |
d3409d5e |
350 | |
ef5f4810 |
351 | /* --- Done --- */ |
d3409d5e |
352 | |
ef5f4810 |
353 | memmove(d->v, dv, MPWS(dvl - dv)); |
354 | d->vl -= dv - d->v; |
032099d1 |
355 | if (MPX_UCMP(d->v, d->vl, >=, mm->m->v, mm->m->vl)) |
356 | mpx_usub(d->v, d->vl, d->v, d->vl, mm->m->v, mm->m->vl); |
357 | if ((a->f ^ b->f) & MP_NEG) |
358 | mpx_usub(d->v, d->vl, mm->m->v, mm->m->vl, d->v, d->vl); |
ef5f4810 |
359 | MP_SHRINK(d); |
360 | d->f = (a->f | b->f) & MP_BURN; |
ef5f4810 |
361 | MP_DROP(a); |
362 | MP_DROP(b); |
d3409d5e |
363 | } |
364 | |
d3409d5e |
365 | return (d); |
366 | } |
367 | |
52e4b041 |
368 | #endif |
369 | |
4640a0dd |
370 | /*----- Exponentiation ----------------------------------------------------*/ |
371 | |
17ad212e |
372 | /* --- @mpmont_expr@ --- * |
d3409d5e |
373 | * |
374 | * Arguments: @mpmont *mm@ = pointer to Montgomery reduction context |
ef5f4810 |
375 | * @mp *d@ = fake destination |
376 | * @mp *a@ = base |
377 | * @mp *e@ = exponent |
d3409d5e |
378 | * |
4640a0dd |
379 | * Returns: Result, %$(a R^{-1})^e R \bmod m$%. |
d3409d5e |
380 | */ |
381 | |
c9d4c30b |
382 | mp *mpmont_expr(mpmont *mm, mp *d, mp *a, mp *e) |
383 | { |
c9d4c30b |
384 | mp *x = MP_COPY(mm->r); |
4640a0dd |
385 | mp *spare = (e->f & MP_BURN) ? MP_NEWSEC : MP_NEW; |
c9d4c30b |
386 | |
387 | MP_SHRINK(e); |
388 | if (MP_LEN(e) == 0) |
4640a0dd |
389 | ; |
390 | else if (MP_LEN(e) < EXP_THRESH) |
391 | EXP_SIMPLE(x, a, e); |
392 | else |
393 | EXP_WINDOW(x, a, e); |
f1140c41 |
394 | mp_drop(d); |
395 | mp_drop(spare); |
c9d4c30b |
396 | return (x); |
397 | } |
398 | |
17ad212e |
399 | /* --- @mpmont_exp@ --- * |
400 | * |
401 | * Arguments: @mpmont *mm@ = pointer to Montgomery reduction context |
ef5f4810 |
402 | * @mp *d@ = fake destination |
403 | * @mp *a@ = base |
404 | * @mp *e@ = exponent |
17ad212e |
405 | * |
406 | * Returns: Result, %$a^e \bmod m$%. |
407 | */ |
408 | |
ef5f4810 |
409 | mp *mpmont_exp(mpmont *mm, mp *d, mp *a, mp *e) |
17ad212e |
410 | { |
4640a0dd |
411 | d = mpmont_mul(mm, d, a, mm->r2); |
412 | d = mpmont_expr(mm, d, d, e); |
17ad212e |
413 | d = mpmont_reduce(mm, d, d); |
414 | return (d); |
d3409d5e |
415 | } |
416 | |
417 | /*----- Test rig ----------------------------------------------------------*/ |
418 | |
419 | #ifdef TEST_RIG |
420 | |
421 | static int tcreate(dstr *v) |
422 | { |
423 | mp *m = *(mp **)v[0].buf; |
424 | mp *mi = *(mp **)v[1].buf; |
425 | mp *r = *(mp **)v[2].buf; |
426 | mp *r2 = *(mp **)v[3].buf; |
427 | |
428 | mpmont mm; |
429 | int ok = 1; |
430 | |
431 | mpmont_create(&mm, m); |
432 | |
f5f35081 |
433 | if (mm.mi->v[0] != mi->v[0]) { |
d3409d5e |
434 | fprintf(stderr, "\n*** bad mi: found %lu, expected %lu", |
f5f35081 |
435 | (unsigned long)mm.mi->v[0], (unsigned long)mi->v[0]); |
d3409d5e |
436 | fputs("\nm = ", stderr); mp_writefile(m, stderr, 10); |
437 | fputc('\n', stderr); |
438 | ok = 0; |
439 | } |
440 | |
032099d1 |
441 | if (!MP_EQ(mm.r, r)) { |
d3409d5e |
442 | fputs("\n*** bad r", stderr); |
443 | fputs("\nm = ", stderr); mp_writefile(m, stderr, 10); |
444 | fputs("\nexpected ", stderr); mp_writefile(r, stderr, 10); |
17ad212e |
445 | fputs("\n found ", stderr); mp_writefile(mm.r, stderr, 10); |
d3409d5e |
446 | fputc('\n', stderr); |
447 | ok = 0; |
448 | } |
449 | |
032099d1 |
450 | if (!MP_EQ(mm.r2, r2)) { |
d3409d5e |
451 | fputs("\n*** bad r2", stderr); |
452 | fputs("\nm = ", stderr); mp_writefile(m, stderr, 10); |
453 | fputs("\nexpected ", stderr); mp_writefile(r2, stderr, 10); |
17ad212e |
454 | fputs("\n found ", stderr); mp_writefile(mm.r2, stderr, 10); |
d3409d5e |
455 | fputc('\n', stderr); |
456 | ok = 0; |
457 | } |
458 | |
459 | MP_DROP(m); |
460 | MP_DROP(mi); |
461 | MP_DROP(r); |
462 | MP_DROP(r2); |
463 | mpmont_destroy(&mm); |
ef5f4810 |
464 | assert(mparena_count(MPARENA_GLOBAL) == 0); |
d3409d5e |
465 | return (ok); |
466 | } |
467 | |
468 | static int tmul(dstr *v) |
469 | { |
470 | mp *m = *(mp **)v[0].buf; |
471 | mp *a = *(mp **)v[1].buf; |
472 | mp *b = *(mp **)v[2].buf; |
473 | mp *r = *(mp **)v[3].buf; |
d3409d5e |
474 | int ok = 1; |
475 | |
476 | mpmont mm; |
477 | mpmont_create(&mm, m); |
478 | |
479 | { |
79a34029 |
480 | mp *qr = mp_mul(MP_NEW, a, b); |
481 | mp_div(0, &qr, qr, m); |
482 | |
032099d1 |
483 | if (!MP_EQ(qr, r)) { |
79a34029 |
484 | fputs("\n*** classical modmul failed", stderr); |
485 | fputs("\n m = ", stderr); mp_writefile(m, stderr, 10); |
486 | fputs("\n a = ", stderr); mp_writefile(a, stderr, 10); |
487 | fputs("\n b = ", stderr); mp_writefile(b, stderr, 10); |
488 | fputs("\n r = ", stderr); mp_writefile(r, stderr, 10); |
489 | fputs("\nqr = ", stderr); mp_writefile(qr, stderr, 10); |
490 | fputc('\n', stderr); |
491 | ok = 0; |
492 | } |
493 | |
494 | mp_drop(qr); |
495 | } |
496 | |
497 | { |
d3409d5e |
498 | mp *ar = mpmont_mul(&mm, MP_NEW, a, mm.r2); |
499 | mp *br = mpmont_mul(&mm, MP_NEW, b, mm.r2); |
79a34029 |
500 | mp *mr = mpmont_mul(&mm, MP_NEW, ar, br); |
d3409d5e |
501 | mr = mpmont_reduce(&mm, mr, mr); |
032099d1 |
502 | if (!MP_EQ(mr, r)) { |
79a34029 |
503 | fputs("\n*** montgomery modmul failed", stderr); |
504 | fputs("\n m = ", stderr); mp_writefile(m, stderr, 10); |
505 | fputs("\n a = ", stderr); mp_writefile(a, stderr, 10); |
506 | fputs("\n b = ", stderr); mp_writefile(b, stderr, 10); |
507 | fputs("\n r = ", stderr); mp_writefile(r, stderr, 10); |
508 | fputs("\nmr = ", stderr); mp_writefile(mr, stderr, 10); |
509 | fputc('\n', stderr); |
510 | ok = 0; |
511 | } |
d3409d5e |
512 | MP_DROP(ar); MP_DROP(br); |
79a34029 |
513 | mp_drop(mr); |
d3409d5e |
514 | } |
515 | |
d3409d5e |
516 | |
517 | MP_DROP(m); |
518 | MP_DROP(a); |
519 | MP_DROP(b); |
520 | MP_DROP(r); |
d3409d5e |
521 | mpmont_destroy(&mm); |
ef5f4810 |
522 | assert(mparena_count(MPARENA_GLOBAL) == 0); |
d3409d5e |
523 | return ok; |
524 | } |
525 | |
526 | static int texp(dstr *v) |
527 | { |
528 | mp *m = *(mp **)v[0].buf; |
529 | mp *a = *(mp **)v[1].buf; |
530 | mp *b = *(mp **)v[2].buf; |
531 | mp *r = *(mp **)v[3].buf; |
532 | mp *mr; |
533 | int ok = 1; |
534 | |
535 | mpmont mm; |
536 | mpmont_create(&mm, m); |
537 | |
ef5f4810 |
538 | mr = mpmont_exp(&mm, MP_NEW, a, b); |
d3409d5e |
539 | |
032099d1 |
540 | if (!MP_EQ(mr, r)) { |
d3409d5e |
541 | fputs("\n*** montgomery modexp failed", stderr); |
542 | fputs("\n m = ", stderr); mp_writefile(m, stderr, 10); |
543 | fputs("\n a = ", stderr); mp_writefile(a, stderr, 10); |
544 | fputs("\n e = ", stderr); mp_writefile(b, stderr, 10); |
545 | fputs("\n r = ", stderr); mp_writefile(r, stderr, 10); |
546 | fputs("\nmr = ", stderr); mp_writefile(mr, stderr, 10); |
547 | fputc('\n', stderr); |
548 | ok = 0; |
549 | } |
550 | |
551 | MP_DROP(m); |
552 | MP_DROP(a); |
553 | MP_DROP(b); |
554 | MP_DROP(r); |
555 | MP_DROP(mr); |
556 | mpmont_destroy(&mm); |
ef5f4810 |
557 | assert(mparena_count(MPARENA_GLOBAL) == 0); |
d3409d5e |
558 | return ok; |
559 | } |
560 | |
561 | |
562 | static test_chunk tests[] = { |
ef5f4810 |
563 | { "create", tcreate, { &type_mp, &type_mp, &type_mp, &type_mp, 0 } }, |
564 | { "mul", tmul, { &type_mp, &type_mp, &type_mp, &type_mp, 0 } }, |
565 | { "exp", texp, { &type_mp, &type_mp, &type_mp, &type_mp, 0 } }, |
d3409d5e |
566 | { 0, 0, { 0 } }, |
567 | }; |
568 | |
569 | int main(int argc, char *argv[]) |
570 | { |
571 | sub_init(); |
572 | test_run(argc, argv, tests, SRCDIR "/tests/mpmont"); |
573 | return (0); |
574 | } |
575 | |
576 | #endif |
577 | |
578 | /*----- That's all, folks -------------------------------------------------*/ |