Pseudo-Random Number Generation System

A Pseudo-Random Number Generation System is a random number generator that can apply a pseudo-random number generation algorithm to solve a pseudo-random number generation task (to create pseudo-random numbers).

• AKA: PRNG, Pseudorandom Number Generator.
• Context:
  • It can meet certain tests of randomness.
  • …
• Counter-Example(s):
  • a Quantum-based Random Number Generation System.
• See: Synthetic Dataset Generator, Monte Carlo Algorithm.

---

---

References

2011

• http://en.wikipedia.org/wiki/Pseudorandom_number_generator
  • A pseudorandom number generator (PRNG) 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. Although sequences that are closer to truly random can be generated using hardware random number generators, pseudorandom numbers are important in practice for simulations (e.g., of physical systems with the Monte Carlo method), and are central in the practice of cryptography. Common classes of these algorithms are linear congruential generators, Lagged Fibonacci generators, linear feedback shift registers and generalised feedback shift registers. Recent instances of pseudorandom algorithms include Blum Blum Shub, Fortuna, and the Mersenne twister.

---