The k -distribution of generalized feedback shift register pseudorandom numbers
From MaRDI portal
Publication:3662622
Cited in
(21)- Fast lattice reduction for \(\mathbb F_2\)-linear pseudorandom number generators
- On Optimal GFSR Pseudorandom Number Generators
- Combined random number generator via the generalized Chinese remainder theorem
- The revised recursive reduction for efficiently generating random numbers
- A comparative study of some pseudorandom number generators
- Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
- Uses and abuses of statistical simulation
- On the structure of parallelized random number sources
- Matrices and the structure of random number sequences
- Several extensively tested multiple recursive random number generators
- Lattice computations for random numbers
- Recent trends in random number and random vector generation
- Thoughts on pseudorandom number generators
- Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- An equivalence relation between Tausworthe and GFSR sequences and applications
- Uniform random number generation
- A universal GFSR random number generator for personal computers
- Classes of GFSR sequences and their fast generation
- Resolution-stationary random number generators
- Geometric and statistical properties of pseudorandom number generators based on multiple recursive transformations
This page was built for publication: The k -distribution of generalized feedback shift register pseudorandom numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3662622)
