Xu Wei
School of Computer Science and Technology, Heilongjiang University, Harbin, 150080, China
Ding Qun
School of Electronic Engineering, Heilongjiang University, Harbin, 150080, China
Zhang Xiaogang
Education Office of Heilongjiang Province, Harbin, 150001, China
ABSTRACT
To generate digital chaotic sequence and apply that in hardware encryption system, this paper analyzes Chaoscomplexity quantitative analysis methods and presents the approximate entropy as criterion of measuring the complexity of the chaotic sequences. Set tent and logistic two kinds of chaotic systems as examples, analysis and comparison their complexity.It is proved that the method can distinguish different complex chaos and chaotic sequences on the basis of short observed sequence for judging the criterion mentioned above. Researches show that the complexity of the Logistic map is better than Tents. The results of the study provide the theoretical and experimental basis for the application of chaotic sequence in the information security communication.
PDF References Citation
How to cite this article
Xu Wei, Ding Qun and Zhang Xiaogang, 2013. Detection Complexity of Chaotic Sequence. Information Technology Journal, 12: 5487-5491.
DOI: 10.3923/itj.2013.5487.5491
URL: https://scialert.net/abstract/?doi=itj.2013.5487.5491
DOI: 10.3923/itj.2013.5487.5491
URL: https://scialert.net/abstract/?doi=itj.2013.5487.5491
REFERENCES
- Bandt, C. and B. Pompe, 2002. Permutation entropy: A natural complexity measure for time series. Phys. Rev. Lett., Vol. 88.
CrossRef - Kolmogorov, A.N., 1965. Three approaches to the quantitative definition ofinformation. Problems Inform. Transmission, 1: 1-7.
Direct Link - Larrondo, H.A., C.M. Gonzalez, M.T. Martin, A. Plastino and O.A. Rosso, 2005. Intensive statistical complexity measure of pseudorandom number generators. Physica A: Stat.l Mech. Appli., 356: 133-138.
CrossRef - Lempel, A. and J. Ziv, 1976. On the complexity of finite sequences. IEEE Trans. Inform. Theory, 22: 75-81.
CrossRef - Parlitz, U. and S. Ergezinger, 1994. Robust communication based on chaotic spreading sequences. Phy. Lett. A., 188: 146-150.
CrossRefDirect Link - Pincus, S.M., 1991. Approximate entropy as a measure of system complexity. Proc. Natl. Acad. Sci., 88: 2297-2301.
CrossRefDirect Link