Algebraic break of a chaos-based random number generator

Abstract

In this paper, algebraic break of a chaos-based random number generator (RNG) is introduced. An attack system is proposed to discover the security weaknesses of the chaos-based RNG. The convergence of the attack system has been proved using the master-slave synchronization scheme. Future evaluation of the RNG is achieved when the only information available 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 verified that the chaos phenomena can't be represented as the source of a true random number generator.