An Image Encryption Algorithm Based on Oversampled Chaotic Map

2013 ◽  
Vol 694-697 ◽  
pp. 2016-2020
Author(s):  
Shu Cong Liu ◽  
Yan Xing Song ◽  
Jing Song Yang
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Chaotic Sequence ◽  
Transmission System ◽  
Encryption Algorithm ◽  
Chaotic Mapping ◽  
Key Space ◽  
Encryption And Decryption ◽  
Simulation Results ◽  
Image Encryption Algorithm

A new image encryption algorithm based on chaotic sequence is proposed, and the over sampled techniques is used in the Chebyshev mapping and Logistic chaotic mapping to generate multi-parameter chaotic key.A chaotic image encryption transmission system is build to achieve the encryption and decryption of the image signal,and the security and the encryption properties of the algorithm are analyzed. Simulation results show that the method ia simple and easy to achieve, and with larger key space ang good encryption effect.

A Watermark Preprocessing Algorithm Based on Arnold Transformation and Logistic Chaotic Map

2011 ◽  
Vol 341-342 ◽  
pp. 720-724 ◽  
Author(s):  
Wang Sheng Fang ◽  
Lu Lu Wu ◽  
Rong Zhang
Keyword(s):  
Correlation Analysis ◽  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Arnold Transform ◽  
Key Space ◽  
Key Sensitivity ◽  
Logistic Chaotic Map ◽  
Arnold Transformation ◽  
Image Encryption Algorithm

One of the main purpose of the watermark preprocessing is to improve the robustness and security. For this reason,this paper presents an image encryption algorithm, which combines position scrambling and gray scrambling scrambled according to Arnold transform.Then all of the pixels of each sub-block are scambled by the algorithm based on Logistic chaotic map.Finally, all of the Pixels are redistributed and scrambled totally.Basing on image location scrambling,it takes advantage of multi-dimensional Arnold transformation and Logistic chaotic map, image gray scrambling is achieved. By histogram analysis,key sensitivity anslysis and correlation analysis of adjacent pixels of the results of the simulation, indicating that the scrambling effect of the algorithm is good,and the key space is large.

scholarly journals A digital image encryption algorithm based on chaotic mapping

2019 ◽  
Vol 13 ◽  
pp. 174830261985347 ◽  
Author(s):  
Zhijuan Deng ◽  
Shaojun Zhong
Keyword(s):  
Image Encryption ◽  
Digital Image ◽  
Encryption Algorithm ◽  
Experimental Simulation ◽  
Secret Key ◽  
Chaotic Mapping ◽  
Key Space ◽  
Encrypted Images ◽  
Digital Image Encryption ◽  
Image Encryption Algorithm

In this article, we introduced a digital image encryption algorithm based on the chaotic mapping designed by Xiong et al. In their paper, the authors theoretically analyzed the algorithm and pointed out that the algorithm did not need to have the prior knowledge of the orbital distribution and one can select any chaotic model. In this way, the algorithm greatly expanded the cryptographic space and greatly reduced the number of iterations of the mapping. Since the algorithm has many characteristics, for instance, it is sensitive to the secret key, its key space is big, the pixel is well distributed after being encrypted, etc., the security of the encrypted images can be assured effectively. However, since the algorithm applied the image scrambling for encryption, and did not take the chosen-plaintext attacks into consideration, the algorithm is relatively weak in resisting the chosen-plaintext attacks. Therefore, we put forward a kind of image replacement method based on chaos, which can resist the chosen-plaintext attacks. And the experimental simulation proves that this algorithm not only has many characteristics, for instance, it is sensitive to the secret key, its key space is big, the pixel is well distributed after being encrypted, etc., but also can resist the chosen-plaintext attacks effectively. In the meanwhile, the algorithm is very sensitive to the small changes of the plaintexts, and its encrypted images will completely lose the features of the original ones.

scholarly journals Secure Image Encryption Based on an Ideal New Nonlinear Discrete Dynamical System

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
R. M. Lin ◽  
T. Y. Ng
Keyword(s):  
Dynamical System ◽  
Image Encryption ◽  
Discrete Dynamical System ◽  
Chaotic Sequence ◽  
Encryption Algorithm ◽  
Plain Text ◽  
System Parameters ◽  
Key Space ◽  
Highly Nonlinear ◽  
Image Encryption Algorithm

It is well known that encryption algorithms developed based on Logistic map suffer from limited key space due to the narrow regions of system parameters which can be used, potential risk of security in the presence of numerous periodic windows within the key space, and weakness in known-plain-text attack due to the inherent correlation among the chaotic sequence used for encryption. To overcome these existing problems, this paper presents a secure image encryption algorithm based on a new highly nonlinear discrete dynamical system with ideal chaotic characteristics. Transcendental functions are introduced together with modulo operations which physically represent discontinuous time-varying nonlinearities, leading to extremely complex chaotic behavior that is highly sensitive to system parameters and initial conditions, both of which are considered as the key for the cryptosystem. Extensive numerical experiment results have revealed that the proposed image encryption algorithm offers advantages of unlimited key space and high-level security, since those problematic periodic windows are no longer present within the key space, and it is extremely robust against known-plain-text attack, since the chaotic sequence generated bears no correlation whatsoever due to the folding effect of modulo operation. The algorithm makes truly efficient yet highly secure image encryption based on chaotic systems a reality.

scholarly journals A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

2021 ◽  
Author(s):  
Temadher Alassiry Al-Maadeed ◽  
Iqtadar Hussain ◽  
Amir Anees ◽  
Muhammad Tahir Mustafa
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Irreducible Polynomial ◽  
High Sensitivity ◽  
Chaotic Sequence ◽  
Encryption Algorithm ◽  
Lorenz Chaotic System ◽  
Image Encryption Algorithm

AbstractWe have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. Nowadays, the chaotic cryptosystems gained more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, there are many encryption algorithms that can simply guarantees security while the schemes based on chaotic systems only promises the uncertainty, both of them can not encounter the needs of current scenario. To tackle this issue, this article proposed an image encryption algorithm based on Lorenz chaotic system and primitive irreducible polynomial substitution box. First, we have proposed 16 different S-boxes based on projective general linear group and 16 primitive irreducible polynomials of Galois field of order 256, and then utilized these S-boxes with combination of chaotic map in image encryption scheme. Three chaotic sequences can be produced by the disturbed of Lorenz chaotic system corresponding to variables x, y and z. We have constructed a new pseudo random chaotic sequence ki based on x, y and z. The plain image is encrypted by the use of chaotic sequence ki and XOR operation to get a ciphered image. To show the strength of presented image encryption, some renowned analyses are performed.

scholarly journals An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yuping Hu ◽  
Congxu Zhu ◽  
Zhijian Wang
Keyword(s):  
Image Encryption ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Pseudorandom Sequences ◽  
Piecewise Linear Chaotic Map ◽  
Key Space ◽  
Plain Image ◽  
Image Encryption Algorithm

An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.

A NOVEL CHAOTIC IMAGE ENCRYPTION SCHEME BASED ON MAGIC CUBE PERMUTATION AND DYNAMIC LOOK-UP TABLE

2012 ◽  
Vol 26 (29) ◽  
pp. 1250139
Author(s):  
XINGYUAN WANG ◽  
LEI YANG
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Cyclic Shift ◽  
Well Performance ◽  
Look Up Table ◽  
Key Space ◽  
Magic Cube ◽  
Stable Points ◽  
Image Encryption Algorithm

This paper puts forward a novel image encryption algorithm that is based on permutation-diffusion architecture. In pixels' permutation stage, algorithm takes full advantage of the idea of magic cube's scrambling. There is only simple cyclic shift operation in each sub-block's permutation, but when the algorithm has disposed the current sub-block, the adjacent sub-blocks will be dealt with, too. In the cyclic shift of each row, stable points will help to decrease the correlation of adjacent pixels. To make encryption procedure uncertain, this paper brings in a parameter named delay-time that is generated by chaotic map. In the diffusion stage, by combining multiple operations and dynamic look-up table together, the proposed algorithm highly increases the uncertainty of the encryption procedure. At last, the experiment results of key space analysis, information entropy analysis, histogram analysis and etc. show that the encryption algorithm has well performance and it can be used in image encryption and transmission.

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document