www.ijcrt.

org © 2022 IJCRT | Volume 10, Issue 6 June 2022 | ISSN: 2320-2882

IMAGE ENCRYPTION USING COMBINED

CHAOS AND MEMORY CELLULAR
AUTOMATA
Rathika A 1, Sibi Pranav K2, Sanjaay J3, Soundararajan R4, Vishnu Priyan.R5
Assistant Professor, Department of C.S.E, Jansons Institute of Technology, Coimbatore, India 1
UG Students, Department of C.S.E, Jansons Institute of Technology, Coimbatore, India 2 - 5

Abstract:

In this paper, a novel image encryption system is proposed based on a portable mobile automata (RCA) system that incorporates
chaos. In this algorithm, an integrated mapping system with complex behaviors and periodically reversible mobile automata is
used. We divide each pixel of an image into 4-bit units, and then take the pseudorandom key distribution generated by the
integrated layout map to allow these units in the confusion phase. And in the distribution phase, the two-dimensional reversible
mobile automata which are different flexible systems are used to repeat multiple rounds to achieve a smaller distribution, when
we consider only the top 4 bits per pixel because the top 4 bits hold almost image information. Theoretical analysis and test
results show that the proposed algorithm achieves a high level of security and considers effective performance against common
attacks such as distinct attacks and statistical attacks. This algorithm belongs to the systematic system.

I. INTRODUCTION

With the advent of the internet, information security is sequences. Moreover, the mobile automata converts by
gaining more attention. Usually encryption can logical calculation only, by pseudorandom. And complex
besuccessfully protect human information that is broadcast behavior. Cellular automata are also used in symmetric
on social media. But traditional encryption methods have cipher and public cipher. A public cipher based on mobile
limitations on image encryption such as low efficiency, automata was first proposed by Guan, a stream cellular
large data, and high correlation between pixels and so on. automata stream cipher was proposed by Wolfram. Later,
Chaos, which is a complex indirect system, has flexible many experts proposed encryption algorithms based on
structures suitable for encryption as high sensitivity in initial mobile automata. In the authors use reversible mobile
values and system parameters, uncertainty, randomization automata to use block chain encryption algorithm. In our
and periodicity. So chaos theory used in terms of work, we use your strongpoint for both chaos and mobile
cryptosystems. Over the past decade, more and more automata to design a new image encryption algorithm. All
researchers have proposed multiple encryption schemes in operations are performed at bit-level. In approving on stage,
chaos, many of which are crucifixion. Image encryption is we use a pseudorandom sequence generated by a chaotic
usually divided into two sub-sections, the confusing and map to shuffle the units that make up each pixel. And
diffuse phase. In the confusion phase, image pixels are converts pixel values without permission. In the distribution
allowed using the same conversion method baking map, phase, the reversible mobile automata is accepted for
magic square, Arnold map-based, while pixel values remain duplication in pixel bits many rounds instead of pixels. The
unchanged. The distribution phase in particular masks each benefits of mobile automata in encryption are listed below:
pixel after consecutive approval. In this paper, we combine (1) Extreme evolution dominates the environment.
cellular automata (CA) with chaos to suggest a new image (2) Mobile automata contain only complete statistics or
encryption. The default for cell phones is highly compatible logical functions, making calculations easy.
and distributed systems can mimic complex behaviors. A (3) Cellular automata also exhibits complex behavior, and
large number of CA rules enable it many ways to produce are consistent.
IJCRT22A6694 International Journal of Creative Research Thoughts (IJCRT) www.ijcrt.org f639
www.ijcrt.org © 2022 IJCRT | Volume 10, Issue 6 June 2022 | ISSN: 2320-2882

The paper is arranged as follows. In the next section, we creating random random sequence -cipher as output. The
give a brief overview of the combined map and description flexible nature of the turmoil system parameters will extend
of the RCA we have used and algorithm. In Step 3, the the system time and solve problems related to the different
encryption algorithm is presented in detail. Section 4 turmoil system cycle. The test results of the system used
provides an analysis of the theory and implications of showed increased durability and high key sensitivity .The
imitation. The last section concludes with a paper. algorithm showed high security.
Keywords:
Literature Review:- RCA,Encryption
Photo encryption is done using low-level permission and
high-resolution mapping. The blank image is converted (M Methodology:-
x N) to a gray scale image (M x 3N) and converts the gray In this section, we explain in detail your proposed scheme
image to 8-bit identical members per pixel and the image for both encryption and decryption. The encryption /
size is converted to (M x 24N). The lines and columns of decryption system includes a series of outstanding
the image agree on a small scale and move the map to cryptographic strategies including MCA, hash functions,
produce a series of interactive dynamic maps divided into complex systems, and random variables. The hash function
sections and arrange the two identical members in an is used in the proposed scheme to obtain a unique original
ascending order to obtain an approved image. After image signature. The hash value associated with the first
approval the image is converted to a color image. The Chen image is used for the acquisition of system parameters and
system is used to confuse and distribute the color keys required for different encryption / encryption phases.
components in a photo at the same time. Generate three Generation details of these keys are also discussed in this
decimal sequences by finding random numbers through the section. In our algorithm, SHA-256 is used, a custom
Chen system. Exclusive OR operation (XOR) is a sequential cryptographic hash function that generates a 256-bit hash
image that is produced gradually. Repeat the Chen process value. Initially, a hash unit of character value is produced,
until all features are encrypted. The encryption process is and its first 212 bits are divided into four strands of unequal
the opposite of the encryption process. The first encryption length in terms of (8) - (11). These lowercase letters are then
process separates the embedded color image from the red, converted to their corresponding decimal values, h1−52,
green, and blue images and then scans the pixels from row h53−106, h107−158, and h159−212. The system parameters
to column and in addition produces three decimals with the and the seed of (7) are obtained using these decimal
same initial values and parameters used for encryption. numbers as follows
Answer algorithm level bit algorithm by PWLCM program. x 0 0 = 1 2 (x0 + h1−52),
The system used showed that encryption was achieved on a α 0 0 = 1 2 (α0 + h53−106),
large scale using security analysis and test results. All types x 0 1 = 1 2 (x1 + h107−158),
of attacks can be prevented from being large enough using α 0 1 = 1 2 (α1 + h159−212),
the key space used. Implementation of the chaos based Where x0, α0, x1, and α1 are the first secret key and hi − j
cryptographic system to protect the contents of transmitted indicates the decimation of a small series that takes from i
images. The proposed system consists of a separating layer the to j the hash value.
built using a binary matrix size 32 by 32. The partition layer
is followed by a thin layer of permutation that uses pieces to
shuffle 5 pixels of abnormal image pixels. method by which
byte permission is used. The bit permutation layer is made
up of a modified 2-D cat map that improved performance on
a standard 2-D cat map. Advantages of using a 2-D
modified cat map for efficiency in use, intelligence and
arithmetic operation, the process involved in permitting and
a small number of lock cycles. It therefore helps to spread
the effect of one bit over the other. The system incorporates
the same turbulent generation of random and indirect
A. Important Generation
random sequence adjustment control parameters during the
The deferred MCA of the k the system requires k - 1 rules
entire encryption cycle and the writing process. The results
of change and k pre-configuration in order to achieve the
obtained and the security analysis showed that the system
following configuration. As we use the MCA for the fourth
requires a single authorization cycle to provide sensitivity to
order, three rules of change are required for the operation of
one small change in the blank text and secret key and also
the MCA. These rules are defined using a set of small keys
the system prevents image from various types of attacks and
generated by the system parameters tested using. The
is suitable for hardware use. Implementation of a riot-based
detailed process is described as follows. Keys use a logistic
encrypted encryption system that uses perceptron to detect
sine map. The deferred MCA of the fourth program requires
encrypted output to withstand security threats and attacks.
three rules of current configuration to obtain the following
The high-intensity chaotic system produces three different
configuration. The rules of change are defined using a set of
random sequence sets from two standard .The perceptron is
small keys generated by the operation of the MCA using the
a single-layer network feed that can change its weight
dynamically with the help of a high-level random system by control 𝑌0 ′ control and 𝑋0 ′ seeds. First repeat the sine
IJCRT22A6694 International Journal of Creative Research Thoughts (IJCRT) www.ijcrt.org f640
www.ijcrt.org © 2022 IJCRT | Volume 10, Issue 6 June 2022 | ISSN: 2320-2882

logistic sine map (𝑙) at 𝑙 ≥ 500 to avoid the temporary effect

using 𝑌0 ′ 𝑎𝑛𝑑𝑋0 ′, then repeat 48 times to get the e
sequence. Map e [0,1] to [0,255] using the formula given
below showing the sequence of n. 𝒏 = (𝒆 + 𝟏𝟎𝟏𝟓) 𝒎𝒐𝒅𝟐𝟓
384 bits and these bits are divided into three smaller series
equals and used as rules of change to make the MCA. Next
128 bits where 𝐾 = [𝐾1, 𝐾2, 𝐾3]
B. The Encryption Process
At this stage the process that follows the steps of the
proposed encryption process, shown in Fig. 4, described in
detail. The whole process is made up of three stages in one
round. First, the turbulent matrix M × N is generated using
(7), M and N are the lines and columns of the first image.
This matrix is then mapped to the right distance and slightly Novelty of the Work:-
clever XOR with the first image. The resulting image is then Information security plays an important role when
approved by pixel intelligence. Finally, the MCA for the confidential information is shared between two or more
fourth reversed order is applied to the approved image, parties. Stunning maps are used to deal with security issues.
which displays the encrypted image. Bit-Wise Chaotic The current task is to compile a variety of dynamic maps to
Diffusion: The first image is a little clever with XORed with provide chaotic behavior between images. Conflict systems
a chaotic matrix. Pixel-Wise Random Permutation: In this are widely used in image encryption because their initial
step, a clever random pixel conversion where your pixels conditions and control parameters are sensitive to the
are allowed using PRNG. The pixel positions are updated environment. The proposed encryption system incorporates
according to the random sequence w obtained using the a fourth-order mobile automata and diffusion-complication
Algorithm. architecture. The blocks resulting from this decay strategy
are considered to be the initial configuration of the MCA
and an integrated chaos system is used to obtain
transformation rules. Test and result analysis shows that the
encryption is strong enough to survive all types of attacks
while maintaining low complexity.

Recommendation of the department:

Nowadays, with the rapid emergence of the Internet in the
digital world, the security of digital photography is
becoming more important than ever. Many different
methods of encryption have been suggested. Due to the
other natural features of the image one needs to improve the
C. The Crucifixion Process tension in each image encrypted to provide high quality
In order to properly restore the original image, a total of six encryption. Factors such as high entropy or low pixel
parameters must be transferred to the encryption side. These correlation are measures of interest in image encryption.
parameters include the seeds and system parameters of the
LS map (cf. x0, α0, x1, and α1), the PRNG seed (cf. sd), and Reference:-
the 256-bit hash value of the first image. The encryption
removal process, shown in Fig. 5, performed in the order of 1. Liu, H., & Wang, X. (2011). Color image encryption using
the encryption process. The C-shaped image can be found as spatial bit-level permutation and high-dimension chaotic
system. Optics Communications, 284(16- 17), 3895-3903.
2. Beniani, R., &Faraoun, K. M. (2018). A Mixed Chaotic-
cellular Automata Based Encryption Scheme for
Compressed Jpeg Images. JMPT, 9
3. 88-101. [3] Seredynski, M., &Bouvry, P. (2004, October).
Block encryption using reversible cellular automata. In
International Conference on Cellular Automata (pp. 785-
792). Springer, Berlin, Heidelberg.
4. Chen, R. J., & Lai, J. L. (2007). Image security system
Where D is the decrypted image
using recursive cellular automata substitution. Pattern
Recognition, 40
5. 1621-1631. [5] Wang, X. Y., Yang, L., Liu, R., &Kadir, A.
(2010). A chaotic image encryption algorithm based on
perceptron model. Nonlinear Dynamics, 62(3), 615- 621.
6. Souyah, A., &Faraoun, K. M. (2016). Fast and efficient
randomized encryption scheme for digital images based on
IJCRT22A6694 International Journal of Creative Research Thoughts (IJCRT) www.ijcrt.org f641
 www.ijcrt.org © 2022 IJCRT | Volume 10, Issue 6 June 2022 | ISSN: 2320-2882

quadtree decomposition and reversible memory cellular 9. Bakhshandeh, A., &Eslami, Z. (2013). An authenticated
automata. Nonlinear Dynamics, 84(2), 715-732. image encryption scheme based on chaotic maps and
7. El Assad, S., &Farajallah, M. (2016). A new chaos-based memory cellular automata. Optics and Lasers in
image encryption system. Signal Processing: Image Engineering, 51(6), 665-673.
Communication, 41, 144-157. 10. Zhang, Y., & Xiao, D. (2014). An image encryption scheme
8. Tralic, D., &Grgic, S. (2016). Robust Image Encryption based on rotation matrix bit-level permutation and block
Based on Balanced Cellular Automaton and Pixel diffusion. Communications in Nonlinear Science and
Separation. Radioengineering, 25(3), 549. Numerical Simulation, 19(1), 74-82. 27.

IJCRT22A6694 International Journal of Creative Research Thoughts (IJCRT) www.ijcrt.org f642