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

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

对均匀的数学描述及其与混沌的关系

基于独占球的概念定义的瞬时混沌度和k步混沌强度是混沌轨道的稳定特征,应用独占球的概念定义了均匀度,它对均匀性的描述与人对均匀的理解非常符合.被含均匀度是一个过渡概念,它与均匀度非常相似,但有更好的数学性质,对于随机轨道,被含均匀度统计收敛于1/V_n（1）（V_n（1）是n维欧氏空间的单位球体积）,而当轨道上的点充分多时,均匀度与被含均匀度近似相等.只要适当选择包含动力系统吸引盆的多 关键词： 独占球 均匀度 混沌 瞬时混沌强度     

非线性系统混沌运动的神经网络控制

设计前馈反传神经网络控制非线性系统混沌运动的新方法.根据扰动参数模型输入输出数据,按照非线性学习算法训练网络产生系统稳定所需的小扰动控制信号,去镇定混沌运动,使嵌入在混沌吸引子中的不稳定周期轨道回到稳定不动点上.Hnon映射数值仿真结果表明,这种方法控制非线性混沌系统响应速度快、控制精度高 关键词： 混沌控制 神经网络 吸引子 非线性     

动力学变换法探测连续系统不稳定周期轨道

本文利用动力学变换方法和庞加莱截面方法对两种连续混沌动力学系统进行不稳定周期轨道探测研究, 并对Lorenz系统进行了替代数据法检验.结果表明:基于庞加莱截面的动力学变换改进算法 可有效探测连续混沌动力学系统中的不稳定周期轨道.     

线宽增强因子对光反馈半导体激光器混沌信号生成随机数性能的影响

基于光反馈半导体激光器产生的宽带混沌信号作为物理熵源生成物理随机数已得到广泛研究.线宽增强因子的存在会导致半导体激光器出现大量不稳定动态特性,因此,本文着重研究半导体激光器的线宽增强因子对生成随机数性能的影响.数值仿真结果表明:随着线宽增强因子的增加,光反馈半导体激光器输出混沌信号的延时峰值逐渐减小、最大李雅普诺夫指数逐渐增大.基于不同线宽增强因子下产生的混沌信号提取随机数,并利用NIST SP 800-22软件对生成随机数的性能进行测试.测试结果表明,选取线宽增强因子较大的半导体激光器产生混沌信号作为物理熵源易于生成性能良好的随机数.     

基于多混沌系统的双图像光学加密算法

为了扩展双图像光学加密算法的密钥空间,克服双随机相位加密系统中随机相位掩模作为密钥难于存储、传输和重构的问题,突破传统图像加密的研究思路,提出了一种基于多混沌系统的双图像加密算法,构造了光学加密系统。系统增加混沌系统参数作为密钥,利用混沌加密密钥空间大和图像置乱隐藏性好的特点,构建基于Logistic混沌映射的图像置乱算法,利用Kent混沌映射生成的伪随机序列构造出一对随机相位掩模,分别放置在分数傅里叶变换光学装置的两端,图像经加密系统变换后得到密文。数值仿真结果表明,算法的密钥敏感性极高,能够有效地对抗统计攻击,具有较高的安全性。     

Multimodality Prediction of Chaotic Time Series with Sparse Hard-Cut EM Learning of the Gaussian Process Mixture Model

The contribution of this work is twofold:(1) a multimodality prediction method of chaotic time series with the Gaussian process mixture(GPM) model is proposed, which employs a divide and conquer strategy. It automatically divides the chaotic time series into multiple modalities with different extrinsic patterns and intrinsic characteristics, and thus can more precisely fit the chaotic time series.(2) An effective sparse hard-cut expectation maximization(SHC-EM) learning algorithm for the GPM model is proposed to improve the prediction performance. SHC-EM replaces a large learning sample set with fewer pseudo inputs, accelerating model learning based on these pseudo inputs. Experiments on Lorenz and Chua time series demonstrate that the proposed method yields not only accurate multimodality prediction, but also the prediction confidence interval. SHC-EM outperforms the traditional variational learning in terms of both prediction accuracy and speed. In addition,SHC-EM is more robust and insusceptible to noise than variational learning.     

基于参数切换算法的混沌系统吸引子近似及其电路设计

基于参数切换算法和离散混沌系统, 设计一种新的混沌系统参数切换算法, 给出了两算法的原理. 采用混沌吸引子相图观测法, 研究了不同算法下统一混沌系统和Rössler混沌系统参数切换结果, 最后引入方波发生器, 设计了Rössler混沌系统参数切换电路. 结果表明, 采用参数切换算法可以近似出指定参数下的系统, 其吸引子与该参数下吸引子一致; 基于离散系统的参数切换结果更为复杂, 当离散序列分布均匀时, 只可近似得到指定参数下的系统; 相比传统切换混沌电路, 参数切换电路不用修改原有系统电路结构, 设计更为简单, 输出结果受方波频率影响, 通过加入合适频率的方波发生器, 数值仿真与电路仿真结果一致.     

An improvement on measure methods of the complexity theory and its applications

A new method is proposed to transform the time series gained from a dynamic system to a symbolic series which extracts both overall and local information of the time series. Based on the transformation, two measures are defined to characterize the complexity of the symbolic series. The measures reflect the sensitive dependence of chaotic systems on initial conditions and the randomness of a time series, and thus can distinguish periodic or completely random series from chaotic time series even though the lengths of the time series are not long. Finally, the logistic map and the two-parameter Henón map are studied and the results are satisfactory.     

A Bit Shift Image Encryption Algorithm Based on Double Chaotic Systems

A chaotic system refers to a deterministic system with seemingly random irregular motion, and its behavior is uncertain, unrepeatable, and unpredictable. In recent years, researchers have proposed various image encryption schemes based on a single low-dimensional or high-dimensional chaotic system, but many algorithms have problems such as low security. Therefore, designing a good chaotic system and encryption scheme is very important for encryption algorithms. This paper constructs a new double chaotic system based on tent mapping and logistic mapping. In order to verify the practicability and feasibility of the new chaotic system, a displacement image encryption algorithm based on the new chaotic system was subsequently proposed. This paper proposes a displacement image encryption algorithm based on the new chaotic system. The algorithm uses an improved new nonlinear feedback function to generate two random sequences, one of which is used to generate the index sequence, the other is used to generate the encryption matrix, and the index sequence is used to control the generation of the encryption matrix required for encryption. Then, the encryption matrix and the scrambling matrix are XORed to obtain the first encryption image. Finally, a bit-shift encryption method is adopted to prevent the harm caused by key leakage and to improve the security of the algorithm. Numerical experiments show that the key space of the algorithm is not only large, but also the key sensitivity is relatively high, and it has good resistance to various attacks. The analysis shows that this algorithm has certain competitive advantages compared with other encryption algorithms.     

Classification of one-dimensional chaotic models

Classifying chaotic maps using the relation between a map and its conjugate basic map with uniform invariant distribution is suggested. It is shown that every symmetric one-dimensional chaotic map with two monotonic branches is topologically equivalent to a tent map or a Bernoulli shift. An algorithm for finding a function conjugating two maps is formulated.     

Asymptotic distribution of global errors in the numerical computations of dynamical systems

We propose an analysis of the effects introduced by finite-accuracy and round-off arithmetic on numerical computations of discrete dynamical systems. Our method, which uses the statistical tool of the decay of fidelity, computes the error by directly comparing the numerical orbit with the exact one (or, more precisely, with another numerical orbit computed with a much higher accuracy). Furthermore, as a model of the effects of round-off arithmetic on the map, we also consider a random perturbation of the exact orbit with an additive noise, for which exact results can be obtained for some prototype maps. We investigate the decay laws of fidelity and their relationship with the error probability distribution for regular and chaotic maps, for both additive and numerical noise. In particular, for regular maps we find an exponential decay for additive noise, and a power-law decay for numerical noise. For chaotic maps, numerical noise is equivalent to additive noise, and our method is suitable for identifying a threshold for the reliability of numerical results, i.e., the number of iterations below which global errors can be ignored. This threshold grows linearly with the number of bits used to represent real numbers.     

Order patterns and chaos

Chaotic maps can mimic random behavior in a quite impressive way. In particular, those possessing a generating partition can produce any symbolic sequence by properly choosing the initial state. We study in this Letter the ability of chaotic maps to generate order patterns and come to the conclusion that their performance in this respect falls short of expectations. This result reveals some basic limitation of a deterministic dynamic as compared to a random one. This being the case, we propose a non-statistical test based on ‘forbidden’ order patterns to discriminate chaotic from truly random time series with, in principle, arbitrarily high probability. Some relations with discrete chaos and chaotic cryptography are also discussed.     

一种基于混沌系统的新型图像加密算法

针对加密算法对明文敏感性较低的问题,提出了一种基于混沌系统的新型图像加密算法。采用SHA256函数对明文图像进行计算得到初值,将初值代入混沌系统生成伪随机序列,进一步使用该序列完成对明文图像的置乱。使用并行扩散机制对置乱图像进行第一轮扩散,在此基础上利用DNA动态编码技术进行第二轮扩散。对DNA矩阵解码得到二进制矩阵,进一步转化为十进制矩阵,得到加密图像。进行了计算机仿真分析和对比,通过对统计特性、差分特性、信息熵、密钥和鲁棒性的分析与测试,表明该算法安全性较好且易于实现,具有较大的应用前景。     

A new perturbation method to the Tent map and its application

Disturbance imposed on the chaotic systems is an effective way to maintain its chaotic good encryption features. This paper proposes a new perturbation method to the Tent map. First it divides the Tent map domain into 2^N parts evenly and selects a particular part from them, then proliferates the Tent map mapping trajectory of this particular part, which can disturb the entire system disturbance. The mathematical analysis and simulated experimental results prove that the disturbed Tent map has uniform invariant distribution and can produce good cryptographic properties of pseudo-random sequence. These facts avoid the phenomenon of short-period caused by the computer's finite precision and reducing the sequence's dependence on the disturbance signal, such that effectively compensate for the digital chaotic system dynamics degradation.     

Clustering of Periodic Orbits and Ensembles of Truncated Unitary Matrices

In present article we consider a combinatorial problem of counting and classification of periodic orbits in dynamical systems on an example of the baker’s map. Periodic orbits of a chaotic system can be organized into a set of clusters, where orbits from a given cluster traverse approximately the same points of the phase space but in a different time-order. We show that counting of cluster sizes in the baker’s map can be turned into a spectral problem for matrices from truncated unitary ensemble (TrUE). We formulate a conjecture of universality of the spectral edge in the eigenvalues distribution of TrUE and utilize it to derive asymptotics of the second moment of cluster distribution in the regime when both the orbit lengths and the parameter controlling closeness of the orbit actions tend to infinity. The result obtained allows to estimate the size of average cluster for various numbers of encounters in periodic orbit.     

Digital image watermarking using gyrator transform and chaotic maps

We propose a new method for digital image watermarking using gyrator transform and chaotic maps. Four chaotic maps have been used in the proposed technique. The four chaotic maps that have been used are the logistic map, the tent map, the Kaplan-Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. A new technique has been proposed to generate the single chaotic random phase mask by using two chaotic maps together with different seed values. The watermark encoding method in the proposed technique is based on the double random phase encoding method. The gyrator transform and two chaotic random phase masks are used to encode the input image. The mean square error, the peak signal-to-noise ratio and the bit error rate have been calculated. Robustness of the proposed technique has been evaluated in terms of the chaotic maps, the number of the chaotic maps used to generate the CRPM, the rotation angle of the gyrator transform and the seed values of the chaotic random phase masks. Optical implementation of the technique has been proposed. The computer simulations are presented to verify the validity of the proposed technique.     

An image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree

This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree. Firstly, other programming software is used to perform the middle order traversal, and the plaintext image is sorted according to the middle order traversal sequence on the permutation. Secondly, the chaotic sequence is generated using the coupled map lattice to set the chaotic interference value. Finally, the XOR operation between the adjacent pixel values of the replacement image is completed to generate the ciphertext matrix. The simulation and experimental results show that the proposed algorithm can resist typical attacks and has good robustness.     

离散分数阶随机变换与加权直方图交叉置乱的双图像加密算法

为了实现对两幅图像进行同步加密,降低传输负载并提高密文的抗明文攻击能力,提出了离散分数阶随机变换与加权像素混沌置乱的双图像加密算法。将2个分阶参数引入到Tent映射中,设计了新的Tent映射;根据明文像素值,构建加权像素直方图模型,联合位外部密钥,生成改进的Tent映射的初值;再利用初值对分数阶Tent映射进行迭代,输出2组随机序列,对2幅明文进行位置交叉混淆,获取2个置乱密文;基于DWT(discrete wavelet transform)技术,对2个置乱密文进行稀疏表示;根据混沌序列,定义随机循环矩阵,联合稀疏表示,获取2个置乱密文对应的测量矩阵。根据随机掩码与调制相位掩码,建立数据融合模型,将2个测量矩阵组合为复合矩阵;基于离散分数阶随机变换,对复合图像进行扩散,获取密文。测试数据显示:与已有的多图像加密方案相比,该算法的抗明文攻击能力与用户响应值更理想,密文的NPCR、UACI值分别达到了99.83%、34.57%。该算法具有较高的加密安全性,能够有效抵御网络中的外来攻击,确保图像安全传输。     

Analytical study of chaos and applications

We summarize various cases where chaotic orbits can be described analytically. First we consider the case of a magnetic bottle where we have non-resonant and resonant ordered and chaotic orbits. In the sequence we consider the hyperbolic Hénon map, where chaos appears mainly around the origin, which is an unstable periodic orbit. In this case the chaotic orbits around the origin are represented by analytic series (Moser series). We find the domain of convergence of these Moser series and of similar series around other unstable periodic orbits. The asymptotic manifolds from the various unstable periodic orbits intersect at homoclinic and heteroclinic orbits that are given analytically. Then we consider some Hamiltonian systems and we find their homoclinic orbits by using a new method of analytic prolongation. An application of astronomical interest is the domain of convergence of the analytical series that determine the spiral structure of barred-spiral galaxies.