Cryptanalysis of a Random Number Generator Based on a Double-Scroll Chaotic Oscillator

This study aims to present the algebraic cryptanalysis of a random number generator (RNG) which is implemented by a double-scroll chaotic oscillator. The proposed attack system targets the drawbacks of the RNG which is proved to converge to attack system through master-slave synchronization. Here, it is assumed that the architecture of the RNG and the scalar time series observations (acquired from the chaotic oscillator) are publicly known. Note that the numerical results and the applied simulation are presented in this paper for showing how the attack system is feasible and practical. According to the results, Diehard and Big Crush statistical test suites are not fulfilled. Moreover, the previous and subsequent bits can be predicted, hence the same output bit sequence can be reproduced by replicating the RNG.