Random number generators based on linear recurrences in F₂^w
From MaRDI portal
Publication:4453520
Recommendations
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- On linear recursion and pseudorandomness
- Pseudorandomness of binary sequences derived from linear recursions
- Efficient jump ahead for \(\mathbb{F}_{2}\)-linear random number generators
- Construction of equidistributed generators based on linear recurrences modulo 2
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Recent results on recursive nonlinear pseudorandom number generators (invited paper)
- Construction of uniformly distributed linear recurring sequences modulo powers of 2
- scientific article; zbMATH DE number 1372516
- On the lattice structure of a special class of multiple recursive random number generators
Cited in
(10)- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- A class of random number generators based on Weyl sequence
- The revised recursive reduction for efficiently generating random numbers
- A new pseudorandom number generator AST
- Pseudorandom Number Generator Using Optimal Normal Basis
- Construction of equidistributed generators based on linear recurrences modulo 2
- Efficient random number generation on FPGA-s
- Using irreducible polynomials for random number generation
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- Resolution-stationary random number generators
This page was built for publication: Random number generators based on linear recurrences in \(\mathbb{F}_{2^w}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453520)
