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

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

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

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

一类具有Markov性质的混沌系统的构造

本文构造了一类具有Markov性质的分段扩张线性映射, 计算表明其具有正的李雅普诺夫指数. 通过理论分析, 证明了其极限分布是均匀分布, 并给出了其最小周期的计算公式. 通过分析符号熵测度应用于此系统时的具体涵义, 指出该系统的复杂度与系统的最小周期之间存在着矛盾关系, 说明了此系统具有可控的复杂度并给出了其复杂度随系统参数变化时的理论极限公式. 通过统计测试和复杂度测试表明, 此系统产生的混沌序列服从均匀分布, 而通过参数的调整该系统的符号熵可以接近其理论极限, 而与Logistic映射和斜帐篷映射的基于近似熵和符号熵的对比实验可知, 本文所提系统具有更高的复杂度, 并有更长的最小周期. 这表明此系统比较适合用于构造保密通信系统. 关键词： 混沌 Markov性质 复杂度 均匀分布     

基于FPGA技术的混沌加密系统研究

提出了一种基于混沌加密算法和传统加密算法的混沌加密系统, 并采用FPGA技术进行了硬件开发. 根据离散化和数字化技术, 将Henon映射和Logistic映射作离散化处理, 采用Verilog HDL语言和FPGA技术产生迭代序列, 结合传统加密算法, 基于Xilinx的FPGA开发平台进行了硬件实验研究, 并给出了该系统通过互联网上实现了文件加密和解密的通信实验, 结果显示具有网络通信的应用潜力.     

一种混沌伪随机序列复杂度分析法

分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准.理论研究表明，利用较短的观察序列，该方法能够准确地反映混沌系统和混沌伪随机序列复杂度的大小，可以作为判断利用混沌系统产生的伪随机序列的复杂度准则.实验结果表明该方法的有效性和理论结果的正确性. 关键词： 混沌 伪随机序列 熵     

一个三维四翼自治混沌系统的拓扑马蹄分析

基于拓扑马蹄映射理论,验证了一个三维四翼自治的混沌系统的拓扑马蹄的存在.由于该混沌系统是连续系统,首先选取了一个Poincaré截面,并在该截面下定义了该混沌系统的一个一次回归Poincaré映射.通过利用计算机辅助证明方法,得出了该映射与一个2移位映射拓扑半共扼,说明该三维四翼自治系统的拓扑熵大于或等于ln2,进而证明了该系统的混沌行为. 关键词： 四翼混沌系统 拓扑马蹄 Poincaré映射 拓扑熵     

模糊熵算法在混沌序列复杂度分析中的应用

为了准确分析混沌序列的复杂性, 采用模糊熵算法(FuzzyEn) 对典型离散混沌系统和连续混沌系统的复杂度进行分析. 与近似熵(ApEn)、 样本熵(SampEn) 和强度统计复杂度算法相比, FuzzyEn算法是一种更有效的混沌复杂度测度算法, 且对相空间维数(m)、 相似容限度(r) 和序列长度(N) 的敏感性、 依赖性更低, 鲁棒性和测度值的连续性更好. 对混沌系统的复杂性分析表明, 连续混沌系统的复杂度远小于离散混沌系统, 但是如果利用高复杂度的离散混沌伪随机序列或经典 m序列对连续混沌系统产生的伪随机序列进行扰动, 则能大大提高混沌序列的复杂性. 为混沌序列在密码学和混沌保密通信中的应用提供了理论依据.     

一种基于混沌的带密钥Hash函数的碰撞问题及分析

指出了一类基于混沌映射构造带密钥单向hash函数算法的碰撞问题,并对其产生的机理进行了初步分析,给出了数字化混沌序列非奇异的定义,证明了数字化混沌序列非奇异的充要条件,并分析了变参数离散混沌动力系统数字化后序列的周期性.分析结果表明这类算法产生碰撞的原因是其对混沌映射的数字化导致混沌序列的奇异性,因此必须谨慎选择混沌映射的数字化方法以保证混沌序列的非奇异性. 关键词： 混沌 带密钥散列函数 碰撞 非奇异性     

一种混沌扩频序列的产生方法及其优选算法

提出一种基于组合映射模型产生混沌扩频序列的方法. 根据扩频序列的特性要求和多址干扰性能指标,给出了一种混沌扩频序列的优选算法;将得到的优选序列应用于直扩码分多址系统,在不同信道条件下进行仿真,并与优选的Logistic混沌扩频序列进行性能比较,结果表明本方法产生的混沌扩频序列具有和Logistic混沌扩频序列相近的良好性能,而且保密性更好. 关键词： 码分多址 优选算法 多径信道 误码率     

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

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

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.     

Complexity analyses of multi-wing chaotic systems

The complexities of multi-wing chaotic systems based on the modified Chen system and a multi-segment quadratic function are investigated by employing the statistical complexity measure (SCM) and the spectral entropy (SE) algorithm. How to choose the parameters of the SCM and SE algorithms is discussed. The results show that the complexity of the multi-wing chaotic system does not increase as the number of wings increases, and it is consistent with the results of the Grassberger-Procaccia (GP) algorithm and the largest Lyapunov exponent (LLE) of the multi-wing chaotic system.     

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

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

Synchronization of spatiotemporal chaotic systems and application to secure communication of digital image

Coupled map lattices (CMLs) are taken as examples to study the synchronization of spatiotemporal chaotic systems.In this paper,we use the nonlinear coupled method to implement the synchronization of two coupled map lattices.Through the appropriate separation of the linear term from the nonlinear term of the spatiotemporal chaotic system,we set the nonlinear term as the coupling function and then we can achieve the synchronization of two coupled map lattices.After that,we implement the secure communication of digital image using this synchronization method.Then,the discrete characteristics of the nonlinear coupling spatiotemporal chaos are applied to the discrete pixel of the digital image.After the synchronization of both the communication parties,the receiver can decrypt the original image.Numerical simulations show the effectiveness and the feasibility of the proposed program.     

A Maximum Entropy Method Based on Orthogonal Polynomials for Frobenius-Perron Operators

Let $S$: [0, 1]→[0, 1] be a chaotic map and let $f^∗$ be a stationary density of the Frobenius-Perron operator $P_S$: $L^1$→$L^1$ associated with $S$. We develop a numerical algorithm for approximating $f^∗$, using the maximum entropy approach to an under-determined moment problem and the Chebyshev polynomials for the stability consideration. Numerical experiments show considerable improvements to both the original maximum entropy method and the discrete maximum entropy method.     

Evaluation of channel coding and decoding algorithms using discrete chaotic maps

In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known encoding framework based upon the Bernoulli shift map and adapt it readily to carry the information bit sequence produced by a binary source in a practical way. On the decoder side, we introduce four already known decoding algorithms and compare the resulting performance of the corresponding transmitters. The performance in terms of the bit error rate shows that the most important design clue is related not only to the pdf of the data produced by the chosen discrete map: the own dynamics of the maps is also of the highest importance and has to be taken into account when designing the whole transmitting and receiving system. We also show that a good performance in such systems needs the extensive use of all the evidence stored in the whole chaotic sequence.     

Hybrid Control of Digital Baker Map with Application to Pseudo-Random Number Generator

Dynamical degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based cryptosystems. The existing solutions mainly focus on the compensation of dynamical properties rather than on the elimination of the inherent biases of chaotic systems. In this paper, a unidirectional hybrid control method is proposed to improve the dynamical properties and to eliminate the biases of digital chaotic maps. A continuous chaotic system is introduced to provide external feedback control of the given digital chaotic map. Three different control modes are investigated, and the influence of control parameter on the properties of the controlled system is discussed. The experimental results show that the proposed method can not only improve the dynamical degradation of the digital chaotic map but also make the controlled digital system produce outputs with desirable performances. Finally, a pseudorandom number generator (PRNG) is proposed. Statistical analysis shows that the PRNG has good randomness and almost ideal entropy values.