基于可变参数双向耦合映像系统的时空混沌Hash函数设计

在分析单向与双向耦合映像格子系统的初值与参数敏感性的基础上，提出了一种基于可变参数双向耦合映像系统的时空混沌单向Hash函数构造方案.该方案以耦合映像系统的部分初态作为密钥，在迭代过程中, 通过上一次的迭代值和线性变换后的不同位置的明文消息比特动态确定双向耦合映像系统模型参数，将明文消息多格点并行注入时空混沌轨迹中；取迭代序列中最后一轮迭代结果的适当空间项，线性映射为Hash值要求的128 bit值.由于耦合映像系统的双向扩散机理与混乱作用，迭代过程具有极强的不可逆性及初值与参数敏感性，Hash结果的每位都与明文及密钥有着敏感、复杂的非线性强耦合关系.仿真实验与分析结果表明，该算法达到了Hash函数的各项性能要求，安全性好，执行效率高. 关键词： Hash函数 时空混沌 耦合映像格子     

基于复合非线性数字滤波器的Hash函数构造

在对多个满足Kelber条件的滤波器组成的复合系统进行初步分析的基础上，提出了一个基于复合非线性数字滤波器的带密钥的Hash算法.算法首先构建能产生高维混沌序列的复合滤波器系统，然后在明文作用的复合序列控制下随机选择滤波器子系统，并以复合系统的初态作为密钥，以粗粒化的量化迭代轨迹作为明文的Hash值.讨论了复合系统实现Hash函数的不可逆性、防伪造性、初值敏感性等特点.研究结果表明：基于复合非线性数字滤波器的Hash算法简单快速，比基于单一混沌映射的Hash算法有着更高的安全性，同时滤波器结构中没有复杂的浮点运算，比一般复合混沌系统更易于软硬件实现. 关键词： Hash 函数 混沌 非线性自回归数字滤波器     

基于时空混沌系统的单向Hash函数构造

提出了一种基于时空混沌系统的Hash函数构造方法.以线性变换后的消息数作为一组初值来驱动单向耦合映像格子的时空混沌系统，产生时空混沌序列，取其空间最后一组混沌序列的适当项，线性映射为Hash值要求的128bit值.研究结果表明，这种基于时空混沌系统的Hash函数具有很好的单向性、弱碰撞性、初值敏感性，较基于低维混沌映射的Hash函数具有更强的保密性能，且实现简单. 关键词： 时空混沌 Hash函数 单向耦合映像格子     

Cascaded Fresnel holographic image encryption scheme based on a constrained optimization algorithm and Henon map

We propose an image encryption scheme using chaotic phase masks and cascaded Fresnel transform holography based on a constrained optimization algorithm. In the proposed encryption scheme, the chaotic phase masks are generated by Henon map, and the initial conditions and parameters of Henon map serve as the main secret keys during the encryption and decryption process. With the help of multiple chaotic phase masks, the original image can be encrypted into the form of a hologram. The constrained optimization algorithm makes it possible to retrieve the original image from only single frame hologram. The use of chaotic phase masks makes the key management and transmission become very convenient. In addition, the geometric parameters of optical system serve as the additional keys, which can improve the security level of the proposed scheme. Comprehensive security analysis performed on the proposed encryption scheme demonstrates that the scheme has high resistance against various potential attacks. Moreover, the proposed encryption scheme can be used to encrypt video information. And simulations performed on a video in AVI format have also verified the feasibility of the scheme for video encryption.     

The keyed optical Hash function based on cascaded phase-truncated Fourier transforms

An approach for constructing keyed optical Hash function (KOHF) is proposed, which is based on cascaded phase-truncated Fourier transforms (CPTFTs). The KOHF is created from a two-step one-way encryption process with a secret key imbedded. The non-linearity and one-way functionality is introduced by cascaded optical Fourier transforms with the phase-truncation operations, which could be implemented either digitally or optically. Once two 64-bit keyed Hash values are obtained in the two-step one-way encryption processes, respectively, they are then combined to form a final 128-bit keyed Hash value, which can also be regarded as a message authentication code (MAC). Moreover, the avalanche effect is also evaluated to show the performance of constructed KOHF with a set of numerical experiments.     

基于混沌神经网络的单向Hash函数

提出了一种基于混沌神经网络的单向Hash函数，该方法通过使用以混沌分段线性函数作为输出函数的神经网络和基于时空混沌的密钥生成函数实现明文和密钥信息的混淆和扩散，并基于密码块连接模式实现对任意长度的明文序列产生128位的Hash值.理论分析和实验结果表明，提出的Hash函数可满足所要求的单向性，初值和密钥敏感性，抗碰撞性和实时性等要求. 关键词： 混沌神经网络 Hash函数 分段线性混沌映射 时空混沌     

基于混沌的自嵌入安全水印算法

利用混沌系统的伪随机性和初值敏感性，提出一种基于混沌的自嵌入安全水印算法.该算法以混沌初值为密钥生成混沌序列，根据混沌序列的索引有序序列随机生成图像块的水印嵌入位置.与现有的自嵌入算法相比，该算法实现了水印嵌入位置的随机选取，有效扩大了算法的密钥空间，且解决了自嵌入水印算法如何准确定位篡改块的问题.理论分析和仿真结果表明，该算法不仅提高了自嵌入水印算法的篡改定位的能力，而且进一步增强了算法抵抗向量量化攻击和同步伪造攻击的能力. 关键词： 数字水印 混沌 脆弱水印 自嵌入     

基于混沌动态S-Box的Hash函数

结合混沌系统与传统单向Hash函数设计方法的优点，提出了一种基于混沌动态S-Box的带秘密密钥的单向Hash函数构造方法.该方法用混沌S-Box替换和函数查找表来生成具有混沌特性的Hash摘要.与现有混沌Hash算法相比，新方案没有将原始数据直接参与混沌迭代，而是采用混沌动态S-Box替换来提高系统的实时性能.研究结果表明：该方法不仅有很好单向性、初值和密钥敏感性，且有较大的密钥空间，易于实现. 关键词： Hash函数 混沌 S-Box 函数查找表     

A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism

This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.     

Multiparty Quantum Secret Sharing of Secure Direct Communication Using Teleportation

We present an (n,n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state and teleportation.After ensuring the security of the quantum channel,the sender encodes the secret message directly on a sequence of particle states and transmits it to the receivers by teleportation.The receivers can recover the secret message by combining their measurement results with the sender's result.If a perfect quantum channel is used,our scheme is completely secure because the transmitting particle sequence does not carry the secret message.We also show our scheme is secure for noise quantum channel.     

具有双向认证功能的量子秘密共享方案

利用两粒子纠缠态作为经典信息的载体,结合Hash函数和量子本地操作提出了一种可以实现双向认证功能的量子秘密共享方案,并且分析了它的安全性. 这种方案的安全性基于秘密共享双方的认证密钥和传输过程中粒子排列次序的保密. 若不考虑认证和窃听检测所消耗的粒子,平均1个Bell态共享2 bit经典信息. 关键词： 量子秘密共享 认证密钥 量子双向认证 两粒子量子纠缠     

A Multi-party Quantum Key Agreement Protocol Based on Shamir’s Secret Sharing

Quantum networks can extend the advantages of quantum key distribution protocols to more than two remote participants. Based on Shamir threshold secret sharing scheme, a new quantum key agreement protocol on a quantum network with any number of participants is proposed. First, each participant and distributor negotiate a sub-secret key using a kind of quantum key distribution protocol, and then each of these participants, as distributor, shares these sub-secret keys with other participants using Shamir threshold secret sharing scheme. Furthermore, each participant combines all these shared sub-secret keys and his own sub-secret key in sequence to form secret key, and sends the hash function values of this secret key to the master distributor to authenticate, finally they obtain the security key. Our scheme is practical and secure, and it can also prevent fraudulent from participants.

     

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

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

驱动函数切换调制实现超混沌数字保密通信

在主动-被动分解同步的基础上,提出了一种利用不同超混沌系统的驱动函数切换调制实现数字保密通信的方案.根据二进制信号“0”和“1”的传输情况交替发射两个不同的驱动函数,这就增加了发射信号的复杂度,减少了信号的相关性.且通过进行多次非线性变换加密,进一步设置了新的密钥,使得基于预测法的攻击完全失效.理论分析和模拟结果均表明本方案在实现超混沌数字保密通信时的有效性. 关键词： 超混沌 主动-被动分解法 切换调制 保密通信     

A scheme for secure direct communication using EPR pairs and teleportation

A novel scheme for secure direct communication between Alice and Bob is proposed, where there is no need for establishing a shared secret key. The communication is based on Einstein-Podolsky-Rosen (EPR) pairs and teleportation between Alice and Bob. After insuring the security of the quantum channel (EPR pairs), Bob encodes the secret message directly on a sequence of particle states and transmits them to Alice by teleportation. In this scheme teleportation transmits Bobs message without revealing any information to a potential eavesdropper. Alice can read out the encoded messages directly by the measurement on her qubits. Because there is not a transmission of the qubit which carries the secret message between Alice and Bob, it is completely secure for direct secret communication if perfect quantum channel is used.Received: 17 March 2004, Published online: 30 September 2004PACS: 03.67.Dd Quantum cryptography - 03.67.Hk Quantum communicationF.L. Yan: Present address: Department of Physics, Hebei Normal University, Shijiazhuang 050016, P.R. China     

基于二维超混沌映射的单向Hash函数构造

快速有效的单向Hash函数的设计是现代密码学研究的一个热点.提出了一种基于二维超混沌映射的单向Hash函数的构造方法.该方法将原始输入报文按字节进行线性变换以及混沌映射，在所产生的混沌序列中选值作为二维超混沌映射的初始值，对迭代后所得的超混沌信号经过调制构造单向Hash函数.实验与分析结果表明，这种构造方法实现简单、对初值有高度敏感性、具有很好的单向性、弱碰撞性和保密性能. 关键词： 单向Hash函数 二维超混沌 混沌映射     

Quantum Secret Sharing of Secure Direct Communication Using One-Time Pad

Instead of sharing some sifted keys, quantum secret sharing of secure direct communication (QSS-SDC) allows a dealer Alice to share her secret message directly with a group of agents, who can then cooperate together to restore her message in a later time. However, we notice that, in order to recover the secret message, most existing QSS-SDC schemes require a quantum memory to store a resulting quantum state. As the technique of quantum memory is still not available today, we present a multiparty QSS-SDC protocol using quantum one time pad, which allows the agents to store their shares with classical binary strings. Moreover, the proposed scheme uses only single photons, which makes it easier to implement with current technology even when the number of the participants becomes large.     

Multiparty Quantum Remote Secret Conference

We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger-Horne- Zeilinger （GHZ） states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key~ a sequence of GHZ states shared among all the conferees and used repeatedly after confirming their security. Both these schemes are optimal as their intrinsic efficiency for qubits approaches the maximal value.     

A NEW STRATEGY OF CHAOS CONTROL AND A UNIFIED MECHANISM FOR SEVERAL KINDS OF CHAOS CONTROL METHODS

Based on a general principle of physics that a physical system is in the most stable state if it is of the lowest energy stale, a new method for chaos control is proposed. A calculable generalized energy function in a nonlinear system is suggested for measuring control process, The Henon map and Lorenz system are taken as two typical examples to demonstrate the method. A series of stabilized periodic orbits as well aa inverse sequence of chaotic bands are obtained. At the same time, a unified mechanism of physics for several kinds of current cbaos control methods is studied using the idea proposed in this paper.     

Encrypting the compressed image by chaotic map and arithmetic coding

Due to the efficient and secure requirements of image transmission, a number of research works have been done to encrypt the compressed image. Inspired by the arithmetic coding and chaotic map which are used to compress and encrypt image, respectively. In this paper, a scheme is proposed to encrypt the compressed image by chaotic map and arithmetic coding. This scheme compresses the image row by row which is firstly permuted by two logistic maps before arithmetic coding. It not only enhances the security of arithmetic coding, but also improves the compression ratio. To further improve the security of binary data which has been compressed, we use the chaotic maps to encrypt the data, and set different parameters and initial value for chaotic maps. In order to possess high sensitivities of key and plain-image, the keys that are employed to determine the parameter and initial value of chaotic maps are related to the plain-image. The experimental results validate the effect of the proposed scheme and demonstrate that the compressed and encrypted image is secure and convenient for transmission.