Some of the comments from researchers(1998)

"This special issue contains articles contributing to these two aspects.
In the first article, Matsumoto and Nishimura propose a class of
generators based on linear recurrences modulo 2.
These generators are very
fast, have extremely long periods, and appear quite robust.
They provide an implementation in C for a specific instance
with period length 2^199371. This generator produces
32bit numbers, and every kdimensional vector of such numbers
appears the same number of times as k successive values over the
period length, for each k<=623 (except for the zero vector,
which appears one time less). If one looks at only the first
n bits of each number, for n <=16, then the property holds for
a larger k, given in Table II of their paper."
(From Guest Editorial Introduction of the forthcoming volume
of ACM TOMACS Special Issue on Uniform Random Number Generation.)

"Thank you for sending me your very interesting paper on the Mersenne Twister.
I still remember your talk on this topic in Montreal which made a big
impression there." (Prof. H.Niederreiter.)

"I would like to study your generators more closely. At the moment, the
best generator of all types of
generators I have seen published seems to be TT800, according to our
empirical tests and on the basis
of theoretical support."
(Prof. P. Hellekalek, 1996.
Note that MT19937 is an improved version of TT800.)