X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/9083376e17ad5949beeb6dd7492a8b99b83c267f..02dfbd5b7af7816959dbd39c1fe628451204e35f:/bbs.h

diff --git a/bbs.h b/bbs.h
index 7217f65..96e3e84 100644
--- a/bbs.h
+++ b/bbs.h
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: bbs.h,v 1.5 2000/07/01 11:20:24 mdw Exp $
+ * $Id$
  *
  * The Blum-Blum-Shub random bit generator
  *
@@ -27,27 +27,6 @@
  * MA 02111-1307, USA.
  */
 
-/*----- Revision history --------------------------------------------------* 
- *
- * $Log: bbs.h,v $
- * Revision 1.5  2000/07/01 11:20:24  mdw
- * New functions for freeing public and private keys.  Remove bad type name
- * `bbs_param'.
- *
- * Revision 1.4  2000/06/17 10:45:48  mdw
- * Minor changes for key fetching.  Typesetting fixes.
- *
- * Revision 1.3  2000/02/12 18:21:02  mdw
- * Overhaul of key management (again).
- *
- * Revision 1.2  1999/12/22 15:52:08  mdw
- * Rename `bbs_params' to `bbs_param' for consistency.
- *
- * Revision 1.1  1999/12/10 23:14:59  mdw
- * Blum-Blum-Shub generator, and Blum-Goldwasser encryption.
- *
- */
-
 /*----- Notes on the BBS generator ----------------------------------------*
  *
  * The Blum-Blum-Shub generator takes the least significant bits from the
@@ -234,35 +213,25 @@ extern void bbs_wrap(bbs */*b*/);
 
 /*----- Large forwards and backwards jumps --------------------------------*/
 
-/* --- @bbs_ff@ --- *
- *
- * Arguments:	@bbs *b@ = pointer to a BBS generator state
- *		@bbs_priv *bp@ = pointer to BBS modulus factors
- *		@unsigned long n@ = number of steps to make
- *
- * Returns:	---
- *
- * Use:		`Fast-forwards' a Blum-Blum-Shub generator by @n@ steps.
- *		Requires the factorization of the Blum modulus to do this
- *		efficiently.
- */
-
-extern void bbs_ff(bbs */*b*/, bbs_priv */*bp*/, unsigned long /*n*/);
-
-/* --- @bbs_rew@ --- *
+/* --- @bbs_{ff,rew}{,n}@ --- *
  *
  * Arguments:	@bbs *b@ = pointer to a BBS generator state
- *		@bbs_priv *bp@ = pointer to BBS modulus factors
- *		@unsigned long n@ = number of steps to make
+ *		@const bbs_priv *bp@ = pointer to BBS modulus factors
+ *		@mp *n@, @unsigned long n@ = number of steps to make
  *
  * Returns:	---
  *
- * Use:		`Rewinds' a Blum-Blum-Shub generator by @n@ steps.
- *		Requires the factorization of the Blum modulus to do this
- *		at all.
+ * Use:		`Fast-forwards' or rewinds a Blum-Blum-Shub generator by @n@
+ *		steps.  The @...n@ versions take an @unsigned long@ argument;
+ *		the non-@...n@ versions a multiprecision integer.  If @n@ is
+ *		negative then the generator is stepped in the reverse
+ *		direction. 
  */
 
-extern void bbs_rew(bbs */*b*/, bbs_priv */*bp*/, unsigned long /*n*/);
+extern void bbs_ff(bbs */*b*/, const bbs_priv */*bp*/, mp */*n*/);
+extern void bbs_ffn(bbs */*b*/, const bbs_priv */*bp*/, unsigned long /*n*/);
+extern void bbs_rew(bbs */*b*/, const bbs_priv */*bp*/, mp */*n*/);
+extern void bbs_rewn(bbs */*b*/, const bbs_priv */*bp*/, unsigned long /*n*/);
 
 /*----- Parameter generation ----------------------------------------------*/
 
@@ -305,7 +274,17 @@ extern grand *bbs_rand(mp */*m*/, mp */*x*/);
 /* --- Blum-Blum-Shub-specific misc op codes --- */
 
 enum {
-  BBS_SET = GRAND_SPECIFIC		/* @mp *x@ */
+  BBS_SET = GRAND_SPECIFIC('B'),	/* @mp *x@ */
+  BBS_STEP,				/* @void@ */
+  BBS_STEPSZ,				/* @void@ */
+  BBS_BITS,				/* @unsigned bits, uint32 *w@ */
+  BBS_WRAP,				/* @void@ */
+  BBS_FF,				/* @bbs_priv *p, mp *n@ */
+  BBS_FFN,				/* @bbs_priv *p, unsigned long n@ */
+  BBS_REW,				/* @bbs_priv *p, mp *n@ */
+  BBS_REWN,				/* @bbs_priv *p, unsigned long n@ */
+  BBS_MOD,				/* @mp **n@ */
+  BBS_STATE				/* @mp **x@ */
 };
 
 /*----- That's all, folks -------------------------------------------------*/