/* -*-c-*-
*
- * $Id: rho.c,v 1.1 2000/07/09 21:32:30 mdw Exp $
+ * $Id: rho.c,v 1.2 2000/10/08 12:11:22 mdw Exp $
*
* Pollard's rho algorithm for discrete logs
*
/*----- Revision history --------------------------------------------------*
*
* $Log: rho.c,v $
+ * Revision 1.2 2000/10/08 12:11:22 mdw
+ * Use @MP_EQ@ instead of @MP_CMP@.
+ *
* Revision 1.1 2000/07/09 21:32:30 mdw
* Pollard's rho algorithm for computing discrete logs.
*
bb = mp_sub(bb, bb, b);
g = MP_NEW;
mp_gcd(&g, &bb, 0, bb, cc->n);
- if (MP_CMP(g, !=, MP_ONE)) {
+ if (!MP_EQ(g, MP_ONE)) {
mp_drop(aa);
aa = 0;
} else {
static int prime_eq(void *x, void *y)
{
- return (MP_CMP(*(mp **)x, ==, *(mp **)y));
+ return (MP_EQ(*(mp **)x, *(mp **)y));
}
static int prime_split(void *x)
y = mpmont_exp(&mm, MP_NEW, dp.g, x);
mpmont_destroy(&mm);
l = rho_prime(dp.g, y, dp.q, dp.p);
- if (MP_CMP(x, ==, l)) {
+ if (MP_EQ(x, l)) {
fputs(". ok\n", stdout);
ok = 1;
} else {