A cryptosystem based on cellular automata

Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata. (c) 1998 American Institute of Physics.     

Algorithms for computing preimages of cellular automata configurations

This paper investigates pre-images (ancestors or past configurations) of specified configurations of one-dimensional cellular automata. Both counting and listing of pre-images are discussed. The main graphical tools used are the de Bruijn diagram, and its extension the pre-image network, which is created by concatenating de Bruijn diagrams. The counting of pre-images is performed as the multiplication of topological matrices of de Bruijn diagrams. Listing of pre-images is described using two algorithms. The first algorithm traces paths in the pre-image network and focuses on local knowledge of the network. The second performs a complete analysis of the network before proceeding with listing.     

基于一维元胞自动机的复杂网络恶意软件传播研究

基于一维元胞自动机,研究复杂网络恶意软件传播行为.利用信息网络节点全局交互的特点,建立元胞自动机邻域和状态转换函数,提出恶意软件传播模型,研究在多种网络拓扑下恶意软件传播的概率行为.研究表明,该模型能够准确描述在最近邻耦合网络（nearest-neighbor coupled network, NC）,Erdos-Renyi（ER）随机网络,Watts-Strogatz（WS） 小世界网络和Barabasi-Albert（BA）幂率网络等拓扑下的传播动力学行为,不仅能反映恶意软件传播的平均趋势,而且可以描述病毒消亡和渗透等稀有概率事件,有效克服基于平均场方法建立的微分方程模型只能反映传播的平均趋势,只适合对传播作整体预测的局限性.同时,研究指出网络中度分布的异质化程度和网络的局域空间交互特征是影响传播及免疫行为的关键要素. 关键词： 复杂网络 恶意软件传播 元胞自动机 状态转换函数     

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states.This paper presents how to use a [2k-1,1,k] quantum error-correcting code(QECC) to implement a quantum(k,2k 1) threshold scheme.It also takes advantage of classical enhancement of the [2k-1,1,k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously.Because information is encoded into QECC,these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.     

Multiparty quantum secret sharing based on Bell measurement

A multiparty quantum secret sharing scheme based on Bell measurement is proposed and analyzed. In this scheme, all agents are not required to prepare entangled states or perform any local unitary operation. The security of the protocol is also analyzed. It is shown that any eavesdropper will introduce errors invariably and be detected if he tries to steal information about Trent’s secret. Moreover, because no classical bit needs to be transmitted except those for detection, the total efficiency of the scheme approaches to 100%.     

一种基于双偏振分束器的量子秘密共享方案

提出一个基于双偏振分束器的单量子比特全光纤量子秘密共享方案, 该方案具有自动补偿光纤及光学器件的双折射效应和相位抖动的功能, 在干涉对比度测试和稳定性测试时, 该方案在5 km通信距离中, 获得的干涉对比度优于993%, 且可长时间保持稳定. 关键词： 量子秘密共享 偏振分束器 单光子干涉     

一种双重变换的二维图像加密算法

提出了一种改进的双重加密算法,利用新构造的位置置乱方法将二维矩阵中行和列映射到一维向量中,然后采用Logistic映射产生一组伪随机序列,将伪随机序列由小到大进行排序,对排序后的位置以集合序列的形式记录下来,形成密钥流;最后对一维向量按照密钥流形成的索引值进行重新排列,重排后的一维向量转换为与原始图像矩阵大小相同即得到加密图像。实验结果表明,该算法具有密钥空间大,加密后直方图分布具有白噪声的特性,提高了图像传输的安全性。     

Participant attack on quantum secret sharing based on entanglement swapping

The security of quantum secret sharing based on entanglement swapping is revisited and a participant attack is presented. In this attack two dishonest agents together can illegally recover the secret quantum state without the help of any other controller, and it will not be detected by any other users. Furthermore, by modifying the distribution process of particles and adding a detection step after each distribution process, we propose an improved protocol which can resist this kind of attack.     

A novel chaotic based image encryption using a hybrid model of deoxyribonucleic acid and cellular automata

Currently, there are many studies have conducted on developing security of the digital image in order to protect such data while they are sending on the internet. This work aims to propose a new approach based on a hybrid model of the Tinkerbell chaotic map, deoxyribonucleic acid (DNA) and cellular automata (CA). DNA rules, DNA sequence XOR operator and CA rules are used simultaneously to encrypt the plain-image pixels. To determine rule number in DNA sequence and also CA, a 2-dimension Tinkerbell chaotic map is employed. Experimental results and computer simulations, both confirm that the proposed scheme not only demonstrates outstanding encryption, but also resists various typical attacks.     

基于元胞自动机的行人疏散流仿真研究

基于元胞自动机对行人疏散流进行仿真研究.模型利用两个动态参数反映行人移动区域内的疏散情况,从而决定行人的行为选择.模型中行人可以根据自身周围的情况选择移动、等待行为.本文仿真研究了行人在正常疏散环境下,系统规模、疏散人数、安全出口宽度、多个安全出口布局对行人疏散时间的影响.研究结果表明,行人疏散时间随行人数量呈线性增加;随安全出口宽度呈负指数性减少;同时,多个安全出口布局的不平衡也会对行人的疏散过程和疏散时间产生一定的影响. 关键词： 元胞自动机 行人疏散流 动态参数 疏散时间     

Experimental quantum secret sharing based on phase encoding of coherent states

Quantum secret sharing(QSS) is one of the basic communication primitives in future quantum networks which addresses part of the basic cryptographic tasks of multiparty communication and computation. Nevertheless, it is a challenge to provide a practical QSS protocol with security against general attacks. A QSS protocol that balances security and practicality is still lacking. Here,we propose a QSS protocol with simple phase encoding of coherent states among three parties. Removing the requiremen...     

Analysis of a kind of quantum cryptographic schemes based on secret sharing

Recently, Yang et al. proposed a kind of quantum cryptographic schemes based on secret sharing. The main idea is drawn from the case, where any n participants who share a secret K can co-operate as K does. This process can be applied to encryption, authentication, signature and so on. Unfortunately, since there is no identity authentication of the share’s holder, these schemes inherit the limitation of secret sharing in practice. If some participants do not follow the protocol, the protocol would be a failu...     

Dynamic quantum secret sharing protocol based on two-particle transform of Bell states

To solve the problems of updating sub-secrets or secrets as well as adding or deleting agents in the quantum secret sharing protocol, we propose a two-particle transform of Bell states, and consequently present a novel dynamic quantum secret sharing protocol. The new protocol can not only resist some typical attacks, but also be more efficient than the existing protocols. Furthermore, we take advantage of the protocol to establish the dynamic secret sharing of a quantum state protocol for two-particle maximum entangled states.     

复合元胞自动机系统反向迭代加密技术研究

提出了元胞自动机的交叉复合在序列R下随机复合的思想,分析了复合元胞自动机系统的密码学特性,利用元胞自动机反向迭代加密技术,构造了两个基于复合元胞自动机的密码系统.新的复合元胞自动机密码系统很好地解决了单一元胞自动机密码系统中存在的误差单向扩散的问题,并且能够以较小的规则半径获得大密钥空间.计算机仿真结果表明,复合元胞自动机密码系统具有良好的扰乱和扩散性能,能够有效地抵抗蛮力攻击和差分分析. 关键词： 离散动力系统 复合元胞自动机 反向迭代 分组密码     

基于改进元胞自动机的数字保密通信方案

为了提高现有混沌保密通信系统的加解密速度和安全性,提出了一种新的即时同步流密码数字保密通信方案,在该方案中利用改进元胞自动机进行加密,并采用扩展密钥技术和置乱技术.数值模拟结果表明:该方案能产生随机性很好的流密码,并且具有较高的加解密速度和非常高的抗破译能力.     

Multiparty quantum secret sharing based on the improved Boström-Felbinger protocol

Based on the famous quantum secure direct communication protocol (i.e., the Boström-Felbinger protocol) [Phys. Rev. Lett. 89 (2002) 187902] and its improvements, we propose a scheme of multiparty quantum secret sharing of classical messages (QSSCM), in which no subset of all the classical message receivers is sufficient to extract the sender’s secret classical messages but all the parties cooperate together. Then we take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which the unknown quantum state in the sender’s qubit can be reconstructed in one receiver’s qubit if and only if all the quantum information receivers collaborate together.     

基于元胞自动机的对向行人交通流仿真研究

基于元胞自动机对对向行人交通流进行仿真研究. 模型利用四个动态参数反映行人移动区域和其视野范围内的实际情况,从而决定行人的行为选择,行人可以根据自身周围的情况选择前进、后退、等待、左右移动、交换位置等行为. 仿真研究不同方向比例与不同系统规模的对向行人流的速度-密度、流量-密度关系. 研究结果表明,系统存在相位转换和临界密度,方向比例和系统规模对行人流的速度-密度、流量-密度关系曲线的形状和系统临界密度值有一定的影响. 关键词： 元胞自动机 对向行人流 动态参数 临界密度     

A novel cellular automata based technique for visual multimedia content encryption

This paper proposes a new method for visual multimedia content encryption using Cellular Automata (CA). The encryption scheme is based on the application of an attribute of the CLF XOR filter, according to which the original content of a cellular neighborhood can be reconstructed following a predetermined number of repeated applications of the filter.The encryption is achieved using a key image of the same dimensions as the image being encrypted. This technique is accompanied by the one-time pad (OTP) encryption method, rendering the proposed method reasonably powerful, given the very large number of resultant potential security keys. The method presented here makes encryption possible in cases where there is more than one image with the use of just one key image. A further significant characteristic of the proposed method is that it demonstrates how techniques from the field of image retrieval can be used in the field of image encryption. The proposed method is further strengthened by the fact that the resulting encrypted image for a given key image is different each time. The encryption result depends on the structure of an artificial image produced by the superposition of four 1-D CA time-space diagrams as well as from a CA random number generator.A semi-blind source separation algorithm is used to decrypt the encrypted image. The result of the decryption is a lossless representation of the encrypted image. Simulation results demonstrate the effectiveness of the proposed encryption method. The proposed method is implemented in C# and is available online through the img(Rummager) application.     

A 3D image encryption technique using computer-generated integral imaging and cellular automata transform

A novel three-dimensional (3D) image encryption approach by using the computer-generated integral imaging and cellular automata transform (CAT) is proposed, in which, the two-dimensional (2D) elemental image array (EIA) digitally recorded by light rays coming from the 3D image is mapped inversely through the virtual pinhole array according to the ray-tracing theory. Next, the encrypted image is generated by using the 2D CAT scrambling transform for the 2D EIA. The reconstructed process is carried out by using the modified computational integral-imaging reconstruction (CIIR) technique; the depth-dependent plane images are reconstructed on the output plane. The reconstructed 3D image quality of the proposed scheme can be greatly improved, because the proposed encryption scheme carries out in a computer which can avoid the light diffraction caused by optical device CIIR, and solves blur problem caused by CIIR by using the pixel-averaging algorithm. Furthermore, the CAT-based encryption algorithm is an error-free encryption method; CAT as an orthogonal transformation offers considerable simplicity in the calculation of the transform coefficient, that is, it can improve the quality of the reconstructed image by reducing energy loss compared with the traditional complicated transform process. To show the effectiveness of the proposed scheme, we perform computational experiments. Experimental results show that the proposed scheme outperforms conventional encryption methods.     

Three-party quantum secret sharing of secure direct communication based on x-type entangled states

Based on x-type entangled states and the two-step protocol [Deng F G, Long G L and Liu X S 2003 Phys. Rev. A 68 042317], a quantum secret sharing protocol of secure direct communication based on x-type entangled states ｜X00〉3214 is proposed. Using some interesting entanglement properties of this state, the agent entirety can directly obtain the secret message from the message sender only if they collaborate together. The security of the scheme is also discussed.