Abstract
In this article, cryptanalysis and improvement of a chaos-based random number generator (RNG) are described. An attack system was proposed to explore the security weaknesses of the chaos-based RNG. The convergence of the attack system has been proven using the scheme of master-slave synchronization. Future evaluation of the RNG was derived from a scalar time series where the only available information is the structure of the RNG and a scalar time series observed from the chaotic oscillator. Simulation and numerical results confirming the feasibility of the attack system are given. It has been confirmed that deterministic chaos phenomena can not be represented as a source of randomness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
