A **pseudorandom number generator** (**PRNG**), also known as a **deterministic random bit generator** (**DRBG**), is an algorithm for generating a sequence of numbers that approximates the properties of random numbers. The sequence is not truly random in that it is completely determined by a relatively small set of initial values, called the PRNG's *state*, which includes a truly random seed. Although sequences that are closer to truly random can be generated using hardware random number generators, *pseudorandom* numbers are important in practice for their speed in number generation and their reproducibility, and they are thus central in applications such as simulations (e.g., of physical systems with the Monte Carlo method), in cryptography, and in procedural generation. Good statistical properties are a central requirement for the output of a PRNG, and common classes of suitable algorithms include linear congruential generators, lagged Fibonacci generators, and linear feedback shift registers. Cryptographic applications require the output to also be unpredictable, and more elaborate designs, which do not inherit the linearity of simpler solutions, are needed. More recent instances of PRNGs with strong randomness guarantees are based on computational hardness assumptions, and include the Blum Blum Shub, Fortuna, and Mersenne Twister algorithms.

In general, careful mathematical analysis is required to have any confidence that a PRNG generates numbers that are sufficiently "random" to suit the intended use. John von Neumann cautioned about the misinterpretation of a PRNG as a truly random generator, and joked that "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin." Robert R. Coveyou of Oak Ridge National Laboratory once titled an article, "The generation of random numbers is too important to be left to chance."

Read more about Pseudorandom Number Generator: Periodicity, Problems With Deterministic Generators, Early Approaches, Mersenne Twister, Cryptographically Secure Pseudorandom Number Generators, BSI Evaluation Criteria, Non-uniform Generators

### Other articles related to "pseudorandom number generator, numbers, generator, number, pseudorandom":

... Fisher–Yates shuffle is used with a

**pseudorandom number generator**or PRNG as the sequence of

**numbers**output by such a

**generator**is entirely determined by its internal state ... Even when the

**number**of possible states exceeds the

**number**of permutations, the irregular nature of the mapping from sequences of

**numbers**to permutations means that some ... Thus, to minimize bias, the

**number**of states of the PRNG should exceed the

**number**of permutations by at least several orders of magnitude ...

... This article discusses the

**number**thirty-eight. 39 ... → 38 ← 39 ... → List of

**numbers**— Integers 90 ... → Cardinal thirty-eight Ordinal 38th (thirty-eighth) Factorization Divisors 1, 2, 19, 38 ...

**Pseudorandom Number Generator**- Non-uniform Generators

...

**Numbers**selected from a non-uniform probability distribution can be generated using a uniform distribution PRNG and a function that relates the two distributions ... Using a random

**number**c from a uniform distribution as the probability density to "pass by", we get so that is a

**number**randomly selected from distribution ... distribution however when using practical

**number**representations, the infinite "tails" of the distribution have to be truncated to finite values ...

... does in fact fall in the thirty-ninth position The retired jersey

**number**of former baseball player Roy Campanella The book series "The 39 Clues" revolves around 39 clues ... History The

**number**of signers to the United States Constitution, out of 55 members of the Philadelphia Convention delegates The traditional

**number**of times citizens of ... Japanese Internet chat slang for "thank you" when written with

**numbers**(3=san 9=kyu) Pier 39 in San Francisco The

**number**of the French department Jura In Afghanistan, the

**number**39 is considered ...

... A random seed (or seed state, or just seed) is a

**number**(or vector) used to initialize a

**pseudorandom number generator**... For a seed to be used in a

**pseudorandom number generator**, it does not need to be random ... Because of the nature of

**number**generating algorithms, so long as the original seed is ignored, the rest of the values that the algorithm generates will follow probability distribution in a

**pseudorandom**manner ...

### Famous quotes containing the words generator and/or number:

“He admired the terrible recreative power of his memory. It was only with the weakening of this *generator* whose fecundity diminishes with age that he could hope for his torture to be appeased. But it appeared that the power to make him suffer of one of Odette’s statements seemed exhausted, then one of these statements on which Swann’s spirit had until then not dwelled, an almost new word relayed the others and struck him with new vigor.”

—Marcel Proust (1871–1922)

“... is it not clear that to give to such women as desire it and can devote themselves to literary and scientific pursuits all the advantages enjoyed by men of the same class will lessen essentially the *number* of thoughtless, idle, vain and frivolous women and thus secure the [sic] society the services of those who now hang as dead weight?”

—Sarah M. Grimke (1792–1873)