Security analysis of a chaos-based random number generator for applications in cryptography

In this paper we present an algebraic attack on a chaos-based random number generator (RNG). In order to analyze the security weaknesses of the RNG, an attack system is proposed based on master slave synchronization scheme. The aim of this attack system is to verify if it is possible to reveal secret parameters of the RNG and to predict the next bit where the only information available are the structure of the RNG and a scalar time series observed from the chaotic system. Simulation and numerical results of the attack system are given, showing that for the proposed RNG the future evolution of the chaotic system cannot be determined which makes the proposed RNG suitable for applications in cryptography.