On the F2-linear relations of Mersenne Twister pseudorandom number generators

@article{Harase2014OnTF,
  title={On the F2-linear relations of Mersenne Twister pseudorandom number generators},
  author={Shin Harase},
  journal={Math. Comput. Simul.},
  year={2014},
  volume={100},
  pages={103-113}
}
  • S. Harase
  • Published 23 January 2013
  • Mathematics, Computer Science
  • Math. Comput. Simul.
Sequence generators obtained by linear recursions over the two-element field F 2 , i.e., F 2 -linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the most successful applications. An advantage of such generators is that we can assess them quickly by using theoretical criteria, such as the dimension of equidistribution with v -bit accuracy. To compute these dimensions, several polynomial-time lattice reduction algorithms have… 
Scrambled Linear Pseudorandom Number Generators
TLDR
A new test for Hamming-weight dependencies that is able to discover subtle, previously unknown biases in existing generators (in particular, in linear ones), and a number of scramblers, that is, nonlinear functions applied to the state array that reduce or delete the linear artifacts.
Conversion of Mersenne Twister to double-precision floating-point numbers
  • S. Harase
  • Computer Science, Mathematics
    Math. Comput. Simul.
  • 2019
TLDR
This paper reports that MT19937 with a specific lag set fails several statistical tests, such as the overlapping collision test, matrix rank test, and Hamming independence test, by investigating hidden F 2 -linear relations among the bits of high-dimensional outputs.
Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
TLDR
A pseudorandom bit generator using chaotic true orbits of the Bernoulli map on real cubic algebraic integers having complex conjugates is developed and upper bounds concerning the growth of the representation of points on a true orbit are given.
It is high time we let go of the Mersenne Twister
  • S. Vigna
  • Mathematics, Computer Science
    ArXiv
  • 2019
TLDR
This paper surveys the results for the non-specialist, providing new, simple, understandable examples, and it is intended as a guide for the final user, or for language implementors, so that they can take an informed decision about whether to use the Mersenne Twister or not.
Implementing 64-bit Maximally Equidistributed Mersenne Twisters
TLDR
64-bit maximally equidistributed pseudorandom number generators that are optimal in this respect and have speeds equivalent to 64-bit Mersenne Twisters are developed.
Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period
TLDR
64-bit maximally equidistributed pseudorandom number generators that are optimal in this respect and have speeds equivalent to 64-bit Mersenne Twisters are developed.
Robust Chaos of Cubic Polynomial Discrete Maps with Application to Pseudorandom Number Generators
Based on the robust chaos theorem of S-unimodal maps, this paper studies a kind of cubic polynomial discrete maps (CPDMs) and sets up a novel theorem. This theorem gives general conditions for the
The development of GPU-based parallel PRNG for Monte Carlo applications in CUDA Fortran
TLDR
The developed GPPRNG can be used as a fast and accurate tool for computational science applications and was compared to that of some other commercially available PPRNGs such as MATLAB, FORTRAN and Miller-Park algorithm.
Accelerating the SCE-UA Global Optimization Method Based on Multi-Core CPU and Many-Core GPU
The famous global optimization SCE-UA method, which has been widely used in the field of environmental model parameter calibration, is an effective and robust method. However, the SCE-UA method has a
2D axial-azimuthal particle-in-cell benchmark for low-temperature partially magnetized plasmas
The increasing need to demonstrate the correctness of computer simulations has highlighted the importance of benchmarks. We define in this paper a representative simulation case to study
...
1
2
...

References

SHOWING 1-10 OF 46 REFERENCES
Fast lattice reduction for F2-linear pseudorandom number generators
TLDR
This paper proposes a similar but faster algorithm, where the state space is used to represent vectors with components in the formal power series, the dual lattice is not necessary, and Lenstra reduction is replaced with a simpler basis reduction.
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
TLDR
A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers, which provides a super astronomical period of 2 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words.
On the distribution of k -dimensional vectors for simple and combined Tausworthe sequences
The lattice structure of conventional linear congruential random number generators (LCGs), over integers, is well known. In this paper, we study LCGs in the field of formal Laurent series, with
An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm
  • S. Harase
  • Computer Science, Mathematics
    J. Comput. Appl. Math.
  • 2011
TLDR
A fast lattice reduction algorithm by Mulders and Storjohann is used instead of Schmidt’s algorithm, and the order of computational complexity is lessened, and it is reported that just using a sparsest initial state significantly accelerates the lattice computation, in the case of Mersenne Twister generators.
Improved long-period generators based on linear recurrences modulo 2
TLDR
This article proposes new generators of that form with better equidistribution and “bit-mixing” properties for equivalent period length and speed and illustrates how this can reduce the impact of persistent dependencies among successive output values, which can be observed in certain parts of the period of gigantic generators such as the Mersenne twister.
The k-distribution of generalized feedback shift register pseudorandom numbers
A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a
F2-Linear Random Number Generators
TLDR
The most interesting construction methods for random number generators based on linear recurrences modulo 2 are reviewed, their theoretical and empirical properties are examined, the relevant computational tools and algorithms are described, and comparisons are made.
Maximally equidistributed pseudorandom number generators via linear output transformations
  • S. Harase
  • Mathematics, Computer Science
    Math. Comput. Simul.
  • 2009
TLDR
A new strategy to find linear output transformations attaining the Me property is introduced, and a modified version of the WELL generators with the ME property is found, having fewer operations than the original ME THE AUTHORS well generators.
On the use of reducible polynomials as random number generators
The randomness properties and the hierarchy of correlation coefficients are studied of approximate-maximum-length sequences, for which the characteristic polynomial is a product of several primitive
An Asymptotically Random Tausworthe Sequence
TLDR
An asymptotically random 23-bit number sequence of astronomic period, 2607 - 1, is presented and possesses equidistribution and multidimensional uniformity properties vastly in excess of anything that has yet been shown for conventional congruentially generated sequences.
...
1
2
3
4
5
...