RANDOM(3) BSD Library Functions Manual RANDOM(3)

NAME
     rraannddoomm, ssrraannddoomm, ssrraannddoommddeevv, iinniittssttaattee, sseettssttaattee - better random number
     generator; routines for changing generators

LLIIBBRRAARRYY
     Standard C Library (libc, -lc)

SYNOPSIS
     ##iinncclluuddee <>

     long
     rraannddoomm(void);

     void
     ssrraannddoomm(unsigned long seed);

     void
     ssrraannddoommddeevv(void);

     char *
     iinniittssttaattee(unsigned long seed, char *state, long n);

     char *
     sseettssttaattee(char *state);

DESCRIPTION
     The rraannddoomm() function uses a non-linear additive feedback random number
     generator employing a default table of size 31 long integers to return
     successive pseudo-random numbers in the range from 0 to (2**31)-1.  The
     period of this random number generator is very large, approximately
     16*((2**31)-1).

     The rraannddoomm() and ssrraannddoomm() functions have (almost) the same calling
     sequence and initialization properties as the rand(3) and srand(3) func-
     tions.  The difference is that rand(3) produces a much less random
     sequence - in fact, the low dozen bits generated by rand go through a
     cyclic pattern.  All the bits generated by rraannddoomm() are usable.  For
     example, `random()&01' will produce a random binary value.

     Like rand(3), rraannddoomm() will by default produce a sequence of numbers that
     can be duplicated by calling ssrraannddoomm() with `1' as the seed.

     The ssrraannddoommddeevv() routine initializes a state array using the random(4)
     random number device which returns good random numbers, suitable for
     cryptographic use.  Note that this particular seeding procedure can gen-
     erate states which are impossible to reproduce by calling ssrraannddoomm() with
     any value, since the succeeding terms in the state buffer are no longer
     derived from the LC algorithm applied to a fixed seed.

     The iinniittssttaattee() routine allows a state array, passed in as an argument,
     to be initialized for future use.  The size of the state array (in bytes)
     is used by iinniittssttaattee() to decide how sophisticated a random number gener-
     ator it should use - the more state, the better the random numbers will
     be.  (Current "optimal" values for the amount of state information are 8,
     32, 64, 128, and 256 bytes; other amounts will be rounded down to the
     nearest known amount.  Using less than 8 bytes will cause an error.)  The
     seed for the initialization (which specifies a starting point for the
     random number sequence, and provides for restarting at the same point) is
     also an argument.  The iinniittssttaattee() function returns a pointer to the pre-
     vious state information array.

     Once a state has been initialized, the sseettssttaattee() routine provides for
     rapid switching between states.  The sseettssttaattee() function returns a
     pointer to the previous state array; its argument state array is used for
     further random number generation until the next call to iinniittssttaattee() or
     sseettssttaattee().

     Once a state array has been initialized, it may be restarted at a differ-
     ent point either by calling iinniittssttaattee() (with the desired seed, the state
     array, and its size) or by calling both sseettssttaattee() (with the state array)
     and ssrraannddoomm() (with the desired seed).  The advantage of calling both
     sseettssttaattee() and ssrraannddoomm() is that the size of the state array does not
     have to be remembered after it is initialized.

     With 256 bytes of state information, the period of the random number gen-
     erator is greater than 2**69 which should be sufficient for most pur-
     poses.

AUTHORS     Earl T. Cohen

DIAGNOSTICS     If iinniittssttaattee() is called with less than 8 bytes of state information, or
     if sseettssttaattee() detects that the state information has been garbled, error
     messages are printed on the standard error output.

SEE ALSO
     arc4random(3), rand(3), srand(3), random(4)

HISTORY     These functions appeared in 4.2BSD.

BUGS
     About 2/3 the speed of rand(3).

     The historical implementation used to have a very weak seeding; the ran-
     dom sequence did not vary much with the seed.  The current implementation
     employs a better pseudo-random number generator for the initial state
     calculation.

     Applications requiring cryptographic quality randomness should use
     arc4random(3).

BSD                              June 4, 1993                              BSD