Analysis on Random-like Property of Chaotic Motions With Exhaustive Entropy

This paper proposes an algorithm for identification of the strength of random-like property of chaotic motions. With regard to certain chaotic motion, the steps of exhaustive history of its sequence in producing process are calculated firstly, then the percentage of each exhaustive component is determined according to the length of its sequence, and exhaustive entropy of the chaotic sequence is obtained. Simulation results for discrete chaotic maps and continuous chaotic motions show that the method is valid for identification of the strength of random-like property of different chaotic motions. It has practical application prospect in digital chaos secure communication.