/* -*-c-*-
*
- * $Id: mpcrt.c,v 1.3 2000/10/08 12:11:22 mdw Exp $
+ * $Id: mpcrt.c,v 1.4 2001/04/19 18:25:38 mdw Exp $
*
* Chinese Remainder Theorem computations (Gauss's algorithm)
*
/*----- Revision history --------------------------------------------------*
*
* $Log: mpcrt.c,v $
+ * Revision 1.4 2001/04/19 18:25:38 mdw
+ * Use mpmul for the multiplication.
+ *
* Revision 1.3 2000/10/08 12:11:22 mdw
* Use @MP_EQ@ instead of @MP_CMP@.
*
#include "mp.h"
#include "mpcrt.h"
+#include "mpmul.h"
#include "mpbarrett.h"
/*----- Main code ---------------------------------------------------------*/
if (n != MP_NEW)
n = MP_COPY(n);
else {
+ mpmul mm;
+ mpmul_init(&mm);
n = MP_COPY(v[0].m);
- for (i = 1; i < k; i++)
- n = mp_mul(n, n, v[i].m);
+ for (i = 0; i < k; i++)
+ mpmul_add(&mm, v[i].m);
+ n = mpmul_done(&mm);
}
/* --- A quick hack if %$k = 2$% --- */