Related generators include xoroshiro128**, xoshiro256+ and xoshiro256**.Īn implementation of 64-bit maximally equidistributed F 2-linear generators with Mersenne prime period.Ī counter-based version of Middle Square Weyl Sequence RNG. RCB is described as a bit pattern generator made to overcome some of the shortcomings with Mersenne Twister and short periods/bit length restriction of shift/modulo generators.Ī variation on John von Neumann's original middle-square method, this generator may be the fastest RNG that passes all the statistical tests.Ī modification of Marsaglia's Xorshift generators, one of the fastest generators on modern 64-bit CPUs. Included in Java Development Kit 8 and above. ShawĪ simplified version of the AES block cipher, leading to very fast performance on system supporting the AES-NI.Ī simplified version of the Threefish block cipher, suitable for GPU implementations.Ī simplification and modification of the block cipher Threefish with the addition of an S-box.īased upon the final mixing function of MurmurHash3. MatsumotoĪ LFSR closely related with Mersenne Twister, aiming at remedying some of its shortcomings. Well equidistributed long-period linear (WELL)į. The xorwow generator is the default generator in the CURAND library of the nVidia CUDA application programming interface for graphics processing units. Marsaglia also suggested as an improvement the xorwow generator, in which the output of a xorshift generator is added with a Weyl sequence. It is a very fast sub-type of LFSR generators. Default generator in R and the Python language starting from version 2.3. In its MT19937 implementation is probably the most commonly used modern PRNG. Prototypical example of a combination generator.Ĭlosely related with LFSRs. for particle physics simulations.Ī method with roots in number theory, although never used in practical applications. A SWB generator is the basis for the RANLUX generator, widely used e.g. The rationale behind the MIXMAX family of generators relies on results from ergodic theory and classical mechanics.Ī modification of Lagged-Fibonacci generators.Ī modification of Lagged-Fibonacci generators. It is a member of the class of matrix linear congruential generator, a generalisation of LCG. Easy to extend for arbitrary period length and improved statistical performance over higher dimensions and with higher precision. With appropriate initialisations, passes all current empirical test suites, and is formally proven to converge. Simple to implement, fast, but not widely known. The Additive Congruential Random Number generator. Ī specific implementation of a Lehmer generator, widely used because it is included in C++ as the function minstd_rand0 from C++11 onwards. it is used in Excel 2003 and later versions for the Excel function RAND and it was the default generator in the language Python up to version 2.2. Also called Tausworthe generators.Ī combination of three small LCGs, suited to 16-bit CPUs. One of the very earliest and most influential designs.Ī generalisation of the Lehmer generator and historically the most influential and studied generator.Ī hugely influential design.
In its original form, it is of poor quality and of historical interest only. The following algorithms are pseudorandom number generators. Whenever using a pseudorandom number generator, keep in mind John von Neumann's dictum "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin." 3 Random number generators that use external entropy.1 Pseudorandom number generators (PRNGs).
0 kommentar(er)
