Large-order multiple recursive generators with modulus 2³¹-1

DOI10.1287/IJOC.1110.0477MaRDI QIDQ2815474zbMATH OpenOpenAlexFDO

Authors Lih-Yuan Deng, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu

Publication date 29 June 2016

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1110.0477

zbMATH Keywords

DX/DL/DS generatorsequidistributionPollard rho methodPollard's (\(p-1\)) methodportable and efficient generatorsprimality testing

Mathematics Subject Classification ID

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

Recommendations

• Efficient and portable multiple recursive generators of large order
• A 4217th-order multiple recursive random number generator with modulus \(2^{31} - 69\)
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
• Multiplicative, congruential random-number generators with multiplier ± 2 ^{k 1} ± 2 ^{k 2}

Cites work

• A monte carlo method for factorization
• A search for good multiple recursive random number generators
• A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• Average Case Error Estimates for the Strong Probable Prime Test
• Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences
• Beware of linear congruential generators with multipliers of the form a = ±2 ^q ±2 ^r
• Combined Multiple Recursive Random Number Generators
• Distribution of lattice points
• Efficient and portable multiple recursive generators of large order
• Factoring integers with elliptic curves
• Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 3223323 (Why is no real title available?)
• Improving random number generators in the Monte Carlo simulations via twisting and combining
• Multiplicative, congruential random-number generators with multiplier ± 2 ^{k 1} ± 2 ^{k 2}
• Prime numbers and computer methods for factorization.
• TestU01

Cited in

(12)

• Systematic searches for good multiple recursive random number generators
• Random numbers for parallel computers: requirements and methods, with emphasis on gpus
• On the lattice structure of a special class of multiple recursive random number generators
• A 4217th-order multiple recursive random number generator with modulus \(2^{31} - 69\)
• Full period of a multiple recursive random number generator with generalized Mersenne prime number
• Issues on Computer Search for Large Order Multiple Recursive Generators
• Efficient and portable multiple recursive generators of large order
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• scientific article; zbMATH DE number 2051214 (Why is no real title available?)
• Spectral test of DX and DL multiple recursive random number generators
• Developments in secure random number generators
• Efficient spectral tests for multiple recursive generators

Describes a project that uses

Uses Software

• TestU01
• UNIRAN

This page was built for publication: Large-order multiple recursive generators with modulus \(2^{31}-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815474)