A Novel Image Encryption Algorithm Based on the Two-Dimensional Logistic Map and the Latin Square Image Cipher

3D Research ◽  
2015 ◽  
Vol 6 (4) ◽  
Author(s):  
M. Machkour ◽  
A. Saaidi ◽  
M. L. Benmaati
2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.


2018 ◽  
Vol 11 (1) ◽  
pp. 15-25
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
Ľuboš Ovseník

Abstract This paper proposes an image encryption algorithm which uses four scans of an image during the diffusion stage in order to achieve total diffusion between intensities of image pixels. The condition of total diffusion is fulfilled by a suitable combination of techniques of ciphertext chaining and plaintext related diffusion. The proposed encryption algorithm uses two stages which utilize chaotic logistic map for generation of pseudo-random sequences. The paper also briefly analyzes approaches described by other researchers and evaluates experimental results of the proposed solution by means of commonly used measures. Properties of our proposal regarding modifications of plain images prior to encryption or modifications of encrypted images prior to decryption are illustrated by two additional experiments. The obtained numeric results are compared with those achieved by other proposals and briefly discussed.


2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Jiming Zheng ◽  
Zheng Luo ◽  
Zhirui Tang

In this paper, an improved two-dimensional logistic-sine coupling map (N2D-LSCM) and an improved Henon map (NHenon) are proposed. Furthermore, by combining N2D-LSCM and NHenon map, an image encryption algorithm is proposed based on these two chaotic systems and DNA coding. The chaotic sequences generated by N2D-LSCM are used as the parameters of NHenon. In the scrambling stage, DNA encoding is carried out for pixels after scrambling by two chaotic sequences generated by N2D-LSCM; in the stage of diffusion, DNA random coding acts on random matrix obtained by two chaotic sequences generated by NHenon, and DNA XOR operation is carried out with the image obtained in the scrambling stage to diffuse. Compared with other 2D map for image encryption algorithm, this algorithm exhibits good security and holds high efficiency.


2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Jianwen Zou ◽  
Linquan Huang ◽  
Yifan Liu

The popularization of 5G and the development of cloud computing further promote the application of images. The storage of images in an untrusted environment has a great risk of privacy leakage. This paper outlines a design for a lightweight image encryption algorithm based on a message-passing algorithm with a chaotic external message. The message-passing (MP) algorithm allows simple messages to be passed locally for the solution to a global problem, which causes the interaction among adjacent pixels without additional space cost. This chaotic system can generate high pseudorandom sequences with high speed performance. A two-dimensional logistic map is utilized as a pseudorandom sequence generator to yield the external message sets of edge pixels. The external message can affect edge pixels, and then adjacent pixels interact with each other to produce an encrypted image. A MATLAB simulation shows the cipher-image performs fairly uniform distribution and has acceptable information entropy of 7.996749. The proposed algorithm reduces correlation coefficients from plain-image 1 to its cipher-image 0, which covers all of the plain-image characters with high computational efficiency (speed = 18.200374 Mbit/s). Theoretical analyses and experimental results prove the proposed algorithm’s persistence to various existing attacks with low cost.


Fractals ◽  
2021 ◽  
pp. 2140041
Author(s):  
ZE-YU LIU ◽  
TIE-CHENG XIA ◽  
HUA-RONG FENG ◽  
CHANG-YOU MA

A new fractional two-dimensional quadric polynomial discrete chaotic map (2D-QPDM) with the discrete fractional difference is proposed. Afterwards, the new dynamical behaviors are observed, so that the bifurcation diagrams, the largest Lyapunov exponent plot and the phase portraits of the proposed map are given, respectively. The new discrete fractional map is exploited into color image encryption algorithm and it is illustrated with several examples. The proposed image encryption algorithm is analyzed in six aspects which indicates that the proposed algorithm is superior to other known algorithms as a conclusion.


Sign in / Sign up

Export Citation Format

Share Document