From 4d47e1571e6a3fd88ebd956a18a4b362d2f98755 Mon Sep 17 00:00:00 2001
From: mdw <mdw>
Date: Sun, 18 Jun 2000 23:12:15 +0000
Subject: [PATCH] Change typesetting of Galois Field names.

---
 gfshare-mktab.c  |  9 ++++++---
 gfshare.c        |  7 +++++--
 gfshare.h        | 11 +++++++----
 rijndael-mktab.c | 15 +++++++++------
 twofish-mktab.c  | 11 +++++++----
 5 files changed, 34 insertions(+), 19 deletions(-)

diff --git a/gfshare-mktab.c b/gfshare-mktab.c
index 709e619..10b131d 100644
--- a/gfshare-mktab.c
+++ b/gfshare-mktab.c
@@ -1,8 +1,8 @@
 /* -*-c-*-
  *
- * $Id: gfshare-mktab.c,v 1.1 2000/06/17 10:56:30 mdw Exp $
+ * $Id: gfshare-mktab.c,v 1.2 2000/06/18 23:12:15 mdw Exp $
  *
- * Generate tables for %$\gf(2^8)$% multiplication
+ * Generate tables for %$\gf{2^8}$% multiplication
  *
  * (c) 2000 Straylight/Edgeware
  */
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: gfshare-mktab.c,v $
+ * Revision 1.2  2000/06/18 23:12:15  mdw
+ * Change typesetting of Galois Field names.
+ *
  * Revision 1.1  2000/06/17 10:56:30  mdw
  * Fast but nonstandard secret sharing system.
  *
@@ -68,7 +71,7 @@ int main(int argc, char *argv[])
   fputs("\
 /* -*-c-*-\n\
  *\n\
- * Log tables for secret sharing in %$\\gf(2^8)$% [generated]\n\
+ * Log tables for secret sharing in %$\gf{2^8}$% [generated]\n\
  */\n\
 \n\
 #ifndef GFSHARE_TAB_H\n\
diff --git a/gfshare.c b/gfshare.c
index cdc00d2..bbb0aee 100644
--- a/gfshare.c
+++ b/gfshare.c
@@ -1,8 +1,8 @@
 /* -*-c-*-
  *
- * $Id: gfshare.c,v 1.1 2000/06/17 10:56:30 mdw Exp $
+ * $Id: gfshare.c,v 1.2 2000/06/18 23:12:15 mdw Exp $
  *
- * Secret sharing over %$gf(2^8)$%
+ * Secret sharing over %$\gf(2^8)$%
  *
  * (c) 2000 Straylight/Edgeware
  */
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: gfshare.c,v $
+ * Revision 1.2  2000/06/18 23:12:15  mdw
+ * Change typesetting of Galois Field names.
+ *
  * Revision 1.1  2000/06/17 10:56:30  mdw
  * Fast but nonstandard secret sharing system.
  *
diff --git a/gfshare.h b/gfshare.h
index 29ecd14..4141156 100644
--- a/gfshare.h
+++ b/gfshare.h
@@ -1,8 +1,8 @@
 /* -*-c-*-
  *
- * $Id: gfshare.h,v 1.2 2000/06/17 11:05:27 mdw Exp $
+ * $Id: gfshare.h,v 1.3 2000/06/18 23:12:15 mdw Exp $
  *
- * Secret sharing over %$\gf(2^8)$%
+ * Secret sharing over %$\gf{2^8}$%
  *
  * (c) 2000 Straylight/Edgeware
  */
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: gfshare.h,v $
+ * Revision 1.3  2000/06/18 23:12:15  mdw
+ * Change typesetting of Galois Field names.
+ *
  * Revision 1.2  2000/06/17 11:05:27  mdw
  * Add a commentary on the system.
  *
@@ -42,9 +45,9 @@
  *
  * This uses a variant of Shamir's secret sharing system.  Shamir's original
  * system used polynomials modulo a large prime.  This implementation instead
- * uses the field %$\gf(2^8)$%, represented by
+ * uses the field %$\gf{2^8}$%, represented by
  *
- *   %$\gf(2)[x]/(x^8 + x^4 + x^3 + x^2 + 1)$%
+ *   %$\gf{2}[x]/(x^8 + x^4 + x^3 + x^2 + 1)$%
  *
  * and shares each byte of the secret independently.  It is therefore limited
  * to 255 players, although this probably isn't a serious limitation in
diff --git a/rijndael-mktab.c b/rijndael-mktab.c
index f5df965..b07207b 100644
--- a/rijndael-mktab.c
+++ b/rijndael-mktab.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: rijndael-mktab.c,v 1.1 2000/06/17 11:56:07 mdw Exp $
+ * $Id: rijndael-mktab.c,v 1.2 2000/06/18 23:12:15 mdw Exp $
  *
  * Build precomputed tables for the Rijndael block cipher
  *
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: rijndael-mktab.c,v $
+ * Revision 1.2  2000/06/18 23:12:15  mdw
+ * Change typesetting of Galois Field names.
+ *
  * Revision 1.1  2000/06/17 11:56:07  mdw
  * New cipher.
  *
@@ -54,7 +57,7 @@ static octet rc[32];
 
 /* --- @mul@ --- *
  *
- * Arguments:	@unsigned x, y@ = polynomials over %$\mathrm{GF}(2^8)$%
+ * Arguments:	@unsigned x, y@ = polynomials over %$\gf{2^8}$%
  *		@unsigned m@ = modulus
  *
  * Returns:	The product of two polynomials.
@@ -83,10 +86,10 @@ static unsigned mul(unsigned x, unsigned y, unsigned m)
  *
  * Build the S-box.
  *
- * This is built from multiplicative inversion in the group
- * %$\mathrm{GF}(2^8)[x]/p(x)$%, where %$p(x) = x^8 + x^4 + x^3 + x + 1$%,
- * followed by an affine transformation treating inputs as vectors over
- * %$\mathrm{GF}(2)$%.  The result is a horrible function.
+ * This is built from inversion in the multiplicative group of
+ * %$\gf{2^8}[x]/(p(x))$%, where %$p(x) = x^8 + x^4 + x^3 + x + 1$%, followed
+ * by an affine transformation treating inputs as vectors over %$\gf{2}$%.
+ * The result is a horrible function.
  *
  * The inversion is done slightly sneakily, by building log and antilog
  * tables.  Let %$a$% be an element of the finite field.  If the inverse of
diff --git a/twofish-mktab.c b/twofish-mktab.c
index 5a649f3..d7290b3 100644
--- a/twofish-mktab.c
+++ b/twofish-mktab.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: twofish-mktab.c,v 1.1 2000/06/17 12:10:17 mdw Exp $
+ * $Id: twofish-mktab.c,v 1.2 2000/06/18 23:12:15 mdw Exp $
  *
  * Build constant tables for Twofish
  *
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: twofish-mktab.c,v $
+ * Revision 1.2  2000/06/18 23:12:15  mdw
+ * Change typesetting of Galois Field names.
+ *
  * Revision 1.1  2000/06/17 12:10:17  mdw
  * New cipher.
  *
@@ -175,14 +178,14 @@ static void printq(const q_tab *q, const char *name)
   }
 }
 
-/*----- GF(2^8) arithmetic ------------------------------------------------*/
+/*----- %$\gf{2^8}$% arithmetic -------------------------------------------*/
 
 #define MDS_MOD 0x169
 #define RS_MOD 0x14d
 
 /* --- @mul@ --- *
  *
- * Arguments:	@unsigned x, y@ = polynomials over %$\mathrm{GF}(2^8)$%
+ * Arguments:	@unsigned x, y@ = polynomials over %$\gf{2^8}$%
  *		@unsigned m@ = modulus
  *
  * Returns:	The product of two polynomials.
@@ -219,7 +222,7 @@ static unsigned mul(unsigned x, unsigned y, unsigned m)
  * Returns:	---
  *
  * Use:		Computes an inner product of matrices over the finite field
- *		%$\mathrm{GF}(2^8)[x]/m(x)$%.  This isn't particularly rapid.
+ *		%$\gf{2^8}[x]/(m(x))$%.  This isn't particularly rapid.
  */
 
 static void mmul(octet *d, const octet *p, const octet *q,
-- 
2.11.0