离散混沌系统的复杂性算法研究-物理电子学专业论文.docxVIP

中南大学硕士学位论文 中南大学硕士学位论文 Abstract ABSTRACT The application of chaos in field of information security has become a hot topic．The complexity analysis of chaotic systems is a very important aspect of system security performance．There is a close relationship between the complexity and the system’S cryptogram performance．The complexity of time series generated by discret chaotic system is analyzed and studied by using different methods，especially,the new TD—ERCS discret chaotic system is discussed in the paper,and its complexity is compared with the other common discret chaotic systems．First，the space structure complexity of each chaotic system is observed by phase space observation method，the magnitude of the complexity is approximately gained，Then，the complexity is measured through the methods of behavior complexity and structure complexity．In the method of behavior complexity,based on Kolmogorov complexity,classic Limpel—Ziv algorithm，ApEn algorithm and PE algorithm are used respectively in single dimension and multiplied dimensions approach．The complexity value of some systems is calculated，including Logistic system，Tent system，Henon system，Sected linear reflection system and TD—ERCS system．ne results show that the behavior complexity of TD—ERCS system is greater than other chaotic systems，and the complexity value changes a little as the change of its parameters．In the aspect of structure complexity,the Fourier Transform and Wavelet Transform are used to get the Spectral Entropy and Wavelet Entropy,which are used to describe the complexity of the discret chaotic systems．ne results indicate that the frequency spectral complexity of TD—ERCS system is about the same with other discret chaotic system，and the structure complexity is also very great．In a conclusion，the hehaviour complexity of TD—ERCS system iS better than that of other chaotic systems．and