/* -*-c-*-
*
- * $Id: dsa-verify.c,v 1.3 1999/12/10 23:18:38 mdw Exp $
+ * $Id: dsa-verify.c,v 1.4 2000/06/17 10:53:35 mdw Exp $
*
* DSA signature verification
*
/*----- Revision history --------------------------------------------------*
*
* $Log: dsa-verify.c,v $
+ * Revision 1.4 2000/06/17 10:53:35 mdw
+ * Typesetting fixes.
+ *
* Revision 1.3 1999/12/10 23:18:38 mdw
* Change interface for suggested destinations.
*
mp_drop(z);
}
- /* --- Compute %$wr%$ and %$wm$% --- */
+ /* --- Compute %$wr$% and %$wm$% --- */
f[0].exp = mpmont_mul(&qm, MP_NEW, w, m);
f[1].exp = mpmont_mul(&qm, MP_NEW, w, r);
/* -*-c-*-
*
- * $Id: dsarand.h,v 1.1 1999/12/22 15:53:12 mdw Exp $
+ * $Id: dsarand.h,v 1.2 2000/06/17 10:54:14 mdw Exp $
*
* Random number generator for DSA
*
/*----- Revision history --------------------------------------------------*
*
* $Log: dsarand.h,v $
+ * Revision 1.2 2000/06/17 10:54:14 mdw
+ * Typesetting fixes.
+ *
* Revision 1.1 1999/12/22 15:53:12 mdw
* Random number generator for finding DSA parameters.
*
*
* Let %$p$% be the numerical value of the input buffer, and let
* %$b$% be the number of bytes required. Let
- * %$z = \lceil b / 20 \rceil%$ be the number of SHA outputs
+ * %$z = \lceil b / 20 \rceil$% be the number of SHA outputs
* required. Then the output of pass %$n$% is
*
* %$P_n = \sum_{0 \le i < z} 2^{160i} SHA(p + nz + i)$%
/* -*-c-*-
*
- * $Id: fibrand.h,v 1.1 1999/12/10 23:15:27 mdw Exp $
+ * $Id: fibrand.h,v 1.2 2000/06/17 10:54:59 mdw Exp $
*
* Fibonacci generator
*
/*----- Revision history --------------------------------------------------*
*
* $Log: fibrand.h,v $
+ * Revision 1.2 2000/06/17 10:54:59 mdw
+ * Typesetting fixes.
+ *
* Revision 1.1 1999/12/10 23:15:27 mdw
* Noncryptographic random number generator.
*
* Returns: Next output from generator.
*
* Use: Steps the generator. Returns
- * %$x_{i - 24} + x_{i - 55} \bmod 2^{32}%$.
+ * %$x_{i - 24} + x_{i - 55} \bmod 2^{32}$%.
*/
extern uint32 fibrand_step(fibrand */*f*/);