一种光电器件加密方法的安全性分析

 为了找到一种安全、高速的图像加密方法,通过计算明文和密文的信息熵、灰度值等参数,研究了利用光电器件,采用流密码和位平面分解相结合的加密方法的安全性和该方案的抗破译能力。结果表明,该方案中, 对含信息量越少的图像,加密后平均灰度变化值越大;这种灰度变换的加密方法掩盖了各像素点之间的相关性,密文像素点灰度随机分布,分析者无法获得明文图像的灰度分布状况,使得分析者无法通过相关度分析提取图像轮廓,有效隐藏重要信息。因此,该加密方法具有极高的安全性,同时应将密文平均灰度值作为评价参数之一。     

A chaotic image encryption scheme owning temp-value feedback

Many round-based chaotic image encryption algorithms employ the permutation–diffusion structure. This structure has been found insecure when the iteration round is equal to one and the secret permutation of some existing schemes can be recovered even a higher round is adopted. In this paper, we present a single round permutation–diffusion chaotic cipher for gray image, in which some temp-value feedback mechanisms are introduced to resist the known attacks. Specifically, we firstly embed the plaintext feedback technique in the permutation process to develop different permutation sequences for different plain-images and then employ plaintext/ciphertext feedback for diffusion to generate equivalent secret key dynamically. Experimental results show that the new scheme owns large key space and can resist the differential attack. It is also efficient.     

Modified computational integral imaging-based double image encryption using fractional Fourier transform

In this paper, we propose an image encryption technique to simultaneously encrypt double or multiple images into one encrypted image using computational integral imaging (CII) and fractional Fourier transform (FrFT). In the encryption, each of the input plane images are located at different positions along a pickup plane, and simultaneously recorded in the form of an elemental image array (EIA) through a lenslet array. The recorded EIA to be encrypted is multiplied by FrFT with two different fractional orders. In order to mitigate the drawbacks of occlusion noise in computational integral imaging reconstruction (CIIR), the plane images can be reconstructed using a modified CIIR technique. To further improve the solution of the reconstructed plane images, a block matching algorithm is also introduced. Numerical simulation results verify the feasibility and effectiveness of the proposed method.     

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.     

Deep-learning-based cryptanalysis of two types of nonlinear optical cryptosystems

The two types of nonlinear optical cryptosystems (NOCs) that are respectively based on amplitude-phase retrieval algorithm (APRA) and phase retrieval algorithm (PRA) have attracted a lot of attention due to their unique mechanism of encryption process and remarkable ability to resist common attacks. In this paper, the securities of the two types of NOCs are evaluated by using a deep-learning (DL) method, where an end-to-end densely connected convolutional network (DenseNet) model for cryptanalysis is developed. The proposed DL-based method is able to retrieve unknown plaintexts from the given ciphertexts by using the trained DenseNet model without prior knowledge of any public or private key. The results of numerical experiments with the DenseNet model clearly demonstrate the validity and good performance of the proposed the DL-based attack on NOCs.     

Finite-time complex projective synchronization of fractional-order complex-valued uncertain multi-link network and its image encryption application

Multi-link networks are universal in the real world such as relationship networks, transportation networks, and communication networks. It is significant to investigate the synchronization of the network with multi-link. In this paper, considering the complex network with uncertain parameters, new adaptive controller and update laws are proposed to ensure that complex-valued multilink network realizes finite-time complex projective synchronization (FTCPS). In addition, based on fractional-order Lyapunov functional method and finite-time stability theory, the criteria of FTCPS are derived and synchronization time is given which is associated with fractional order and control parameters. Meanwhile, numerical example is given to verify the validity of proposed finite-time complex projection strategy and analyze the relationship between synchronization time and fractional order and control parameters. Finally, the network is applied to image encryption, and the security analysis is carried out to verify the correctness of this method.     

级联菲涅尔衍射光学图像安全系统

计算机模拟验证了系统用于光学图像加密和隐藏的可行性.理论分析揭示了本系统面向应用的三个性质：相位分布的台阶数可以作为系统设计的自由度;增加系统衍射级次可以提高秘密图像的解密质量,但此时系统受到波长微变的影响也较显著;轴向位移也会产生噪音信号,其衍射距离越长,解密质量越差.     

基于联合变换相关和相移干涉的图像加密

提出了一种在联合变换相关器结构中引入三步相移干涉和二元置乱技术的图像加密方法.用纯相位空间光调制器同时调制原始图像和两个随机相位掩模,利用三步相移技术分别将图像信息和主密钥加密为全息图,并用CCD在输出面上接收,再利用二元置乱技术置乱图像信息的全息图.在获得置乱密钥和附加密钥的情况下,可以通过一定的算法快速、清晰的重建原始图像.用计算机仿真验证了它的可行性和有效性.     

混沌加密的虹膜识别系统的安全性

提出了针对特征码的单向耦合映像格混沌加密系统,以及Arnold变换与单向耦合映像格混沌系统相结合对虹膜信息进行加密的复合混沌加密系统.利用Arnold变换置乱并混淆虹膜图像,通过镜像解决零点不变性问题,最后通过单向耦合映像格混沌系统实现加密.实验表明本算法密钥空间大,统计特性好,密钥敏感性强,加密速度快,平均加密时间70 ms.     

Cryptanalysis of a new image encryption algorithm based on hyper-chaos

This Letter proposes two different attacks on a recently proposed image based on hyper-chaos. The cryptosystem under study proceed first by shuffling the image rows and columns to disturb the high correlation among pixels by iterating the logistic map. Second, a keystream is generated to mix it with the pixels of the shuffled image using hyper-chaos. These two processes in the encryption stage present weakness, and a chosen plaintext attack and a chosen ciphertext attack can be done to recover the ciphered-image without any knowledge of the key value. It just demands three couples of plaintext/ciphertext to break totally the cryptosystem.