Bit recycling for scaling random number generators
Andrea C. G. Mennucci

TL;DR
This paper explores efficient methods for scaling random number generators to produce uniform samples in arbitrary ranges, focusing on computational speed and mathematical efficiency.
Contribution
It introduces novel techniques for scaling RNG outputs to arbitrary ranges, improving efficiency over existing methods.
Findings
New scaling methods outperform traditional approaches in speed.
Techniques maintain statistical uniformity across various ranges.
Applicable to both hardware and algorithmic RNGs.
Abstract
Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide "true" random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate random numbers as independent uniform samples in a range , with or . In applications, it is instead sometimes desirable to draw random numbers as independent uniform samples in a range , where moreover M may change between drawings. Transforming the sequence to is sometimes known as scaling. We discuss different methods for scaling the RNG, both in term of mathematical efficiency and of computational speed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Algorithms and Data Compression · Cellular Automata and Applications
