The Complexity Analysis of Chaotic Systems

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

doi:10.1007/978-3-319-07773-4_31

The Complexity Analysis of Chaotic Systems

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

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	311-320
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-319-07773-4_31
Publication status	Published - 2014
Event	The First Euro-China Conference on Intelligent Data Analysis and Applications - Shenzhen, China Duration: 13 Jun 2014 → 15 Jun 2014

Conference

Conference	The First Euro-China Conference on Intelligent Data Analysis and Applications
Country/Territory	China
City	Shenzhen
Period	13/06/14 → 15/06/14

Keywords

Approximate entropy
Chaos
Complexity
Permutation entropy

Access to Document

10.1007/978-3-319-07773-4_31

Cite this

@conference{d1e133e9a49d401ebf03efdc2c728638,

title = "The Complexity Analysis of Chaotic Systems",

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.",

keywords = "Approximate entropy, Chaos, Complexity, Permutation entropy",

author = "Wei Xu and Bingbing Song and Chunlei Fan and Qun Ding and Shu-Chuan Chu",

year = "2014",

doi = "10.1007/978-3-319-07773-4_31",

language = "English",

pages = "311--320",

note = "The First Euro-China Conference on Intelligent Data Analysis and Applications ; Conference date: 13-06-2014 Through 15-06-2014",

}

TY - CONF

T1 - The Complexity Analysis of Chaotic Systems

AU - Xu, Wei

AU - Song, Bingbing

AU - Fan, Chunlei

AU - Ding, Qun

AU - Chu, Shu-Chuan

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Approximate entropy

KW - Chaos

KW - Complexity

KW - Permutation entropy

UR - http://www.scopus.com/inward/record.url?scp=84928953999&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-07773-4_31

DO - 10.1007/978-3-319-07773-4_31

M3 - Paper

SP - 311

EP - 320

T2 - The First Euro-China Conference on Intelligent Data Analysis and Applications

Y2 - 13 June 2014 through 15 June 2014

ER -

The Complexity Analysis of Chaotic Systems

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this