On the Use of Reducible Polynomials as Random Number Generators
From MaRDI portal
Publication:4293976
Recommendations
Cites work
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- A review of pseudorandom number generators
- Figures of Merit for Digital Multistep Pseudorandom Numbers
- Maximum-length sequences, cellular automata, and random numbers
- On primitive trinomials (Mod 2)
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Primitive trinomials whose degree is a Mersenne exponent
- Recent trends in random number and random vector generation
- Some Factorizations of 2 n ± 1 and Related Results
- Thoughts on pseudorandom number generators
- Weights of cyclic codes
Cited in
(7)- Maximally equidistributed combined Tausworthe generators
- Using irreducible polynomials for random number generation
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Polynomial pseudo-random number generator via cyclic phase
- An experimental exploration of Marsaglia's \texttt{xorshift} generators, scrambled
- Uniform random number generation
- Maximum-length sequences, cellular automata, and random numbers
This page was built for publication: On the Use of Reducible Polynomials as Random Number Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4293976)
