Application Oriented Complexity Analysis of Digital Chaotic Sequence

To generate digital chaotic sequence and apply that in hardware encryption system, this paper presents the permutationentropyasacriterionofmeasuringthecomplexity 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.

[1]  Baoming Bai,et al.  A New Complexity Metric of Chaotic Pseudorandom Sequences Based on Fuzzy Entropy: A New Complexity Metric of Chaotic Pseudorandom Sequences Based on Fuzzy Entropy , 2011 .

[2]  S M Pincus,et al.  Approximate entropy as a measure of system complexity. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Osvaldo A. Rosso,et al.  Intensive statistical complexity measure of pseudorandom number generators , 2005 .

[4]  Zhao Geng.  MODERN INFORMATION SAFETY AND ADVANCES IN APPLICATION RESEARCH OF CHAOS-BASED SECURITY COMMUNICATION , 2003 .

[5]  U. Parlitz,et al.  Robust communication based on chaotic spreading sequences , 1994 .

[6]  Qiang Liu,et al.  FPGA Design and Applicable Analysis of Discrete Chaotic Maps , 2014, Int. J. Bifurc. Chaos.

[7]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[8]  Zhang Xiaogang,et al.  Detection Complexity of Chaotic Sequence , 2013 .

[9]  Q. Ding,et al.  Research on the quantifications of chaotic random number generators , 2013 .

[10]  Q. Ding,et al.  DESIGNING OF CHAOTIC SYSTEM OUTPUT SEQUENCE CIRCUIT BASED ON FPGA AND ITS APPLICATIONS IN NETWORK ENCRYPTION CARD , 2007 .

[11]  B. Pompe,et al.  Permutation entropy: a natural complexity measure for time series. , 2002, Physical review letters.

[12]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[13]  Yan Gui-rong,et al.  A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences , 2005 .