/* -*-c-*-
*
- * $Id: gfshare.c,v 1.6 2000/12/06 20:30:10 mdw Exp $
+ * $Id: gfshare.c,v 1.7 2001/06/16 23:42:17 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.7 2001/06/16 23:42:17 mdw
+ * Typesetting fixes.
+ *
* Revision 1.6 2000/12/06 20:30:10 mdw
* Change secret sharing interface: present the secret at share
* construction time.
/* -*-c-*-
*
- * $Id: mptext.c,v 1.10 2001/06/16 13:22:39 mdw Exp $
+ * $Id: mptext.c,v 1.11 2001/06/16 23:42:17 mdw Exp $
*
* Textual representation of multiprecision numbers
*
/*----- Revision history --------------------------------------------------*
*
* $Log: mptext.c,v $
+ * Revision 1.11 2001/06/16 23:42:17 mdw
+ * Typesetting fixes.
+ *
* Revision 1.10 2001/06/16 13:22:39 mdw
* Added fast-track code for binary output bases, and tests.
*
*
* This is the number of bits in a @size_t@ object. Why?
*
- * To see this, let %$b = \mathit{MPW\_MAX} + 1$% and let %$Z$% be the
+ * To see this, let %$b = \textit{MPW\_MAX} + 1$% and let %$Z$% be the
* largest @size_t@ value. Then the largest possible @mp@ is %$M - 1$% where
* %$M = b^Z$%. Let %$r$% be a radix to read or write. Since the recursion
* squares the radix at each step, the highest number reached by the
/* -*-c-*-
*
- * $Id: noekeon.c,v 1.1 2001/05/08 22:17:41 mdw Exp $
+ * $Id: noekeon.c,v 1.2 2001/06/16 23:42:17 mdw Exp $
*
* The Noekeon block cipher
*
/*----- Revision history --------------------------------------------------*
*
* $Log: noekeon.c,v $
+ * Revision 1.2 2001/06/16 23:42:17 mdw
+ * Typesetting fixes.
+ *
* Revision 1.1 2001/05/08 22:17:41 mdw
* New cipher Noekeon added.
*
/* --- To generate the magic --- *
*
- * perl -e'@r=();$x=0x80;for(0..16){push(@r,$x);$x<<=1;$x^=0x11b if$x&0x100;}
- * i;print join(", ",map{sprintf"0x%02x",$_}@r),"\n";'
+ * perl -e'@@r=();$x=0x80;for(0..16){push(@@r,$x);$x<<=1;$x^=0x11b
+ * if$x&0x100;};print join(", ",map{sprintf"0x%02x",$_}@@r),"\n";'
*/
static const octet rcon[17] = {
/* -*-c-*-
*
- * $Id: rspit.c,v 1.18 2001/05/08 22:17:41 mdw Exp $
+ * $Id: rspit.c,v 1.19 2001/06/16 23:42:17 mdw Exp $
*
* Spit out random numbers
*
/*----- Revision history --------------------------------------------------*
*
* $Log: rspit.c,v $
+ * Revision 1.19 2001/06/16 23:42:17 mdw
+ * Typesetting fixes.
+ *
* Revision 1.18 2001/05/08 22:17:41 mdw
* New cipher Noekeon added.
*
*/
const char *mt =
- "120511284390135742513572142094334711443073194119732569353820828435640527418092392240366088035509890969913081816369160298961490135716255689660470370755013177656905237112577648090277537209936078171554274553448103698084782669252936352843649980105109850503830397166360721262431179505917248447259735253684659338653";
+ "12051128439013574251357214209433471144307319411973256935382082"
+ "84356405274180923922403660880355098909699130818163691602989614"
+ "90135716255689660470370755013177656905237112577648090277537209"
+ "93607817155427455344810369808478266925293635284364998010510985"
+ "0503830397166360721262431179505917248447259735253684659338653";
/* --- Other things --- */