Security analysis of a random number generator based on a double-scroll chaotic circuit

In this study, an algebraic security analysis of a random number generator (RNG) which is built on a double-scroll chaotic circuit is put forward. An attack system is proposed to discover the security weaknesses of the RNG. The proposed attack system is proved to be valid by showing its convergence to the targeted system. Here, a master-slave synchronization scheme, which takes only the RNG structure and a scalar time series obtained from the chaotic oscillator as inputs, is applied. Simulation and numerical results verifying the feasibility of the attack system are given. The RNG does not fulfill Diehard and Big Crush statistical test suites, the previous and the next bit can be predicted, and the same output bit sequence of the RNG can be reproduced.