Generation of nonrecursive n -bit pseudorandom numbers based on -transformation on [1, 2) ( n = 64, 128, 192, , 8192)

DOI10.1515/MCMA-2025-2015MaRDI QIDQ6930998zbMATH OpenFDO

Authors Hirotake Yaguchi

Publication date 11 September 2025

Published in Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/MCMA-2025-2015

zbMATH Keywords

\( \beta \)-transformationnonrecursivepseudorandom number generationrandom number

Mathematics Subject Classification ID

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

Cites work

• A new nonrecursive pseudorandom number generator based on chaos mappings
• Randomness of Horner’s rule and a new method of generating random numbers
• TestU01

Cited in

(1)

• Generation of nonrecursive n-bit pseudorandom numbers by two times (n-bit) (n-bit) multiplication (n = 64, 128, 192, , 16384)

This page was built for publication: Generation of nonrecursive \(n \)-bit pseudorandom numbers based on \(\beta \)-transformation on \([1, 2)\) (\( n = 64, 128, 192, \dots, 8192\))

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