X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/1589affab225db500965e2cb869c534d6860e6bd..4edc47b89bc56cd4041fdb0f4e8e892acd589ed8:/f-binpoly.c

diff --git a/f-binpoly.c b/f-binpoly.c
index aeec0cf..45e1449 100644
--- a/f-binpoly.c
+++ b/f-binpoly.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: f-binpoly.c,v 1.6 2004/04/01 12:50:09 mdw Exp $
+ * $Id: f-binpoly.c,v 1.7 2004/04/01 21:28:41 mdw Exp $
  *
  * Binary fields with polynomial basis representation
  *
@@ -30,6 +30,11 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: f-binpoly.c,v $
+ * Revision 1.7  2004/04/01 21:28:41  mdw
+ * Normal basis support (translates to poly basis internally).  Rewrite
+ * EC and prime group table generators in awk, so that they can reuse data
+ * for repeated constants.
+ *
  * Revision 1.6  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.
@@ -62,78 +67,48 @@
 #include "gf.h"
 #include "gfreduce.h"
 #include "mprand.h"
+#include "gfn.h"
 
-/*----- Data structures ---------------------------------------------------*/
+/*----- Polynomial basis --------------------------------------------------*/
 
 typedef struct fctx {
   field f;
   gfreduce r;
 } fctx;
 
-/*----- Main code ---------------------------------------------------------*/
-
 /* --- Field operations --- */
 
 static void fdestroy(field *ff)
-{
-  fctx *f = (fctx *)ff;
-  gfreduce_destroy(&f->r);
-  DESTROY(f);
-}
+  { fctx *f = (fctx *)ff; gfreduce_destroy(&f->r); DESTROY(f); }
 
 static mp *frand(field *f, mp *d, grand *r)
-{
-  return (mprand(d, f->nbits, r, 0));
-}
+  { return (mprand(d, f->nbits, r, 0)); }
 
-static int fzerop(field *ff, mp *x)
-{
-  return (!MP_LEN(x));
-}
+static int fzerop(field *ff, mp *x) { return (!MP_LEN(x)); }
 
-static mp *fadd(field *ff, mp *d, mp *x, mp *y)
-{
-  return (gf_add(d, x, y));
-}
+static mp *fadd(field *ff, mp *d, mp *x, mp *y) { return (gf_add(d, x, y)); }
 
-static mp *fmul(field *ff, mp *d, mp *x, mp *y)
-{
-  fctx *f = (fctx *)ff;
-  d = gf_mul(d, x, y);
+static mp *fmul(field *ff, mp *d, mp *x, mp *y) {
+  fctx *f = (fctx *)ff; d = gf_mul(d, x, y);
   return (gfreduce_do(&f->r, d, d));
 }
 
-static mp *fsqr(field *ff, mp *d, mp *x)
-{
-  fctx *f = (fctx *)ff;
-  d = gf_sqr(d, x);
+static mp *fsqr(field *ff, mp *d, mp *x) {
+  fctx *f = (fctx *)ff; d = gf_sqr(d, x);
   return (gfreduce_do(&f->r, d, d));
 }
 
 static mp *finv(field *ff, mp *d, mp *x)
-{
-  fctx *f = (fctx *)ff;
-  gf_gcd(0, 0, &d, f->r.p, x);
-  return (d);
-}
+  { fctx *f = (fctx *)ff; gf_gcd(0, 0, &d, f->r.p, x); return (d); }
 
 static mp *freduce(field *ff, mp *d, mp *x)
-{
-  fctx *f = (fctx *)ff;
-  return (gfreduce_do(&f->r, d, x));
-}
+  { fctx *f = (fctx *)ff; return (gfreduce_do(&f->r, d, x)); }
 
 static mp *fsqrt(field *ff, mp *d, mp *x)
-{
-  fctx *f = (fctx *)ff;
-  return (gfreduce_sqrt(&f->r, d, x));
-}
+  { fctx *f = (fctx *)ff; return (gfreduce_sqrt(&f->r, d, x)); }
 
 static mp *fquadsolve(field *ff, mp *d, mp *x)
-{
-  fctx *f = (fctx *)ff;
-  return (gfreduce_quadsolve(&f->r, d, x));
-}
+  { fctx *f = (fctx *)ff; return (gfreduce_quadsolve(&f->r, d, x)); }
 
 /* --- Field operations table --- */
 
@@ -168,4 +143,67 @@ field *field_binpoly(mp *p)
   return (&f->f);
 }
 
+/*----- Normal basis ------------------------------------------------------*/
+
+typedef struct fnctx {
+  fctx f;
+  gfn ntop, pton;
+} fnctx;
+
+/* --- Field operations --- */
+
+static void fndestroy(field *ff) {
+  fnctx *f = (fnctx *)ff; gfreduce_destroy(&f->f.r);
+  gfn_destroy(&f->ntop); gfn_destroy(&f->pton);
+  DESTROY(f);
+}
+
+static int fnsamep(field *ff, field *gg) {
+  fnctx *f = (fnctx *)ff, *g = (fnctx *)gg;
+  return (MP_EQ(f->ntop.r[0], g->ntop.r[0]) && field_stdsamep(ff, gg));
+}
+
+static mp *fnin(field *ff, mp *d, mp *x)
+  { fnctx *f = (fnctx *)ff; return (gfn_transform(&f->ntop, d, x)); }
+
+static mp *fnout(field *ff, mp *d, mp *x)
+  { fnctx *f = (fnctx *)ff; return (gfn_transform(&f->pton, d, x)); }
+
+/* --- Field operations table --- */
+
+static field_ops fnops = {
+  FTY_BINARY, "binnorm",
+  fndestroy, frand, fnsamep,
+  fnin, fnout,
+  fzerop, field_id, fadd, fadd, fmul, fsqr, finv, freduce, fsqrt,
+  fquadsolve,
+  0, 0, 0, 0
+};
+
+/* --- @field_binnorm@ --- *
+ *
+ * Arguments:	@mp *p@ = the reduction polynomial
+ *		@mp *beta@ = representation of normal point
+ *
+ * Returns:	A pointer to the field.
+ *
+ * Use:		Creates a field structure for a binary field mod @p@ which
+ *		uses a normal basis representation externally.  Computations
+ *		are still done on a polynomial-basis representation.
+ */
+
+field *field_binnorm(mp *p, mp *beta)
+{
+  fnctx *f = CREATE(fnctx);
+  f->f.f.ops = &fnops;
+  f->f.f.zero = MP_ZERO;
+  f->f.f.one = MP_ONE;
+  f->f.f.nbits = mp_bits(p) - 1;
+  f->f.f.noctets = (f->f.f.nbits + 7) >> 3;
+  gfreduce_create(&f->f.r, p);
+  f->f.f.m = f->f.r.p;
+  gfn_create(p, beta, &f->ntop, &f->pton);
+  return (&f->f.f);
+}
+
 /*----- That's all, folks -------------------------------------------------*/