The Complexity Analysis of Chaotic Systems

Wei Xu, Bingbing Song, Chunlei Fan, Qun Ding, Shu-Chuan Chu

    Research output: Contribution to conferencePaper

    Abstract

    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.

    Original languageEnglish
    Pages311-320
    Number of pages10
    DOIs
    Publication statusE-pub ahead of print - 2014
    EventThe First Euro-China Conference on Intelligent Data Analysis and Applications - Shenzhen, China
    Duration: 13 Jun 201415 Jun 2014

    Conference

    ConferenceThe First Euro-China Conference on Intelligent Data Analysis and Applications
    CountryChina
    CityShenzhen
    Period13/06/1415/06/14

    Fingerprint Dive into the research topics of 'The Complexity Analysis of Chaotic Systems'. Together they form a unique fingerprint.

  • Cite this

    Xu, W., Song, B., Fan, C., Ding, Q., & Chu, S-C. (2014). The Complexity Analysis of Chaotic Systems. 311-320. Paper presented at The First Euro-China Conference on Intelligent Data Analysis and Applications, Shenzhen, China. https://doi.org/10.1007/978-3-319-07773-4_31