A 32-bit linear congruential random number generator with prime modulus

DOI10.1080/09720529.2010.10698310MaRDI QIDQ3008540zbMATH OpenOpenAlexFDO

Authors Kuang-Hang Hsieh, Hwapeng Chang, Hui-Chin Tang

Publication date 22 June 2011

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL http://www.connectjournals.com/file_html_pdf/812805H_479-486a.pdf

zbMATH Keywords

full periodlinear congruential generatorMersenne primeSophie-Germain primespectral test

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Recommendations

• An analysis of linear congruential random number generators when multiplier restrictions exist
• 32-bit multipliers for linear congruential random number generators
• Parallel linear congruential generators with prime moduli
• A random number generator for 16-bit microcomputers
• A 4217th-order multiple recursive random number generator with modulus \(2^{31} - 69\)

Cited in

(4)

• Searching for good two-term fifth-order multiple recursive random number generators
• Implementing 64-bit Maximally Equidistributed F ₂ -Linear Generators with Mersenne Prime Period
• 32-bit multipliers for linear congruential random number generators
• An analysis of linear congruential random number generators when multiplier restrictions exist

Describes a project that uses

Uses Software

• SAS

This page was built for publication: A 32-bit linear congruential random number generator with prime modulus

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