Maximally equidistributed pseudorandom number generators via linear output transformations
From MaRDI portal
Publication:1005192
DOI10.1016/j.matcom.2008.06.006zbMath1159.65302OpenAlexW1979033430MaRDI QIDQ1005192
Publication date: 9 March 2009
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2008.06.006
random number generationlinear feedback shift register sequencelinear output transformationsmaximal equidistributionMersenne twister
Related Items (3)
An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators
Uses Software
Cites Work
- Unnamed Item
- Improved long-period generators based on linear recurrences modulo 2
- Factoring multivariate polynomials over finite fields
- Tables of maximally equidistributed combined LFSR generators
- Mersenne twister
- Twisted GFSR generators II
- Twisted GFSR generators
- Maximally equidistributed combined Tausworthe generators
- Lattice computations for random numbers
- Random Numbers Generated by Linear Recurrence Modulo Two
- An Asymptotically Random Tausworthe Sequence
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
This page was built for publication: Maximally equidistributed pseudorandom number generators via linear output transformations