/* -*-c-*-
*
- * $Id: f-prime.c,v 1.5 2004/03/23 12:08:26 mdw Exp $
+ * $Id: f-prime.c,v 1.8 2004/04/01 12:50:09 mdw Exp $
*
* Prime fields with Montgomery arithmetic
*
/*----- Revision history --------------------------------------------------*
*
* $Log: f-prime.c,v $
+ * Revision 1.8 2004/04/01 12:50:09 mdw
+ * Add cyclic group abstraction, with test code. Separate off exponentation
+ * functions for better static linking. Fix a buttload of bugs on the way.
+ * Generally ensure that negative exponents do inversion correctly. Add
+ * table of standard prime-field subgroups. (Binary field subgroups are
+ * currently unimplemented but easy to add if anyone ever finds a good one.)
+ *
+ * Revision 1.7 2004/03/27 17:54:11 mdw
+ * Standard curves and curve checking.
+ *
+ * Revision 1.6 2004/03/23 15:19:32 mdw
+ * Test elliptic curves more thoroughly.
+ *
* Revision 1.5 2004/03/23 12:08:26 mdw
* Random field-element selection.
*
/* --- Field operations table --- */
static field_ops fops = {
- fdestroy, frand,
+ FTY_PRIME, "prime",
+ fdestroy, frand, field_stdsamep,
fin, fout,
fzerop, fneg, fadd, fsub, fmul, fsqr, finv, freduce, fsqrt,
0,
mpmont_create(&f->mm, p);
f->f.zero = MP_ZERO;
f->f.one = f->mm.r;
+ f->f.m = f->mm.m;
+ f->f.nbits = mp_bits(p);
+ f->f.noctets = (f->f.nbits + 7) >> 3;
return (&f->f);
}