On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
From MaRDI portal
Publication:2229848
DOI10.1016/j.matcom.2014.02.002OpenAlexW2031587957WikidataQ56081922 ScholiaQ56081922MaRDI QIDQ2229848
Publication date: 18 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5435
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (4)
Fast hydrological model calibration based on the heterogeneous parallel computing accelerated shuffled complex evolution method ⋮ Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers ⋮ Conversion of mersenne twister to double-precision floating-point numbers ⋮ Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved long-period generators based on linear recurrences modulo 2
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- Improving random number generators in the Monte Carlo simulations via twisting and combining
- Advancing the frontiers of simulation. A Festschrift in honor of George Samuel Fishman
- Maximally equidistributed pseudorandom number generators via linear output transformations
- Factoring multivariate polynomials over finite fields
- Construction and estimation of bases in function fields
- Factorization of polynomials and some linear-algebra problems over finite fields
- The multiple-recursive matrix method for pseudorandom number generation
- On lattice reduction for polynomial matrices
- Monte Carlo and quasi-Monte Carlo sampling
- Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators
- A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition
- TestU01
- Hensel and Newton Methods in Valuation Rings
- Mersenne twister
- The k-Dimensional Distribution of Combined GFSR Sequences
- On the Use of Reducible Polynomials as Random Number Generators
- Strong deviations from randomness in m -sequences based on trinomials
- The intractability of computing the minimum distance of a code
- Twisted GFSR generators II
- Lattice computations for random numbers
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- An Asymptotically Random Tausworthe Sequence
- On the performance of birthday spacings tests with certain families of random number generators
- 64-bit and 128-bit DX random number generators
This page was built for publication: On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
