Some common ways of doing this utilize Schrage's multiplication algorithm for increased performance, and a fast method of doing this was developed by Matsumoto and Nishimura.
Alistair Walker developed a fast, space-efficient way to do this process repeatedly known as the method of aliases.   Some common ways of doing this utilize Schrage's multiplication algorithm for increased performance, and a fast method of doing this was developed by Matsumoto and Nishimura. An important paper that showed it was possible to do this effectively for any polynomial-time algorithm was authored by Silvio Micali and Manuel Blum. One method of doing this is named for Blum, Blum, and Shub, and another commonly used method is the Mersenne Twister.  The linear congruence method is a naive way of doing this that involves taking the modulo of a linear relation of the previous result, generally involving large primes.  Performing this process is necessary for Monte Carlo methods or to generate a cryptographic key, and most ways of doing this require input of a seed value.  For 10 points, name this process which should ideally result in a series of unpredictable values.
Alistair Walker developed a fast, space-efficient way to do this process repeatedly known as the method of aliases.   
{Pseudorandom Number Generation} [accept {pretty much} anything that {includes} the word “{random}” and {implies} an {input value} is {being generated}; accept {sampling} from a {random distribution}, since the first clue {technically} points to that; prompt on {randomization}]