/* -*-c-*-
*
- * $Id: gfreduce.c,v 1.1.2.1 2004/03/21 22:39:46 mdw Exp $
+ * $Id: gfreduce.c,v 1.4 2004/03/27 00:04:46 mdw Exp $
*
* Efficient reduction modulo sparse binary polynomials
*
/*----- Revision history --------------------------------------------------*
*
* $Log: gfreduce.c,v $
+ * Revision 1.4 2004/03/27 00:04:46 mdw
+ * Implement efficient reduction for pleasant-looking primes.
+ *
+ * Revision 1.3 2004/03/23 15:19:32 mdw
+ * Test elliptic curves more thoroughly.
+ *
+ * Revision 1.2 2004/03/21 22:52:06 mdw
+ * Merge and close elliptic curve branch.
+ *
* Revision 1.1.2.1 2004/03/21 22:39:46 mdw
* Elliptic curves on binary fields work.
*
void gfreduce_create(gfreduce *r, mp *p)
{
instr_v iv = DA_INIT;
- unsigned long d, dw;
+ unsigned long d;
+ unsigned dw;
mpscan sc;
unsigned long i;
gfreduce_instr *ip;
w = ww;
wi = DA_LEN(&iv);
}
- INSTR(GFRI_LSL, (i - d)%MPW_BITS);
- if ((i - d)%MPW_BITS)
+ INSTR(GFRI_LSL, (MPW_BITS + i - d)%MPW_BITS);
+ if ((MPW_BITS + i - d)%MPW_BITS)
f |= f_lsr;
}
wl = DA_LEN(&iv);
}
MP_DROP(t);
MP_DROP(x);
- d->v[0] &= ~(mpw)1;
+ if (d) d->v[0] &= ~(mpw)1;
return (d);
}