How Can We Help?
Pseudorandom Number Generator (PRNG)
What’s a A Pseudorandom Number Generator (PRNG)?
A Pseudorandom Number Generator (PRNG) is an algorithm that produces a sequence of numbers that appears to be random, but is actually generated by a deterministic process. These sequences are not truly random, as they are determined by an initial value called a seed, which can be seeded with true randomness.
Definition
An algorithm that produces a sequence of bits that are uniquely determined from an initial value called a seed. The output of the PRNG “appears” to be random, i.e., the output is statistically indistinguishable from random values. A cryptographic PRNG has the additional property that the output is unpredictable, given that the seed is not known.
SOURCE: CNSSI-4009
See Also Geeks For Geeks description
Here’s more detail:
- Deterministic: PRNGs rely on a mathematical formula and a starting seed to generate the sequence. If you know the seed and the formula, you can predict the entire sequence.
- Appears Random: PRNGs are designed to produce sequences that pass statistical tests of randomness, making them useful in various applications.
- Applications: PRNGs are used in areas like simulations, games, and cryptography, where a sequence of seemingly random numbers is needed.
- Speed and Reproducibility: PRNGs are computationally efficient and can be easily replayed by using the same seed.
- Limitations: While useful, PRNGs are not truly random and can be predictable if the algorithm or seed is known. For applications requiring genuine unpredictability, like certain cryptographic uses, true random number generators (TRNGs) are preferred.
