Page History

Pseudo random Pseudorandom number generators use mathematical algorithms to produce a sequence of numbers with good statistical properties, but the numbers produced are not genuinely random.

...

enum {len = 12};
char id[len];  /* id will hold the ID, starting with the characters "ID" */
               /* followed by a random integer */
int r;
int num;
/* ... */
r = rand();  /* generate a random integer */
num = snprintf(id, len, "ID%-d", r);  /* generate the ID */
/* ... */

Non-Compliant Code Example

...

A better pseudo random pseudorandom number generator is the BSD function random() function.

Code Block
bgColor #FFCCCC
enum {len = 12}; char id[len]; /* id will hold the ID, starting with the characters "ID" */ /* followed by a random integer */ int r; int num; /* ... */ srandom(time(0)); /* seed the PRNG with the current time */ /* ... */ r = random(); /* generate a random integer */ num = snprintf(id, len, "ID%-d", r); /* generate the ID */ /* ... */

However, the instance of the random() function in this example uses time(0) as a seed. With a trivial seed like time(0), however, the results from random() are also predictable.

...

When unpredictability really matters and speed is not an issue, use a true entropy source such as /dev/random or even a hardware source such as a quantum mirror. In most cases, however, it will be acceptable to simply use a pseudo-random number generator from a cryptographic library (such as a the Mersenne Twister) and seed it with data that are read from /dev/random.a hardware device capable of generating random numbers. The /dev/random device may block for a long time if there are not enough events going on to generate sufficient entropy. From the Linux urandom(4) manual page:

A read from the /dev/urandom device will not block waiting for more entropy. As a result, if there is not sufficient entropy in the entropy pool, the returned values are theoretically vulnerable to a cryptographic attack on the algorithms used by the driver. Knowledge of how to do this is not available in the current non-classified literature, but it is theoretically possible that such an attack may exist. If this is a concern in your application, use /dev/random instead.

In most cases, however, it will be acceptable to simply use a pseudorandom number generator from a cryptographic library (such as the Mersenne Twister) and seed it with data read from /dev/random.

The rand48 family of functions provides another pseudo-random alternative for pseudorandom numbers.

Code Block
bgColor #ccccff
long int li; FILE* fd; if(!(fd = fopen("/dev/random", "r")) { /* Handle error condition */ } if(fread(&li, sizeof(li), 1, fd) != sizeof(li)) { /* Handle error condition */ } fclose(fd); printf("Random number: %ld\n", li);

Compliant Solution (Windows)

...

Another option on systems that support it is arc4random(). From the arc4random(3) manual page:

arc4random() fits into a middle ground not covered by other subsystems such as the strong, slow, and resource expensive random devices described in random(4) versus the fast but poor quality interfaces described in rand(3), random(3), and drand48(3).

Compliant Solution (Windows)

On Windows platforms, the CryptGenRandom() function may be used to generate cryptographically strong random numbers. It is important to note, however, that the exact details of the implementation are unknown, and it is undetermined as to what source of entropy the CryptGenRandom() uses. From the Microsoft Developer Network CryptGenRandom() reference:

If an application has access to a good random source, it can fill the pbBuffer buffer with some random data before calling CryptGenRandom(). The CSP then uses this data to further randomize its internal seed. It is acceptable to omit the step of initializing the pbBuffer buffer before calling CryptGenRandom().

#include<Wincrypt.h>


HCRYPTPROV hCryptProv;
union {
    BYTE bs[sizeof(long int)];
    long int li;
} rand_buf;

if(!CryptGenRandom(hCryptProv, sizeof(rand_buf), &rand_buf) {
    /* Handle error */
} else {
    printf("Random number: %ld\n", rand_buf.li);
}

...