2000
DOI: 10.1145/369534.369540
|View full text |Cite
|
Sign up to set email alerts
|

Tables of 64-bit Mersenne twisters

Abstract: We give new parameters for a Mersenne Twister pseudorandom number generator for 64-bit word machines.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
42
0
3

Year Published

2007
2007
2016
2016

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(45 citation statements)
references
References 17 publications
0
42
0
3
Order By: Relevance
“…In these publications, the concept of uniform random numbers in PRNG actively uses the operations of bit logic. Great success has been found in directions such as linear congruential generators (Niederreiter, 1995;Entacher, 1999) and in twisting algorithm generators where Mersenne numbers are usually used (Matsumoto and Kurita, 1992;1994;Matsumoto and Nishimura, 1998;Nishimura, 2000). Important results were received in the use of approaches such as Fibonacci numbers (Makino, 1994;Aluru, 1997), Blum-Blum-Shub algorithm (Blum et al, 1986) and others.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In these publications, the concept of uniform random numbers in PRNG actively uses the operations of bit logic. Great success has been found in directions such as linear congruential generators (Niederreiter, 1995;Entacher, 1999) and in twisting algorithm generators where Mersenne numbers are usually used (Matsumoto and Kurita, 1992;1994;Matsumoto and Nishimura, 1998;Nishimura, 2000). Important results were received in the use of approaches such as Fibonacci numbers (Makino, 1994;Aluru, 1997), Blum-Blum-Shub algorithm (Blum et al, 1986) and others.…”
Section: Related Workmentioning
confidence: 99%
“…Partially this approach was used in the classic research articles published by Japanese researches (Matsumoto and Nishimura, 1998;Nishimura, 2000). They have built several generators, including the well-known MT19937 (or MT19937-64 for the implementation that uses a 64-bit word length), which can reach a big value of repeatability as 2 19937 -1 and that is excellent for some special cases.…”
Section: Twisting Generatorsmentioning
confidence: 99%
“…The operations implemented by this matrix are called tempering and their purpose is to improve the uniformity of the points produced by the RNG. The Mersenne twister (Matsumoto and Nishimura, 1998;Nishimura, 2000) is a variant of the TGFSR where k is slightly less than pq and can be a prime number. A specific instance proposed by Matsumoto and Nishimura (1998) is fast, robust, has the huge period length of 2 19937 − 1, and has become quite popular.…”
Section: The Gfsr and Twisted Gfsrmentioning
confidence: 99%
“…Variations on generalized feedback shift register (GFSR) algorithms include the Ziff (6) RNG gfsr, a four-tap GFSR algorithm, the Mersenne Twister (7,8) 32-bit version mt and 64-bit version mt64 (tested as mtx and mtx32), and the well-equidistributed long-period linear (9) RNG well1024a.…”
Section: Random Number Generatorsmentioning
confidence: 99%