/* -*-c-*-
*
- * $Id: gfreduce.c,v 1.2 2004/03/21 22:52:06 mdw Exp $
+ * $Id$
*
* Efficient reduction modulo sparse binary polynomials
*
* MA 02111-1307, USA.
*/
-/*----- Revision history --------------------------------------------------*
- *
- * $Log: gfreduce.c,v $
- * 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.
- *
- */
-
/*----- Header files ------------------------------------------------------*/
#include <mLib/alloc.h>
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);
y = gfreduce_do(r, t, t);
y = gf_add(y, y, x);
}
- rc = !MP_ISZERO(y);
+ rc = !MP_ZEROP(y);
mp_drop(spare);
mp_drop(y);
return (rc);
z = gf_add(z, z, t);
w = gf_add(w, w, rho);
}
- if (!MP_ISZERO(w))
+ if (!MP_ZEROP(w))
break;
MP_DROP(z);
MP_DROP(w);
}
MP_DROP(t);
MP_DROP(x);
- d->v[0] &= ~(mpw)1;
+ if (d) d->v[0] &= ~(mpw)1;
return (d);
}
mp *spare = (e->f & MP_BURN) ? MP_NEWSEC : MP_NEW;
MP_SHRINK(e);
- if (!MP_LEN(e))
+ MP_COPY(a);
+ if (MP_ZEROP(e))
;
- else if (MP_LEN(e) < EXP_THRESH)
- EXP_SIMPLE(x, a, e);
- else
- EXP_WINDOW(x, a, e);
+ else {
+ if (MP_NEGP(e))
+ a = gf_modinv(a, a, gr->p);
+ if (MP_LEN(e) < EXP_THRESH)
+ EXP_SIMPLE(x, a, e);
+ else
+ EXP_WINDOW(x, a, e);
+ }
mp_drop(d);
+ mp_drop(a);
mp_drop(spare);
return (x);
}