Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

Can CA be used to construct random number generators?

April 26, 2017ca construct generators Used

0

Posted

Can CA be used to construct random number generators?

1 Answer

0

Posted

Contributions by: Nelson Minar See: nelson including a README.html, a bibliography, and lots of code. As for a quick summary.. there are two basic classes of generators in common use. Both classes have some theoretical grounding Linear Congruential Generator Lagged fibonacci LCGs have a lot of history and are the root of most random number libraries. As long as the modulus m is prime and a is chosen carefully, they seem to do fairly well. But many implementations choose m to be some power of 2, which result in low order bits with extremely low periods. The particular generator of this class I use is I have an article by Park and Miller in my bibliography about this generator: it’s period is . Lagged Fibonacci generators are also fairly old, but are not as well known. Knuth deprecates them for lack of theory, but that doesn’t seem entirely fair to me based on what I’ve read. Many choices of the function f have been suggested, usually very simple and fast ones. The o