Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (3): 47-49.

• 学术探讨 • Previous Articles     Next Articles

Analysis of chaotic pseudo-random sequence complexity based on permutation entropy

SUN Ke-hui,TAN Guo-qiang,SHENG Li-yuan   

  1. School of Physics Science and Technology,Central South University,Changsha 410083,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-21 Published:2008-01-21
  • Contact: SUN Ke-hui

基于排列熵算法的混沌伪随机序列复杂性分析

孙克辉,谈国强,盛利元   

  1. 中南大学 物理科学与技术学院,长沙 410083
  • 通讯作者: 孙克辉

Abstract: In this paper,permutation entropy algorithm is used to analyze the complexity of the chaotic series and chaotic pseudo-random series.The series complexity with different chaotic system parameters is discussed.The study results show that the series after being measured hold the traits of original series,and the complexity of TD-ERCS system is more great and stable than that of other discrete chaotic systems.So TD-ERCS is a new safe chaotic system which can be used for chaotic cryptology.

Key words: chaos, pseudo-random sequence, complexity, permutation entropy algorithm, TD-ERCS

摘要: 运用排列熵算法分析了离散混沌系统产生的混沌序列和混沌伪随机序列的复杂性,讨论了混沌系统参数对序列复杂性的影响情况。研究表明:多次粗粒化后得到的混沌伪随机序列保持了原有混沌序列的复杂性特点;与Logistic系统和Henon系统相比,TD-ERCS系统产生的混沌伪随机序列的复杂性大且相对稳定,是一个极具密码学应用价值的安全混沌系统。

关键词: 混沌, 伪随机序列, 复杂性, 排列熵算法, TD-ERCS