/* -*-c-*-
*
- * $Id: rand.c,v 1.4 1999/12/13 15:34:28 mdw Exp $
+ * $Id: rand.c,v 1.6 2004/04/08 01:36:15 mdw Exp $
*
* Secure random number generator
*
* MA 02111-1307, USA.
*/
-/*----- Revision history --------------------------------------------------*
- *
- * $Log: rand.c,v $
- * Revision 1.4 1999/12/13 15:34:28 mdw
- * Increase the entropy threshhold in rand_getgood.
- *
- * Revision 1.3 1999/12/10 23:28:07 mdw
- * Bug fix: rand_getgood didn't update buffer pointer.
- *
- * Revision 1.2 1999/10/12 21:00:15 mdw
- * Make pool and buffer sizes more sensible.
- *
- * Revision 1.1 1999/09/03 08:41:12 mdw
- * Initial import.
- *
- */
-
/*----- Header files ------------------------------------------------------*/
#include <stdarg.h>
#include <mLib/bits.h>
#include <mLib/sub.h>
+#include "arena.h"
#include "blowfish-cbc.h"
#include "paranoia.h"
#include "rand.h"
rand_pool p;
} gctx;
-static gctx pool = { { &gops } }; /* Default random pool */
+static gctx *pool = 0; /* Default random pool */
/*----- Macros ------------------------------------------------------------*/
#define RAND_RESOLVE(r) do { \
- if ((r) == RAND_GLOBAL) \
- (r) = &pool.p; \
+ if ((r) == RAND_GLOBAL) { \
+ if (!pool) \
+ pool = (gctx *)rand_create(); \
+ (r) = &pool->p; \
+ } \
} while (0)
#define TIMER(r) do { \
* Returns: ---
*
* Use: Initializes a randomness pool. The pool doesn't start out
- * very random: that's your job to sort out.
+ * very random: that's your job to sort out. A good suggestion
+ * would be to attach an appropriate noise source and call
+ * @rand_seed@.
*/
void rand_init(rand_pool *r)
r->s = s;
}
+/* --- @rand_seed@ --- *
+ *
+ * Arguments: @rand_pool *r@ = pointer to a randomness pool
+ * @unsigned bits@ = number of bits to ensure
+ *
+ * Returns: ---
+ *
+ * Use: Ensures that there are at least @bits@ good bits of entropy
+ * in the pool. It is recommended that you call this after
+ * initializing a new pool. Requesting @bits > RAND_IBITS@ is
+ * doomed to failure (and is an error).
+ */
+
+void rand_seed(rand_pool *r, unsigned bits)
+{
+ RAND_RESOLVE(r);
+
+ assert(((void)"bits pointlessly large in rand_seed", bits <= RAND_IBITS));
+ assert(((void)"no noise source in rand_seed", r->s));
+
+ while (r->ibits < bits)
+ r->s->getnoise(r);
+ rand_gate(r);
+}
+
/* --- @rand_key@ --- *
*
* Arguments: @rand_pool *r@ = pointer to a randomness pool
*
* Returns: ---
*
- * Use: Gets random data from the pool. The pool's contents can't be
- * determined from the output of this function; nor can the
- * output data be determined from a knowledge of the data input
- * to the pool wihtout also having knowledge of the secret key.
- * If a noise source is attached to the pool in question, it is
- * called to replenish the supply of good bits in the pool;
- * otherwise this call is equivalent to @rand_get@.
+ * Use: Gets random data from the pool, ensuring that there are
+ * enough good bits. This interface isn't recommended: it makes
+ * the generator slow, and doesn't provide much more security
+ * than @rand_get@, assuming you've previously done a
+ * @rand_seed@.
*/
void rand_getgood(rand_pool *r, void *p, size_t sz)
/*----- Generic random number generator interface -------------------------*/
+#define GRESOLVE(g, r) do { \
+ if (r != &rand_global) \
+ g = (gctx *)r; \
+ else { \
+ if (!pool) \
+ pool = (gctx *)rand_create(); \
+ g = pool; \
+ } \
+} while (0)
+
static void gdestroy(grand *r)
{
- gctx *g = (r == &rand_global ? &pool : (gctx *)r);
- if (g != &pool)
- DESTROY(g);
+ gctx *g;
+ GRESOLVE(g, r);
+ if (g != pool) {
+ BURN(*g);
+ S_DESTROY(g);
+ }
}
static int gmisc(grand *r, unsigned op, ...)
{
- gctx *g = (r == &rand_global ? &pool : (gctx *)r);
+ gctx *g;
va_list ap;
int rc = 0;
va_start(ap, op);
+ GRESOLVE(g, r);
switch (op) {
case GRAND_CHECK:
switch (va_arg(ap, unsigned)) {
case RAND_STRETCH:
case RAND_KEY:
case RAND_NOISESRC:
+ case RAND_SEED:
rc = 1;
break;
default:
case RAND_NOISESRC:
rand_noisesrc(&g->p, va_arg(ap, const rand_source *));
break;
+ case RAND_SEED:
+ rand_seed(&g->p, va_arg(ap, unsigned));
+ break;
default:
GRAND_BADOP;
break;
static octet gbyte(grand *r)
{
- gctx *g = (r == &rand_global ? &pool : (gctx *)r);
+ gctx *g;
octet o;
+ GRESOLVE(g, r);
rand_getgood(&g->p, &o, 1);
return (o);
}
static uint32 gword(grand *r)
{
- gctx *g = (r == &rand_global ? &pool : (gctx *)r);
+ gctx *g;
octet b[4];
+ GRESOLVE(g, r);
rand_getgood(&g->p, &b, sizeof(b));
return (LOAD32(b));
}
static void gfill(grand *r, void *p, size_t sz)
{
- gctx *g = (r == &rand_global ? &pool : (gctx *)r);
- rand_getgood(&g->p, p, sz);
+ gctx *g;
+ GRESOLVE(g, r);
+ rand_get(&g->p, p, sz);
}
static const grand_ops gops = {
"rand",
- 0,
+ GRAND_CRYPTO, 0,
gmisc, gdestroy,
gword, gbyte, gword, grand_range, gfill
};
grand *rand_create(void)
{
- gctx *g = CREATE(gctx);
+ gctx *g = S_CREATE(gctx);
g->r.ops = &gops;
rand_init(&g->p);
return (&g->r);