混沌伪随机序列的谱熵复杂性分析

为了准确分析混沌伪随机序列的结构复杂性,采用谱熵算法对Logistic映射、Gaussian映射和TD-ERCS系统产生的混沌伪随机序列复杂度进行了分析.谱熵算法具有参数少、对序列长度N(惟一参数)和伪随机进制数K鲁棒性好的特点.采用窗口滑动法分析了混沌伪随机序列的复杂度演变特性,计算了离散混沌系统不同初值和不同系统参数条件下的复杂度.研究表明,谱熵算法能有效地分析混沌伪随机序列的结构复杂度;在这三个混沌系统中,TD-ERCS系统为广域高复杂度混沌系统,复杂度性能最好;不同窗口和不同初值条件下的混沌系统复杂度在较小范围内波动.为混沌序列在信息安全中的应用提供了理论和实验依据.     

变参级联混沌系统中的潜在风险

Lyapunov指数是系统是否进入混沌态的判据之一,其大小描述了系统混沌态的发达程度.为了研究级联混沌系统Lyapunov指数的特性,揭示级联混沌系统中子系统之间的扰动机理,首先从伪噪声扰动的角度,建立了子系统间的扰动模型,研究了有、无外噪声影响的Lyapunov指数差异,指出子系统之间的扰动可视为伪噪声对其的影响;然后,在理论上证明了级联系统的Lyapunov指数等于有前级扰动时的各个子系统的Lyapunov指数的代数和,而不等于各个(独立)子系统的Lyapunov指数的代数和.并以Logistic映射为例,设计了9种级联验证方案.研究中发现了一些新的特性和现象:级联系统Lyapunov指数存在着随级次增加反而减小的"过犹不及"和"失之毫厘,差之千里"的现象;即使各个(独立)子系统均是混沌的,其级联后的系统也有不是混沌的情况;反之,即使各个(独立)子系统均不是混沌的,其级联后的系统也有混沌的情况;而且,级联后的系统是否是混沌的,与其构成级联系统的子系统的序有关.最后,指出了级联级次对级联系统存在着利、弊两种影响,由此揭示了变参级联混沌系统存在的潜在风险.研究结果为系统安全性、密钥(混乱度)质量的科学评价提供了重要的理论依据.     

改进型Hénon映射生成混沌伪随机序列及性能分析

提出一种改进传统Hénon映射的方法.该方法通过引入绝对值项改变映射系统的内部结构,大大提高了映射系统的线性复杂度和初值敏感性.利用混沌系统生成伪随机序列,进一步对比分析了映射系统生成的伪随机序列的性能.理论分析和实验仿真表明,改进后的映射系统比原系统生成的序列质量有很大提高,验证了该方法的有效性. 关键词： Hénon映射 伪随机序列 性能分析     

基于切延迟的椭圆反射腔离散混沌系统及其性能研究

根据椭圆反射腔物理模型， 提出了一种改变系统演化轨道的切延迟操作方法，导出了基于该方法的一类离散混沌映射系 统.实验表明，这类离散混沌系统最大Lyapunov指数恒大于零,状态变量等概率分布且与参 数和初值无关,全域零相关性，切延迟1单位时存在一个稳定不变的方形吸引子，切延迟大于 1单位时走向各态遍历.这类离散混沌系统可以产生两个独立的伪随机序列，其特殊性质和 复杂的动力学行为极具密码学应用价值. 关键词： 混沌 切延迟 Lyapunov指数 TD-ERCS 吸引子     

一种新的分段非线性混沌映射及其性能分析

研究了logistic混沌映射的相关性质,指出当系统参数取值改变时,产生的混沌序列在相空间不具有遍历性.基于以上分析,构造了一种分段logistic混沌映射,对logistic映射和定义的分段logistic映射的分岔图和Lyapunov指数进行了研究,同时通过实验对这二种映射生成序列的随机性、相关系数、功率谱等性能进行了比较分析.在此基础上,定义了一种新的混沌系统性能评价指标——分岔迭代次数.结果表明,定义的分段logistic映射不仅具有良好的遍历性,而且对应的混沌系统相关评价指标的性能良好. 关键词： 混沌系统 相关系数 Lyapunov指数 功率谱     

混沌伪随机序列复杂度分析的符号动力学方法

通过将混沌伪随机序列看成一个符号序列，提出了用符号动力学的 方法来分析混沌伪随机序列的复杂度.以Logistic映射和耦合映射格子系统产生的混沌伪随 机序列为例，说明了该方法的应用，并将计算结果与近似熵ApEn法的计算结果作了比较.结 果表明，该方法可以有效地判断出不同的混沌伪随机序列的复杂程度，而且比近似熵法更为 优越. 关键词： 混沌 伪随机序列 符号动力学 熵     

混沌的乘法规律

从理论上分析了几个混沌映射相乘的规律，提出了混沌相乘的思想.数值仿真与理论计算结果表明，几个混沌映射相乘仍然具有非线性动力学特性和分岔序列.并且具有混沌吸引子和对初值敏感性.混沌的乘法概念具有重要的理论意义和应用价值. 关键词： 相乘混沌 吸引子 分岔序列     

一个新混沌系统及其电路仿真

提出了一个新的三维自治混沌系统,并对系统的基本动力学特性进行了深入研究, 得到系统的Lyapunov指数和维数,给出了系统数值仿真图、Poincaré 映射图、Lyapunov指数谱和分岔图, 重点分析了不同参数变化对系统动力学行为的影响.最后,设计了该混沌系统的硬件电路并运用Multisim软件 对该电路进行仿真实现,数值仿真和电路仿真证实了该混沌系统与以往发现的混沌系统并不拓朴等价, 是一个新的混沌系统.     

一个具有完全四翼形式的四维混沌

本文通过引进一个非线性状态反馈控制器, 提出了一个新的四维混沌系统, 该混沌吸引子能在任何方向上都表现出四翼形式. 由于存在一个大的正李雅普诺夫指数, 混沌系统具有一些非常有趣和复杂的动力学行为. 对系统的一些基本动力学特性进行了数值模拟和理论分析, 如平衡点、耗散性、Poincaré映射、频谱、时域谱和混沌行为等. 通过对Lyapunov指数谱和分岔图的分析, 进一步研究了混沌行为的系统参数敏感性. 最后, 设计了一个实现四翼混沌系统的振荡电路, EWB观察结果与数值模拟结果具有良好的一致性.     

一种新的三维自治混沌系统

通过对蔡氏电路的研究,提出了一种新的混沌系统,并对该系统的基本动力学特性进行了深入研究,得到该系统的Lyapunov指数和Lyapunov维数,给出了相图、Lyapunov指数谱、分岔图、Poincaré映射以及功率谱等.利用OrCAD-PSpice软件设计了该新混沌系统的振荡电路并进行了仿真实验.研究结果表明,该系统与蔡氏电路产生的混沌吸引子并不拓扑等价,且该系统的参数变化范围较大,最大Lyapunov指数接近1,数值仿真和电路系统实验仿真具有很好的一致性,证实了该系统的存在性和物理上可实现性. 关键词： 混沌系统 Lyapunov指数谱 分岔图 电路实现     

一种新的混沌映射散列函数构造方法及应用

提出了一种基于混沌映射和乘同余法构建单向散列函数的算法. 该算法通过乘同余法生成伪随机序列作为系统的初始值, 把明文信息的美国标准信息交换码(ASCII码) 归一化后作为混沌映射的初始值, 经过可变步长的混沌数字量化后, 提取出128 bit的散列值. 理论分析和仿真结果表明: 该算法具有较好的不可逆性、 抗碰撞性、 防伪造性、 初值敏感性以及较高地运行速度.     

A Three-Dimensional Infinite Collapse Map with Image Encryption

Chaos is considered as a natural candidate for encryption systems owing to its sensitivity to initial values and unpredictability of its orbit. However, some encryption schemes based on low-dimensional chaotic systems exhibit various security defects due to their relatively simple dynamic characteristics. In order to enhance the dynamic behaviors of chaotic maps, a novel 3D infinite collapse map (3D-ICM) is proposed, and the performance of the chaotic system is analyzed from three aspects: a phase diagram, the Lyapunov exponent, and Sample Entropy. The results show that the chaotic system has complex chaotic behavior and high complexity. Furthermore, an image encryption scheme based on 3D-ICM is presented, whose security analysis indicates that the proposed image encryption scheme can resist violent attacks, correlation analysis, and differential attacks, so it has a higher security level.     

Cascade discrete memristive maps for enhancing chaos

Continuous-time memristor (CM) has been widely used to generate chaotic oscillations. However, discrete memristor (DM) has not been received adequate attention. Motivated by the cascade structure in electronic circuits, this paper introduces a method to cascade discrete memristive maps for generating chaos and hyperchaos. For a discrete-memristor seed map, it can be self-cascaded many times to get more parameters and complex structures, but with larger chaotic areas and Lyapunov exponents. Comparisons of dynamic characteristics between the seed map and cascading maps are explored. Meanwhile, numerical simulation results are verified by the hardware implementation.     

A novel algorithm to analyze the dynamics of digital chaotic maps in finite-precision domain

Chaotic maps are widely used to design pseudo-random sequence generators, chaotic ciphers, and secure communication systems. Nevertheless, the dynamic characteristics of digital chaos in finite-precision domain must be degraded in varying degrees due to the limited calculation accuracy of hardware equipment. To assess the dynamic properties of digital chaos, we design a periodic cycle location algorithm (PCLA) from a new perspective to analyze the dynamic degradation of digital chaos. The PCLA can divide the state-mapping graph of digital chaos into several connected subgraphs for the purpose of locating all fixed points and periodic limit cycles contained in a digital chaotic map. To test the versatility and availability of our proposed algorithm, the periodic distribution and security of 1-D logistic maps and 2-D Baker maps are analyzed in detail. Moreover, this algorithm is helpful to the design of anti-degradation algorithms for digital chaotic dynamics. These related studies can promote the application of chaos in engineering practice.     

Characterization of the spatial complex behavior and transition to chaos in flow systems

We introduce a “spatial” Lyapunov exponent to characterize the complex behavior of non-chaotic but convectively unstable flow sytems. This complexity is of spatial type and is due to sensitivity to the boundary conditions. We show that there exists a relation between the spatial-complexity index we define and the comoving Lyapunov exponents. In such systems the transition to chaos, i.e., the occurrence of a positive Lyapunov exponent, can manifest itself in two different ways. In the first case (from neither chaotic nor spatially complex behavior to chaos) one observes the typical scenario; i.e., as the system size grows up the spectrum of the Lyapunov exponents gives rise to a density. In the second case (when the chaos develops from a convectively unstable situation) one observes only a finite number of positive Lyapunov exponents.     

Image Encryption Scheme with Compressed Sensing Based on a New Six-Dimensional Non-Degenerate Discrete Hyperchaotic System and Plaintext-Related Scrambling

Digital images can be large in size and contain sensitive information that needs protection. Compression using compressed sensing performs well, but the measurement matrix directly affects the signal compression and reconstruction performance. The good cryptographic characteristics of chaotic systems mean that using one to construct the measurement matrix has obvious advantages. However, existing low-dimensional chaotic systems have low complexity and generate sequences with poor randomness. Hence, a new six-dimensional non-degenerate discrete hyperchaotic system with six positive Lyapunov exponents is proposed in this paper. Using this chaotic system to design the measurement matrix can improve the performance of image compression and reconstruction. Because image encryption using compressed sensing cannot resist known- and chosen-plaintext attacks, the chaotic system proposed in this paper is introduced into the compressed sensing encryption framework. A scrambling algorithm and two-way diffusion algorithm for the plaintext are used to encrypt the measured value matrix. The security of the encryption system is further improved by generating the SHA-256 value of the original image to calculate the initial conditions of the chaotic map. A simulation and performance analysis shows that the proposed image compression-encryption scheme has high compression and reconstruction performance and the ability to resist known- and chosen-plaintext attacks.     

A novel hyperchaotic map with sine chaotification and discrete memristor

Discrete memristor has become a hotspot since it was proposed recently. However, the design of chaotic maps based on discrete memristor is in its early research stage. In this paper, a memristive seed chaotic map is proposed by combining a quadratic discrete memristor with the sine function. Furthermore, by applying the chaotification method, we obtain a high-dimensional chaotic map. Numerical analysis shows that it can generate hyperchaos. With the increase of cascade times, the generated map has more positive Lyapunov exponents and larger hyperchaotic range. The National Institute of Standards and Technology (NIST) test results show that the chaotic pseudo-random sequence generated by cascading two seed maps has good unpredictability, and it indicates the potential in practical application.     

将混沌序列变换成均匀伪随机序列的普适算法

提出了一种将混沌序列变换成均匀伪随机序列的普适算法.这种算法基于计算机浮点数表示的bit位操作,不针对任何具体对象,可将任意连续或分段连续分布的实型随机变量转换成均匀分布的随机变量.理论分析表明,这种算法源于实型随机变量中普遍存在着的沿bit位以指数规律增强的均匀化趋势.任何实型的混沌序列,不论来自混沌映射系统还是混沌微分动力系统,都可以在同一个标准算法下变换成均匀分布的伪随机序列,因而是混沌伪随机数发生器标准化模块设计和硬件实现的关键技术基础. 关键词： 混沌 伪随机序列 均匀分布函数