Cryptanalysis of an ergodic chaotic encryption algorithm

In this paper, we present the results for the security and the possible attacks on a new symmetric key encryption algorithm based on the ergodicity property of a logistic map. After analysis, we use mathematical induction to prove that the algorithm can be attacked by a chosen plaintext attack successfully and give an example to show how to attack it. According to the cryptanalysis of the original algorithm, we improve the original algorithm, and make a brief cryptanalysis. Compared with the original algorithm, the improved algorithm is able to resist a chosen plaintext attack and retain a considerable number of advantages of the original algorithm such as encryption speed, sensitive dependence on the key, strong anti-attack capability, and so on.     

Signing and Verifying Encrypted Medical Images Using Double Random Phase Encryption

Digital Signature using Self-Image signing is introduced in this paper. This technique is used to verify the integrity and originality of images transmitted over insecure channels. In order to protect the user’s medical images from changing or modifying, the images must be signed. The proposed approach uses the Discrete Wavelet Transform to subdivide a picture into four bands and the Discrete Cosine Transform DCT is used to embed a mark from each sub-band to another sub-band of DWT according to a determined algorithm. To increase the security, the marked image is then encrypted using Double Random Phase Encryption before transmission over the communication channel. By verifying the presence of the mark, the authority of the sender is verified at the receiver. Authorized users’ scores should, in theory, always be higher than illegal users’ scores. If this is the case, a single threshold might be used to distinguish between authorized and unauthorized users by separating the two sets of scores. The results are compared to those obtained using an approach that does not employ DWT.     

Image Encryption Scheme Based on Mixed Chaotic Bernoulli Measurement Matrix Block Compressive Sensing

Many image encryption schemes based on compressive sensing have poor reconstructed image quality when the compression ratio is low, as well as difficulty in hardware implementation. To address these problems, we propose an image encryption algorithm based on the mixed chaotic Bernoulli measurement matrix block compressive sensing. A new chaotic measurement matrix was designed using the Chebyshev map and logistic map; the image was compressed in blocks to obtain the measurement values. Still, using the Chebyshev map and logistic map to generate encrypted sequences, the measurement values were encrypted by no repetitive scrambling as well as a two-way diffusion algorithm based on GF(257) for the measurement value matrix. The security of the encryption system was further improved by generating the Secure Hash Algorithm-256 of the original image to calculate the initial values of the chaotic mappings for the encryption process. The scheme uses two one-dimensional maps and is easier to implement in hardware. Simulation and performance analysis showed that the proposed image compression–encryption scheme can improve the peak signal-to-noise ratio of the reconstructed image with a low compression ratio and has good encryption against various attacks.     

Behavioral effects of a four-wing attractor with circuit realization: a cryptographic perspective on immersion

In this paper, we propose an innovative chaotic system, combining fractional derivative and sine-hyperbolic nonlinearity with circuit execution. The study of this system is conducted via an analog circuit simulator, using two anti-parallel semiconductor diodes to provide hyperbolic sine nonlinearity, and to function as operational amplifiers. The multi-stability of the system is also enhanced with the help of multi-equilibrium points for distinct real orders of system. The system explores the generation of a four-wing attractor in different phases, both numerically and electronically. By changing the input parameters of the system, different graphs are generated for current flow in state, phase, and space, to confirm the precision of the fractional order derivatives. A reasonable simulation shows that the deliberate circuit provides effective chaos in terms of speed and accuracy, which is comensurate with the numerical simulation. This nonlinear chaotic behavior is utilized to encrypt sound (.wav), images (.jpg), and animated (.gif) data which are a major requirement for the security of communication systems. The proposed circuit performs chaos and cryptographic tasks with high-effective analog computation, and constitutes a novel approach to this area of research.     

双随机相位加密系统的选择明文攻击

在光学信息安全领域,双随机相位加密方法最引人注目并得到广泛研究,但由于双随机相位加密系统是基于傅里叶变换的系统,其本质上是一种线性变换系统,明文、密文之间的函数依赖关系比较简单,这就为其安全性留下了很大的隐患。双随机相位加密方法可以用光学和数字的方式实现,提出了一种选择明文攻击的方法,利用多个冲击函数作为选择的明文,成功破解了基于数字方法实现的双随机相位加密系统,并给出了恢复密钥的解析式,此方法最大的优点在于解密图像的无损性,并从理论上加以证明,给出了实验结果。     

A novel image encryption method based on total shuffling scheme

In this paper, a novel image encryption method based on skew tent chaotic map and permutation-diffusion architecture is proposed. In the proposed method, the P-box is chosen as the same size of plain-image, which shuffles the positions of pixels totally. The keystream generated by skew tent chaotic map is related to the plain-image. Statistical analysis, information entropy analysis, and sensitivity analysis to plaintext and key on the proposed scheme are provided in this paper. It can be seen that this algorithm is efficient and reliable, with high potential to be adopted for network security and secure communications.     

基于现场可编程门阵列的手机短信息混沌加密系统设计方案及硬件实现

手机的普及使得个人信息安全问题受到广泛关注, 其中手机短信息的安全性尤为重要. 本文致力于设计实现手机短信息加密与安全传输的硬件系统, 采用混沌A5/1混合算法, 提出一种基于现场可编程门阵列(FPGA)的手机短信息加密系统设计方案. 使用由Logistic混沌序列做初始密钥而改进的A5/1混合算法作为加密算法, 分析其伪随机性并证明圆周相关与线性相关的关系; 采用SIM300模块设计实现手机功能, 仿真普通手机短信息和加密短信息的传输; 开发一套软件测试平台, 可以在计算机上呈现硬件系统的测试结果. 经测试表明, 本文提出并实现的硬件系统可以加密手机短信息并保证其正常传输, 从而提高了手机短信息的安全性.     

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.     

Novel image encryption algorithm based on multiple-parameter discrete fractional random transform

A new method of digital image encryption is presented by utilizing a new multiple-parameter discrete fractional random transform. Image encryption and decryption are performed based on the index additivity and multiple parameters of the multiple-parameter fractional random transform. The plaintext and ciphertext are respectively in the spatial domain and in the fractional domain determined by the encryption keys. The proposed algorithm can resist statistic analyses effectively. The computer simulation results show that the proposed encryption algorithm is sensitive to the multiple keys, and that it has considerable robustness, noise immunity and security.