# Image Encryption Using New Chaotic Map Algorithm

VIT University

^{1}06 Dec 2018-pp 458-466

TL;DR: A modified line map algorithm is proposed and it is considered as a chaotic map to scramble the image and its robustness against attacks has been increased by repeated permutation-diffusion round for ‘n’ number of times.

Abstract: In this digital era, all the information takes the form of various media during communication. This leads to the need for more concern on the security measures so that the data being transmitted is resilient to various malicious attacks. In this paper, a modified line map algorithm is proposed and it is considered as a chaotic map to scramble the image. The resultant chaotic Line map has been employed to permute the image pixels, whereas diffusion is performed by XOR operation to completely encrypt the image. The robustness of the image against attacks has been increased by repeated permutation-diffusion round for ‘n’ number of times. Histogram analysis, Number of pixels change rate and correlation analysis has been performed to analyze the robustness of the proposed technique. Simulation results proves that this methodology can be implemented in real time applications.

##### Citations

More filters

•

Riau University

^{1}TL;DR: A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed.

Abstract: Fingerprint is a reliable user authentication method as it is unique to individual users that makes it efficient for authenticating users. In a fingerprint authentication system, user fingerprint information is stored in databases in an image format known as a fingerprint template. Although fingerprint is reliable, the templates stored in the database are exposed to security threats either during the data transmission process over the network or in storage. Therefore, there is a need to protect the fingerprint template, especially in unsecured networks to maintain data privacy and confidentiality. Many past studies proposed fingerprint template protection (FTP) using chaotic-based encryption algorithms that are more suitable to secure images than conventional encryption such as DES, AES, and RSA. The chaotic-based encryption algorithms have been improved a lot in terms of their robustness. However, the robustness of the algorithm caused a trade-off to encryption speed where it remains an issue in FTP. Hence, this study aims to improve the limitations found in the existing chaotic-based encryption algorithms for FTP by improving its encryption speed using Henon and Logistic map. A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. The performance proposed encryption algorithm was promising which could be a starting point for detailed analysis and implementation in real application domains.

3 citations

### Cites background from "Image Encryption Using New Chaotic ..."

...one of the possible solutions for protecting images and addressing the limitations of traditional encryption techniques [10]-[11]....

[...]

##### References

More filters

01 Jan 2011

TL;DR: The question of whether a given NPCR/UACI score is sufficiently high such that it is not discernible from ideally encrypted images is answered by comparing actual NPCR and UACI scores with corresponding critical values.

Abstract: The number of changing pixel rate (NPCR) and the unified averaged changed intensity (UACI) are two most common quantities used to evaluate the strength of image encryption algorithms/ciphers with respect to differential attacks. Conventionally, a high NPCR/UACI score is usually interpreted as a high resistance to differential attacks. However, it is not clear how high NPCR/UACI is such that the image cipher indeed has a high security level. In this paper, we approach this problem by establishing a mathematical model for ideally encrypted images and then derive expectations and variances of NPCR and UACI under this model. Further, these theoretical values are used to form statistical hypothesis NPCR and UACI tests. Critical values of tests are consequently derived and calculated both symbolically and numerically. As a result, the question of whether a given NPCR/UACI score is sufficiently high such that it is not discernible from ideally encrypted images is answered by comparing actual NPCR/UACI scores with corresponding critical values. Experimental results using the NPCR and UACI randomness tests show that many existing image encryption methods are actually not as good as they are purported, although some methods do pass these randomness tests.

857 citations

••

TL;DR: A color image encryption algorithm based on total plain image characteristics (to resist a chosen/known plain image attack), and 1D logistic map with optimized distribution (for fast encryption process) based on Murillo-Escobar?s algorithm confirm that the RGB image encryption is fast and secure against several known attacks.

263 citations

••

TL;DR: A novel symmetrical image encryption algorithm based on skew tent map is proposed, suitable for encryption of any size of image and realizes fast encryption and decryption of both gray-scale image and color image.

109 citations

••

08 May 2006TL;DR: An image encryption scheme is developed that maps a image to a row of pixels and further fit to a same size image using the line map, which is an invertible chaotic two-dimensional map.

Abstract: This paper proposes a new line map, which is an invertible chaotic two-dimensional map. The algorithm of the line map is formulated. An image encryption scheme based on the line map is developed that maps a image to a row of pixels and further fit to a same size image using the line map. The line map is generalized by using some parameters, the numbers of the left and the right line map, which are used as the key. For encryption, several iterative applications are made to a digital image. While for the deciphering process, the inverse of the line map is applied with the same number of iterations. The image encryption and deciphering scheme based on the line map has no information loss. The experimental tests are carried out and the results show the effectiveness of the new scheme.

35 citations

••

01 Sep 2015TL;DR: Through the comparison of the histogram analysis and the analysis of the key, the result has showed that the method can better realize the effect of encryption and decryption.

Abstract: With the rapid development of network and communication technology, digital image communication has become an important way of information transmission. Therefore, much more attention has been paid to the development of the digital image encryption technology. In this paper, we propose a digital image encryption technology based on AES algorithm, and the algorithm implementation in MATLAB. Then, we perform digital image processing, obtain the date that can use the AES encryption algorithm, combine both approaches. Then, the digital image can be encrypted, and the algorithm is realized in MATLAB simulation. Through the comparison of the histogram analysis and the analysis of the key, the result has showed that the method can better realize the effect of encryption and decryption.

34 citations