The complexity of the sequence is an important index of quantify the performance of chaotic sequence. In order to select a higher complexity of chaotic sequence and apply it in hardware encryption system, this paper analyzes chaotic complexity quantitative analysis methods and presents the approximate entropy and permutation entropy as criterion of measuring the complexity of the chaotic sequences. Set tent, logistic and henon three kinds of chaotic systems as examples, and we analysis and comparison their complexity. It is proved that the two kinds algorithms are effective, and can distinguish different complex chaos and chaotic sequences. Researches show that the complexity of the Logistic map is greater than that of other chaotic systems. The results of the study provide the theoretical and experimental basis for the application of chaotic sequence in hardware encryption system and the information security communication.
|Number of pages||10|
|Publication status||E-pub ahead of print - 2014|
|Event||The First Euro-China Conference on Intelligent Data Analysis and Applications - Shenzhen, China|
Duration: 13 Jun 2014 → 15 Jun 2014
|Conference||The First Euro-China Conference on Intelligent Data Analysis and Applications|
|Period||13/06/14 → 15/06/14|