LYCOS RETRIEVER 
Pseudorandom Number Generator: Pseudorandom Number Generators
built 783 days ago
This is a Mersenne Twister pseudorandom number generator with period 2^19937-1 with improved initialization scheme, modified on 2002/2/10 by Takuji Nishimura and Makoto Matsumoto. This is a faster version by taking Shawn Cokus's optimization, Matthe Bellew's simplification, Isaku Wada's real version.
Source:
A "fast, compact, huge-period generator" based on M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator", to appear in ACM Trans. on Modeling and Computer Simulation. It is a twisted GFSR generator with a Mersenne-prime period of 2^19937-1, uniform on open interval (0,1) For further information, see http://www.math.keio.ac.jp/~matumoto/emt.html
Source:
Multi Giga (MUGI™) cipher is Hitachi's pseudorandom number generator for a stream cipher. In addition to the security, it is possible to realize high-speed processing of bulk data at low cost and light load by implementing MUGI on 64-bit processor, 32-bit processor and LSI. For example, in the case of encryption or decryption of image data for a single DVD (4.7GB) using a software of a personal computer (Intel® Pentium® 4.2GHz processor), the processing time (except for disk access time) is about 36 seconds. Moreover, when a proprietary chip is used, the processing time is about 3 seconds and high-speed scrambling is attained in the small-scale circuit (46K gate). MUGI™ is a registered trademark of Hitachi, Ltd. in Japan.
Source:
Among the numerous applications of the elementary properties of quadratic congruences are identification schemes and secure pseudorandom number generators. Public-key identification schemes are the analogs of the Personal Identification Numbers (PIN) or passwords. Public-key identification schemes are designed to protect against security problems that arise when a secret key is compromised. Instead of revealing the secret key to verify a person's identity, these schemes provide a mechanism for a person to prove that he/she knows the secret key. A proof of identity is based on some computation involving this key, and the intermediate results of the computation are different for each identification session. Someone listening to the exchange will not be able to use the data to impersonate, because in a well-designed system, the computations will be different in the next session.
Source:
"This is a brief review of the current situation concerning practical pseudorandom number generation for Monte Carlo calculations. The conclusion is that pseudorandom number generators with the required properties are now available, but the generators actually used are often not good enough. Portable Fortran code is given for three different pseudorandom number generators, all of which have much better properties than any of the traditional generators commonly supplied in most program libraries."
Source:
The only graph that displays an interesting spectrum is that produced by the bad pseudorandom number generator. But, as interesting as it may be, the spectrum clearly flags the generator as a very poor random number source.The other graphs display noisy or random spectra, reminiscent of the background white noise or hiss produced by audio amplifiers.
Source:
MORE ABOUT
Pseudorandom Number Generators