April 2005
Intermediate to advanced
312 pages
9h 16m
English
Programmers have invented many ways for computers to generate seemingly random numbers; the general name for these algorithms is pseudorandom number generators (PRNGs).
PRNGs suffice for trivial applications, such as generating “random” events for computer games or meaningless subject lines for particularly obtrusive unsolicited bulk mailings. For instance, take the linear congruent (aka power residue) generator,[44] a classic example of such an algorithm. Despite its obscure name, this random number generator performs a sequence of simple operations (multiplication, addition, and modulus[4]) every time it generates its “random” output. The generator uses its previous output rt to calculate the next output ...
Read now
Unlock full access