/* -*-c-*-
*
- * $Id: bbs-gen.c,v 1.4 2000/06/17 10:43:57 mdw Exp $
+ * $Id: bbs-gen.c,v 1.5 2000/07/01 11:20:36 mdw Exp $
*
* Generate Blum integers
*
/*----- Revision history --------------------------------------------------*
*
* $Log: bbs-gen.c,v $
+ * Revision 1.5 2000/07/01 11:20:36 mdw
+ * Remove bad type name `bbs_param'.
+ *
* Revision 1.4 2000/06/17 10:43:57 mdw
* Move GCD filter to separate file. Handle failures from pgen_jump.
*
/* --- @bbs_gen@ --- *
*
- * Arguments: @bbs_param *bp@ = pointer to parameter block
+ * Arguments: @bbs_priv *bp@ = pointer to parameter block
* @unsigned nbits@ = number of bits in the modulus
* @grand *r@ = pointer to random number source
* @unsigned n@ = number of attempts to make
* Shub pseudorandom bit generator.
*/
-int bbs_gen(bbs_param *bp, unsigned nbits, grand *r, unsigned n,
+int bbs_gen(bbs_priv *bp, unsigned nbits, grand *r, unsigned n,
pgen_proc *event, void *ectx)
{
rabin rb;
/* -*-c-*-
*
- * $Id: bbs-jump.c,v 1.3 2000/06/17 10:44:17 mdw Exp $
+ * $Id: bbs-jump.c,v 1.4 2000/07/01 11:20:36 mdw Exp $
*
* Jumping around a BBS sequence
*
/*----- Revision history --------------------------------------------------*
*
* $Log: bbs-jump.c,v $
+ * Revision 1.4 2000/07/01 11:20:36 mdw
+ * Remove bad type name `bbs_param'.
+ *
* Revision 1.3 2000/06/17 10:44:17 mdw
* Typesetting fix.
*
/* --- @jump@ --- *
*
* Arguments: @bbs *b@ = pointer to BBS generator context
- * @bbs_param *bp@ = pointer to BBS modulus factors
+ * @bbs_priv *bp@ = pointer to BBS modulus factors
* @unsigned long n@ = number of steps to move
* @mp *px@ = exponent mod @p@ for a one-step jump
* @mp *qx@ = exponent mod @q@ for a one-step jump
* %$p \equiv 3 \pmod 4$%.)
*/
-static void jump(bbs *b, bbs_param *bp, unsigned long n,
+static void jump(bbs *b, bbs_priv *bp, unsigned long n,
mp *px, mp *qx)
{
mp *ep, *eq;
/* --- @bbs_ff@ --- *
*
* Arguments: @bbs *b@ = pointer to a BBS generator state
- * @bbs_param *bp@ = pointer to BBS modulus factors
+ * @bbs_priv *bp@ = pointer to BBS modulus factors
* @unsigned long n@ = number of steps to make
*
* Returns: ---
* efficiently.
*/
-void bbs_ff(bbs *b, bbs_param *bp, unsigned long n)
+void bbs_ff(bbs *b, bbs_priv *bp, unsigned long n)
{
jump(b, bp, n, MP_TWO, MP_TWO);
}
/* --- @bbs_rew@ --- *
*
* Arguments: @bbs *b@ = pointer to a BBS generator state
- * @bbs_param *bp@ = pointer to BBS modulus factors
+ * @bbs_priv *bp@ = pointer to BBS modulus factors
* @unsigned long n@ = number of steps to make
*
* Returns: ---
* at all.
*/
-void bbs_rew(bbs *b, bbs_param *bp, unsigned long n)
+void bbs_rew(bbs *b, bbs_priv *bp, unsigned long n)
{
mp *px = mp_lsr(MP_NEW, bp->p, 2);
mp *qx = mp_lsr(MP_NEW, bp->q, 2);
static int verify(dstr *v)
{
- bbs_param bp;
+ bbs_priv bp;
bbs b;
mp *x;
unsigned long n;