scholarly journals An Efficient Chosen-Plaintext Attack on an Image Fusion Encryption Algorithm Based on DNA Operation and Hyperchaos

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 804
Author(s):  
Shuqin Zhu ◽  
Congxu Zhu

This paper proposes a more efficient attack method on an image fusion encryption algorithm based on DNA operation and hyperchaos. Although several references have reported some methods to crack the image encryption algorithm, they are not the most efficient. The proposed chosen-plaintext attack method can break the encryption scheme with (4×N/M+1) or (M/(4×N)+1) chosen-plaintext images, which is much less than the number of chosen-plaintext images used in the previous cracking algorithms, where M and N represent the height and width of the target ciphertext image, respectively. The effectiveness of the proposed chosen-plaintext attack is supported by theoretical analysis, and verified by experimental results.

2020 ◽  
Vol 30 (04) ◽  
pp. 2050060 ◽  
Author(s):  
Cong Xu ◽  
Jingru Sun ◽  
Chunhua Wang

In this paper, we propose an image encryption algorithm based on random walk and two hyperchaotic systems. The random walk method is adopted to scramble the position of pixels within a block. Furthermore, the permutation operation between blocks is presented to enhance the scramble effect. Thus, high correlation among pixels of original image is broken by permutation. Moreover, the chosen plaintext attack is used to test the anti-attack ability of the proposed algorithm. By analyzing experimental results and comparing with other image encryption algorithms, we show that the proposed algorithm has better performance and higher security.


2013 ◽  
Vol 23 (04) ◽  
pp. 1350075 ◽  
Author(s):  
CHENGQING LI ◽  
YUANSHENG LIU ◽  
LEO YU ZHANG ◽  
MICHAEL Z. Q. CHEN

This paper re-evaluates the security of a chaotic image encryption algorithm called MCKBA/ HCKBA and finds that it can be broken efficiently with two known plain-images and the corresponding cipher-images. In addition, it is reported that a previously proposed breaking on MCKBA/HCKBA can be further improved by reducing the number of chosen plain-images from four to two. The two attacks are both based on the properties of solving a composite function involving the carry bit, which is composed of the modulo addition and the bitwise OR operations. Both rigorous theoretical analysis and detailed experimental results are provided.


2010 ◽  
Vol 40-41 ◽  
pp. 924-929
Author(s):  
Yong Yi Mao ◽  
Zi Chao Deng

In this paper, a new method is proposed for image encryption by using Transformed Logistic map and Cat map. First, the Transformed logistic map is used to generating two coordinate sequences, and then the primary image's pixels shuffled by the two coordinate sequences. After shuffling, the key stream is produced by the Cat map to encrypt the shuffled image. Theoretical analysis and experimental results indicate that the proposed algorithm has a perfect encryption effect and can resist common attacks


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Qiang Zhang ◽  
Xianglian Xue ◽  
Xiaopeng Wei

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Liang-Jia Tong ◽  
Nan-Run Zhou ◽  
Zhi-Jing Huang ◽  
Xin-Wen Xie ◽  
Ya-Ru Liang

A nonlinear multi-image encryption scheme is proposed by combining the reality-preserving discrete fractional angular transform with the deoxyribonucleic acid sequence operations. Four approximation coefficients of the four images are extracted by performing the two-dimensional lifting wavelet transform. Then, the four approximation coefficients are synthesized to generate a real-valued output with the reality-preserving discrete fractional angular transform. Finally, based on the deoxyribonucleic acid operation and the Logistic-sine system, the real-valued intermedium output will be encrypted to yield the final ciphertext image. To enhance the security of the image encryption algorithm, the initial value of the chaotic system is calculated by the 256-bit binary sequence, which is obtained by taking the statistics information of the plaintext images as the input of SHA-256. Deoxyribonucleic acid sequence operations, as nonlinear processes, could help to improve the robustness of the cryptosystem. Simulation results and security analysis demonstrate the effectiveness of the image encryption algorithm and the capability of withstanding various common attacks.


2020 ◽  
Vol 10 (6) ◽  
pp. 2187
Author(s):  
Yuqiang Dou ◽  
Ming Li

Security of image communication is more and more important in many applications such as the transmission of military and medical images. To meet the requirement, a new color image encryption algorithm using a new one-dimension (1D) chaotic map was proposed recently, which can resist various attacks because the range of the new chaotic map is larger than that of the previous ones. In our study, the security of the new original method is analyzed and a novel attack method is proposed. It is demonstrated that the scheme is not secure under chosen-plaintext attack, by which the encrypted image can be successfully converted into the corresponding plaintext image without any error.


2011 ◽  
Vol 179-180 ◽  
pp. 470-474
Author(s):  
Jian Zhang ◽  
Hong E Ren ◽  
Yu Chen

Image scrambling is an important method to achieve images secrecy. Arnold cat transformation is widely applied, and its scrambling effect is better relatively in the classical scrambling algorithms. But it has some shortcomings of short key qualities and poor universal property. It brings forward an algorithm of image position even scrambling through improving the Arnold cat transformation. On the basis of position scrambling, the image pixel values are scrambled using chaotic map. Experimental results show that the algorithm has many advantages of increasing key qualities obviously, satisfactory effect of scrambling, and the pixel values of the image are both changed.


2018 ◽  
Vol 69 (2) ◽  
pp. 93-105 ◽  
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
L’uboš Ovseník ◽  
Tomáš Huszaník

Abstract This paper describes an image encryption algorithm which utilizes chaotic logistic map. Values generated by this map are used in two steps of algorithm which shuffles image pixels and then changes their intensities. Design of the encryption scheme considers possibility of various attacks, such as statistical, differential or phase space reconstruction attacks. Robustness against last mentioned type of attacks is introduced by selective skipping of values generated by the map. This skipping depends on key entered by user. The paper also verifies properties of proposed algorithm by common measures and by set of statistical tests that examine randomness of computed encrypted images. Results are compared with other approaches and they are also briefly discussed.


2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Shenyong Xiao ◽  
ZhiJun Yu ◽  
YaShuang Deng

Chaos has been widely used in image encryption due to its rich properties. However, it remains an irreconcilable contradiction for security and implementation efficiency for image encryption schemes. In this paper, a novel chaos-based image encryption scheme has been proposed, where the Lorenz chaotic system is applied to generate pseudorandom sequences with good randomness, and a random switch control mechanism is introduced to ensure the security of the encryption scheme. Experimental results demonstrate the effectiveness and superiority of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document