A system of high-dimensional, efficient, long-cycle and portable uniform random number generators

DOI10.1145/945511.945513zbMath1198.65026OpenAlexW2145218017MaRDI QIDQ3549150

Hongquan Xu, Lih-Yuan Deng

Publication date: 21 December 2008

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/945511.945513

zbMATH Keywords

algorithmscomputations in finite fields

Mathematics Subject Classification ID

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

Related Items (11)

Spectral test of DX and DL multiple recursive random number generators ⋮ On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators ⋮ Efficient computer search of large-order multiple recursive pseudo-random number generators ⋮ On elliptic curve $L$-functions integrated encryption scheme ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ A 4217th-order multiple recursive random number generator with modulus 2³¹– 69 ⋮ Improving random number generators in the Monte Carlo simulations via twisting and combining ⋮ Theoretical analyses of forward and backward heuristics of multiple recursive random number generators ⋮ 64-bit and 128-bit DX random number generators ⋮ Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 ⋮ Unnamed Item

This page was built for publication: A system of high-dimensional, efficient, long-cycle and portable uniform random number generators