.png){kind=icon}
Return
Random Numbers from a Delay Equation
.png){kind=icon}
OA
AI
DOI：10.1007/s00332-016-9306-9.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Delay differential equations can have chaotic solutions that can be used to mimic Brownian motion. Since a Brownian motion is random in its velocity, it is reasonable to think that a random number generator might be constructed from such a model. In this preliminary study, we consider one specific example of this and show that it satisfies criteria commonly employed in the testing of random number generators (from TestU01's very stringent Big Crush battery of tests). A technique termed digit discarding, commonly used in both this generator and physical RNGs using laser feedback systems, is discussed with regard to the maximal Lyapunov exponent. Also, we benchmark the generator to a contemporary common method: the multiple recursive generator, MRG32k3a. Although our method is about 7 times slower than MRG32k3a, there is in principle no apparent limit on the number of possible values that can be generated from the scheme we present here.
Keywords:
Pseudorandom number generator (PRNG)
Random number generator (RNG)
Differential delay equation (DDE)
Deterministic chaos
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
205
Citations:
3.2K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveFast random bit generation with bandwidth-enhanced chaos in semiconductor lasers.png)
OPTICS EXPRESS
OAAI
OPTICS EXPRESSIF3.3
OAAIShareSave
View more