X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/34e4f738bcba58e6d8c4cabbb0b3232a65b42a9d..1d7857e79cfb9d5b41fe13935b0a0bf68f6049f5:/field.h

diff --git a/field.h b/field.h
index bf0428a..4164bce 100644
--- a/field.h
+++ b/field.h
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: field.h,v 1.9 2004/04/01 12:50:09 mdw Exp $
+ * $Id$
  *
  * Definitions for field arithmetic
  *
@@ -27,48 +27,6 @@
  * MA 02111-1307, USA.
  */
 
-/*----- Revision history --------------------------------------------------* 
- *
- * $Log: field.h,v $
- * Revision 1.9  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.8  2004/03/27 17:54:11  mdw
- * Standard curves and curve checking.
- *
- * Revision 1.7  2004/03/27 00:04:46  mdw
- * Implement efficient reduction for pleasant-looking primes.
- *
- * 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.
- *
- * Revision 1.4  2004/03/21 22:52:06  mdw
- * Merge and close elliptic curve branch.
- *
- * Revision 1.3.4.2  2004/03/21 22:39:46  mdw
- * Elliptic curves on binary fields work.
- *
- * Revision 1.3.4.1  2004/03/20 00:13:31  mdw
- * Projective coordinates for prime curves
- *
- * Revision 1.3  2002/01/13 13:48:44  mdw
- * Further progress.
- *
- * Revision 1.2  2001/05/07 17:30:13  mdw
- * Add an internal-representation no-op function.
- *
- * Revision 1.1  2001/04/29 18:12:33  mdw
- * Prototype version.
- *
- */
-
 #ifndef CATACOMB_FIELD_H
 #define CATACOMB_FIELD_H
 
@@ -98,6 +56,7 @@ typedef struct field {
   mp *m;				/* Modulus (prime and binary) */
   unsigned long nbits;			/* Length of field element in bits */
   size_t noctets;			/* Length of element in octets */
+  mp *q;				/* Number of elements in field */
 } field;
 
 enum {
@@ -212,6 +171,25 @@ extern int field_samep(field */*f*/, field */*g*/);
 
 extern int field_stdsamep(field */*f*/, field */*g*/);
 
+/*----- Arithmetic --------------------------------------------------------*/
+
+/* --- @field_exp@ --- *
+ *
+ * Arguments:	@field *f@ = pointer to field
+ *		@mp *d@ = fake destination
+ *		@mp *a@ = base
+ *		@mp *e@ = exponent
+ *
+ * Returns:	Result, %$a^e$%.
+ *
+ * Use:		Exponentiation in a finite field.  Note that all quantities
+ *		are in internal format.  This is a generic implementation
+ *		suitable for use with all fields and is not intended to be
+ *		optimal.
+ */
+
+extern mp *field_exp(field */*f*/, mp */*d*/, mp */*a*/, mp */*e*/);
+
 /*----- Creating fields ---------------------------------------------------*/
 
 /* --- @field_prime@ --- *
@@ -250,6 +228,20 @@ extern field *field_niceprime(mp */*p*/);
 
 extern field *field_binpoly(mp */*p*/);
 
+/* --- @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.
+ */
+
+extern field *field_binnorm(mp */*p*/, mp */*beta*/);
+
 /* --- @field_parse@ --- *
  *
  * Arguments:	@qd_parse *qd@ = parser context
@@ -258,9 +250,10 @@ extern field *field_binpoly(mp */*p*/);
  *
  * Use:		Parses a field description, which has the form
  *
- *		  * `prime', `niceprime' or `binpoly'
+ *		  * `prime', `niceprime', `binpoly', or `binnorm'
  *		  * an optional `:'
  *		  * the field modulus
+ *	          * for `binnorm', an optional `,' and the beta value
  */
 
 extern field *field_parse(qd_parse */*qd*/);