/* -*-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
*/
/*----- 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.
*
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\
/* -*-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
*/
/*----- 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.
*
/* -*-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
*/
/*----- 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.
*
*
* 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
/* -*-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
*
/*----- 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.
*
/* --- @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.
*
* 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
/* -*-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
*
/*----- 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.
*
}
}
-/*----- 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.
* 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,