International Journal of Research Publication and Reviews, Vol 5, no 6, pp 587-594 June 2024 International Journal of Research Publication and Reviews Journal homepage: www.ijrpr.com ISSN 2582-7421 Enhancing Image Security using Henon and Tinkerbell Map Umber Bashir 1 , Nasir Siddiqui 1 , Saba Inam 2 , Shamsa Kanwal 2 1 Department of Mathematical Sciences, University of Engineering and Technology Taxila, Pakistan 2 Department of Mathematical Sciences, Fatima Jinnah Women University, The Mall, Rawalpindi * Email: saba.inam@fjwu.edu.pk DOI: https://doi.org/10.55248/gengpi.5.0624.1417 A B S T R A C T With the latest developments in technology, data security has become a more critical concern. One of the most important tools for protecting data during transmission from unauthorised access is encryption. Encryption protects a wide range of sensitive data against breaches, including financial transactions and email correspondence. This contains data in a range of types, including text, pictures, audio, and video. In this paper, we suggest a new method that incorporates chaotic maps: Henon map and the Tinkerbell map, in particular into the colour RGB picture encryption procedure. Our solution, in contrast to conventional approaches, makes use of the Hill cipher algorithm using a matrix key made up of several colour key codes. Careful consideration goes into choosing these key codes in order to improve security. Using chaotic maps, we produce numerical sequences that fill the Hill key matrix. These sequences are inherently unpredictable, which makes them difficult to interpret. In order to verify the efficacy of our suggested solution, we ran MATLAB simulations. A test picture was successfully encrypted and decrypted using our methods, demonstrating the reliability and effectiveness of our approach in practical settings. Keywords: Henon map, Tinkerbell map, Histogram, Entropy, Correlation 1. INTRODUCTION Digital data traffic has been expanding quickly in harmful transmission lines in recent years. For a variety of reasons, including integrity and secrecy, the security of digital data, and particularly digital picture protection, is becoming more crucial [1]. Thus, encryption is the most often used solution to security issues. In the study of dynamic nonlinear systems, chaotic maps are common. Mathematical formulae control its behaviour; even a small shift in the starting point can produce a noticeably different result. Although it may look random and chaotic, it really follows some patterns [2]. In a cryptosystem, chaotic output signals—which have unpredictable statistical characteristics—are employed for the purposes of diffusion and confusion. Shannon [3] claims that there are two primary categories into which an encryption system's fundamental approaches may be divided: confusion and diffusion. Additionally, it is feasible to combine the two classes. Because chaos and cryptography are closely related, various research based on chaotic systems have been realised in the last few years. The pseudo-randomness, ergodicity, and sensitivity to beginning circumstances of the chaotic system- based approach assure its security [4]. The authors of [5] provide a single chaotic map and bit-level permutation as the foundation for a pure picture permutation technique. In [6], an Arnold cat map and chaotic sequence sorting are used to suggest a two-stage bit-level permutation method. The permutation-only encryption techniques are susceptible to several strong attacks, though. Li et al. suggested in [7] the quantifiable cryptoanalysis of a permutation-only cypher against a known or chosen plain-text attack. For the diffusion-only image cypher, Zhu [8] suggested a hyperchaotic sequences-based picture encryption method requiring just two rounds of diffusion operation. But when Li et al. [9] reevaluated [10's security, they found that it may be vulnerable to a single known plain- image compromise. Mohamed et al. [11] have developed a novel approach for confusion and diffusion that use a skew tenet map. The method involves dividing the plain picture into sectors, each with a size of 1×256 pixels. The MSE and PSNR indicate satisfactory results after encryption. In conclusion,[12] proposed a novel approach to picture encryption in which she creates a new chaotic An acceptable chaos-based picture encryption technique should include two steps, as suggested by Fridrich in [12].the first stage involves using chaotic map(s) to permute the order of the image pixels, and the second stage involves using chaotic map(s) to change the numerical values that represent each pixel's colour. Many of the current chaos-based picture encryption techniques are built upon these two phases, which are also known as the confusion phase and the diffusion phase [13]. Both Fridrich's chaotic picture encryption system and other image encryption methods with a similar structure, such Chen et al.'s image encryption algorithm [14], were cryptanalyzed in [12]. There have been other encryption methods proposed that resemble Fridrich's. In this article, we offer a key generator and a chaotic picture encryption technique. The last phase will employ the 3-D Tinkerbell map, and the resulting key may be used as a starting condition for the 2-D Henon map. In the encryption/decryption process, the suggested method uses m and n given an input