On the Use of Reducible Polynomials as Random Number Generators

DOI10.2307/2153173zbMath0795.65001OpenAlexW4256046869MaRDI QIDQ4293976

A. Compagner, Dakai Wang

Publication date: 10 July 1994

Full work available at URL: https://doi.org/10.2307/2153173

zbMATH Keywords

random number generationlarge-scale Monte Carlo simulations

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

Maximally equidistributed combined Tausworthe generators, On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators, Polynomial pseudo-random number generator via cyclic phase, Uniform random number generation, An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled

Uses Software

• PSEUDORAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thoughts on pseudorandom number generators
• Recent trends in random number and random vector generation
• A review of pseudorandom number generators
• Maximum-length sequences, cellular automata, and random numbers
• Optimal characteristic polynomials for digital multistep pseudorandom numbers
• Figures of Merit for Digital Multistep Pseudorandom Numbers
• Weights of cyclic codes
• Some Factorizations of 2 n ± 1 and Related Results
• On primitive trinomials (Mod 2)
• Primitive trinomials whose degree is a Mersenne exponent