一类基于混沌映射构造Hash函数方法的碰撞缺陷

混沌动力学系统在一定的参数范围内出现混沌运动，且它所产生的混沌序列具有良好的伪随机特性.以混沌映射为基础，已有文献提出了一些构造单向散列函数的方法.对这些方法进行分析，证明它们均存在碰撞缺陷，并总结了采用混沌映射构造单向散列函数时应注意的问题. 关键词： 混沌 单向散列函数 碰撞     

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

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

一种基于强跟踪滤波的混沌保密通信方法

提出了一种基于强跟踪滤波器的混沌保密通信方法. 在发送端, 混沌映射和信息符号被建模成非线性状态空间模型, 信息符号被加性混沌掩盖或乘性混沌掩盖调制, 然后通过信道输出. 在接收端, 驱动信号被接收, 使用带有贝叶斯分类器(信息符号估计)的强跟踪滤波器算法动态地恢复信息符号. Logistic混沌映射的仿真表明, 当信息符号为二进制编码时, 不管是加性混沌掩盖调制还是乘性混沌掩盖调制, 强跟踪滤波器均能较好地从混沌信号中恢复信息符号. 与扩展卡尔曼滤波器相比, 由于卡尔曼滤波器对于离散的信息符号跟踪能力差, 混沌映射中信息符号难以恢复, 比特误码率高. 因此, 这种基于强跟踪滤波器的混沌保密通信方法是有效的.     

一种基于混沌和汉明码的数字图像篡改检测及修复算法

提出了一种基于混沌映射和汉明码的数字图像篡改检测及修复算法.该算法采用了目前在信道编码中广泛使用的编组码汉明码,将差错控制应用于图像认证和修复,并使用混沌映射保证算法的有效性和安全性.分析及实验表明:该算法在保证良好的视觉效果,嵌入较少认证信息的前提下,可以有效地进行数字图像篡改检测,并能够完成一定程度的图像修复.     

一种基于保守混沌的密钥分发协议及图像加密算法

耗散混沌系统可以通过时滞嵌入法重构混沌吸引子,因而耗散混沌在基于混沌的信息加密技术中存在一定隐患.针对这一问题提出一种基于保守混沌的密钥分发协议及图像加密算法,该算法将图像数据通过Hash算法转换为保守混沌系统的初始值,形成一次一密的加密结构.然后利用保守混沌信号结合密钥分发协议生成二进制密钥流,该过程由发送方和接受方...     

一种基于超混沌系统的立体图像零水印算法

为了在不改变立体图像质量的前提下对立体图像实施版权保护,提出了一种基于超混沌离散系统的立体图像零水印算法. 该算法利用立体图像左右视点小波变换域低频子带视差的稳定性以及离散余弦变换直流系数稳定的特点构造了一种视差零水印. 在水印构造过程中,利用了超混沌离散系统的初始值敏感性、参数密钥空间大和动力学行为复杂等特性映射视差零水印的 位置信息,从而增强了水印算法的安全性.此外,还分析了水印安全性与水印容量之间的关系. 实验结果表明,该立体图像视差零水印算法对加噪、滤波、压缩、剪切、图像放大和缩小等各种对称和非对称攻击表现出了 较强的鲁棒性.     

基于图切割的相位展开

剪切散斑干涉术中,普遍采取相移法提取相位,只可得到被包裹的相位信息,进一步量化计算之前,必须展开相位,但是大量的散斑噪音使相位展开变得非常困难.本文提出基于图切割理论的相位展开算法,将相位展开等价于整数的最优估计问题,通过最小化能量函数展开相位,无需对散斑包裹相位图进行滤波,就可以从包含大量散斑噪音的包裹相位图中准确地提取出真实相位,极大程度地保留了相位包裹图中的细节信息.对于同一幅模拟的散斑包裹相位图,传统的质量导向枝切法和最小二乘法的均方根误差分别为11.7076和4.9775,新算法的均方根误差则为0.9459,数值模拟与实验结果均验证了新算法优良的抗噪性能.     

基于图切割的相位展开

剪切散斑干涉术中,普遍采取相移法提取相位,只可得到被包裹的相位信息,进一步量化计算之前,必须展开相位,但是大量的散斑噪音使相位展开变得非常困难.本文提出基于图切割理论的相位展开算法,将相位展开等价于整数的最优估计问题,通过最小化能量函数展开相位,无需对散斑包裹相位图进行滤波,就可以从包含大量散斑噪音的包裹相位图中准确地提取出真实相位,极大程度地保留了相位包裹图中的细节信息.对于同一幅模拟的散斑包裹相位图,传统的质量导向枝切法和最小二乘法的均方根误差分别为11.707 6和4.977 5,新算法的均方根误差则为0.945 9,数值模拟与实验结果均验证了新算法优良的抗噪性能.     

基于广义混沌映射切换的单向Hash函数构造

如何设计快速高效的单向Hash函数一直是现代密码学研究中的一个热点.提出了一种基于广 义混沌映射切换的Hash函数构造方法.这种方法首先构建产生多种混沌序列的广义混沌映射 模型,然后在明文信息的不同位置根据切换策略产生不同的混沌序列,并用线性变换后的信号 信息对混沌参数进行调制来构造单向Hash函数.初步分析了利用混沌映射实现单向Hash函数 的不可逆性、防伪造性、初值敏感性等特点.研究结果表明:这种基于广义混沌映射切换的Ha sh函数具有很好的单向性、弱碰撞性，较基于单一混沌映射的Hash函数具有更强的保密性能 ，且实现简单. 关键词： Hash函数 混沌 混沌映射切换     

一种混沌映射的相空间去噪方法

对于混沌映射来说,它们的频谱比混沌流的频谱更广阔,与噪声频谱的重叠率更高,所以混沌流的去噪方法对它们并不适用. 在半盲分析法的框架下,混沌系统的参数估计问题终将归结为最小二乘估计问题. 本文从最小二乘拟合的角度出发估计混沌映射的演化参数,进而通过相空间重构以及投影操作,实现对观测信号的噪声抑制. 实验结果表明,该算法的去噪效果优于扩展卡尔曼滤波器（extended Kalman filter,EKF）和无先导卡尔曼滤波器（unscneted Kalman filter,UKF）,并且能够较大程度地将信号源的混沌特征量还原. 关键词： 混沌 噪声抑制 相空间重构 投影     

One-way hash function based on hyper-chaotic cellular neural network

The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.     

One-way hash function construction based on the spatiotemporal chaotic system

Based on the spatiotemporal chaotic system,a novel algorithm for constructing a one-way hash function is proposed and analysed.The message is divided into fixed length blocks.Each message block is processed by the hash compression function in parallel.The hash compression is constructed based on the spatiotemporal chaos.In each message block,the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function.The final hash value is generated by further compressing the mixed result of all the hash compression values.Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key,good statistical properties,and strong collision resistance.     

Security analysis of a one-way hash function based on spatiotemporal chaos

The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.     

Conservative spatial chaos of buckled elastic linkages

Buckling of an elastic linkage under general loading is investigated. We show that buckling is related to an initial value problem, which is always a conservative, area-preserving mapping, even if the original static problem is nonconservative. In some special cases, we construct the global bifurcation diagrams, and argue that their complicated structure is a consequence of spatial chaos. We characterize spatial chaos by the associated initial value problem's topological entropy, which turns out to be related to the number of buckled configurations.     

Synchronously scrambled diffuse image encryption method based on a new cosine chaotic map

We present a new cosine chaotic mapping proved by chaos theory test and analysis such that the system has good cryptography properties, wide chaos range, simple structure, and good sensitivity to initial value, and the mapping can meet the needs of chaotic image encryption. Based on the cosine chaotic system, we propose a new encryption method. First, according to the cyclic characteristics of the mapping, the cyclic information wave is simulated. Second, the quasi-Doppler effect is used to synchronously scramble and diffuse the image to obfuscate the original pixel. Finally, the XOR diffusion of image pixels is carried out by information wave to further enhance the encryption effect. Simulation experiment and security analysis show that the algorithm has good security, can resist the common attack mode, and has good efficiency.     

Hash function construction using weighted complex dynamical networks

A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency.     

Collision analysis of one kind of chaos-based hash function

In the last decade, various chaos-based hash functions have been proposed. Nevertheless, the corresponding analyses of them lag far behind. In this Letter, we firstly take a chaos-based hash function proposed very recently in Amin, Faragallah and Abd El-Latif (2009) [11] as a sample to analyze its computational collision problem, and then generalize the construction method of one kind of chaos-based hash function and summarize some attentions to avoid the collision problem. It is beneficial to the hash function design based on chaos in the future.     

基于双混沌系统的大数据环境并行加密算法设计 

为了克服大数据在采用串行加密方式时具有的加密效率低的问题,设计了一种基于双混沌系统的大数据环境的并行加密算法。首先,在对经典的Map-Reduce分布式并行计算框架进行研究的基础上,设计了大数据环境的并行加密模型。然后,设计了改进的Logistic映射和Tent映射构成双混沌系统,在此基础上,设计了Map函数、Sort函数和Reduce函数实现并行加密,在Map函数中通过Logistic映射和Tent映射的不断迭代计算加密密钥或解密密钥,实现明文到密文或密文到明文的转换,在Sort 函数对由Map函数输出的键值对进行排序并剔除重复的数据块,在Reduce函数中对加密后的密文数据块或解密后的明文数据块进一步合并构成输出数据,并生成Logistic映射和Tent映射的迭代次数初始值并保存在历史数据信息中。仿真实验表明：文中设计的基于双混沌系统的Map-Reduce并行加密模型能高效地进行数据加密或解密,能提高数据安全性和加密效率,具有较强的可行性。