A Pseudo Random Number Generator from Chaos
Nabarun Mondal, Partha P. Ghosh

TL;DR
This paper introduces a chaos-based pseudo-random number generator derived from fixed point iteration of a mathematical function, demonstrating its cryptographic suitability through passing standard randomness tests.
Contribution
It presents a novel chaos-based method for generating random numbers and validates its effectiveness with standard randomness tests, suitable for cryptographic applications.
Findings
Passes Diehard and NIST randomness tests
Exhibits chaotic behavior in digital simulation
Qualifies for cryptographic quality random number generation
Abstract
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract random bytes from this simulation. Diehard and NIST test suite for randomness detection is run on this bytes, and it is found to pass all the tests in the suite. Thus, this method qualifies even for cryptographic quality random number generation.
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 · Numerical Methods and Algorithms · Cellular Automata and Applications
