Application Oriented Complexity Analysis of Digital Chaotic Sequence

To generate digital chaotic sequence and apply that in hardware encryption system, this paper presents the permutation entropy as a criterion of measuring the complexity of the chaotic sequences and the chaotic pseudo-random sequence. Set Tent, Henon and Logistic three kinds of chaotic systems as examples, analysis and comparison their three kinds of sequence complexity respectively which including the theoretical value, actual value and binary values. It is proved that the complexity of chaotic pseudo-random can reflect the complexity of the original system. The complexities of two kinds of sequences nearly, the pseudo-random sequence is basic to keep the characteristics of the original sequence. The improvement of quantitative method can make that the two are aligned. Researches also show that the complexity of the Logistic map is better than the others. The results of the study provide the theoretical and experimental basis for the application of chaotic sequence in the information security communication.