It is impossible for a computer algorithm to produce truly random numbers, without relying on some external-to-the-machine source of random noise to sample. As such, many “random” number generators on computers are in fact pseudorandom – they follow some sequence of steps to produce a new number each time they are called, but if you knew the state of the PRNG (pseudorandom number generator) — usually, the state consists of the previous n output values, for some value of n; often n=1 — you could of course follow the same sequence of steps and compute the value for yourself.

Choose a pseudorandom number generator that is used extensively, such as the one provided by an operating system, or one that was commonly used by a popular programming language.
Briefly discuss the pseudorandom number generator’s type and operation.
How strong is the generator (for example, what is the period of the PRNG)? What attacks is it vulnerable to?
In APA format, include scholarly sources to support your thoughts.

Sample Solution