Chaotic Image Encryption

Using Logistic Map

PRESENTED BY :Basil Biju

GROUP NO: 20

PROJECT TOPIC: FPGA Based Secure Image Compression

PROJECT GUIDE 1: DR.Abhilash Antony

PROJECT GUIDE 2: Ms.Divya Rs

29-11-2023 S7/ECE/MITS/ECQ413/BATCH2020/ROLL.NO.33
Contents
1. Introduction
2. What is Image Encryption?
3. What is chaotic Image Encryption?
4. Logistic map
4.a. Key Generation Process for Logistic Map
5.Processes in Chaotic image encryption
5.a Permuration
5.b.combination
5.c.Benefits of Permutation and Substitution in chaotic image encryption
6.Test for Security
6.a.Histogram
6.b.Correlation
7. Conclusion

05-12-.histogram2023 S7/ECE/MITS/ECQ413/BATCH2020/ROLL.NO.33
1.Introduction
In the rapidly evolving field of digital security, protecting
sensitive information has become increasingly crucial. As we
enter an era where data breaches and cyber threats are
omnipresent, traditional encryption methods are being
scrutinized for their robustness and efficiency. One promising
approach that has garnered attention is chaotic image
encryption, a technique that leverages the inherent
unpredictability of chaotic systems to safeguard digital
content.

05-12-2023 S7/ECE/MITS/ECQ413/BATCH2020/ROLL.NO.33
2.What is Image Encryption
Image encryption is a
technique used to protect
image data by converting it
into a format that is
unreadable without a
decryption key. This ensures
that only authorized users or
systems can access the
content of the image. The
core goal of image encryption
is to secure sensitive visual
information [1]
[https://medium.com]
 3.Chaotic Image Encryption
• Chaotic System:A chaotic system is a type of system where small changes at the
beginning can lead to big differences later on. Even though the system follows
clear rules (it’s not random), the results can seem unpredictable because tiny
differences in how it starts can grow quickly into huge changes. So, even if you
know the rules, it’s hard to predict exactly what will happen because of how
sensitive the system is to small changes at the start.
• for chaotic image encryption we make use of chaotic maps,one such map is
logistic map
https://sipi.usc.edu/database/
 Logistic Map
The logistic map is a mathematical equation defined
as:Xn+1 =Xn*r*(1-Xn)
-Xn is a number between 0 and 1.

-r is a parameter (usually between 3.57 and 4) that

controls how chaotic is.
-The output Xn+1 depends on both the current value Xn
and r
https://ieeexplore.ieee.org/

[2]
 Key Generation Process for Logistic
Map Xn+1 =Xn*r*(1-Xn)
 Initial
Values: You start by choosing an initial value, X0 , and a value for the
parameter r .These values act as the secret key
 Generate Chaotic Sequence: Using the logistic map equation, you iterate it
multiple times, starting from X0 .Each iteration gives you a new number

chaotic nature of the logistic map, even a tiny change in X0 or 𝑟will result in
X1 ,X2 ,X3 ,X4 ..........which forms a chaotic sequence. Because of the

a completely different sequence.

 Key Stream: This sequence of numbers can be used to generate a key stream,
which is a series of values that will be combined with the image data (usually
by XOR operations) to scramble or encrypt it.
r =µ
Processes in Chaotic image
encryption
(a)Permuration:
1.Normalize the Sequence:

Convert each chaotic number into an integer by scaling it to the image size. For an image of size M×N,
each x i is multiplied by the image size(M×N) giving a sequence of integers that correspond to pixel
position

2.Permute Pixel Positions:

The chaotic sequence is used to shuffle the pixel positions. For example, the pixel at position
P(i,j) in the original image is moved to a new position based on the chaotic sequence. This breaks the
spatial relationship between neighboring pixels, making it difficult for an attacker to find patterns in the
encrypted image.
 Example of permutation
Assume Using the logistic map equation
we get x1= 0.6789 .
Now we scale this value to the image
size .we assume that image size is
100×100=10000.
Then we multiply image size and x1 ie
0.6789×10000=6789 which is the new
integer pixel position.
So the pixel at position 1 might get
moved to position 6789 and so on. This
process carries for x2,x3.....
(b)Substitution
Substitution is about modifying the pixel values of the image.For a grayscale
image (which we'll use in this example), each pixel's intensity is a number
between 0 and 255.
• 1, we use the logistic map to generate a sequence of chaotic numbers.say
x1=0.6543,x2=0.1234,x3=0.7891,x4=0.9998...
• 2,Now, to scale these numbers to the range 0 to 255, we multiply them by
255
chaotic value 1=0.6543×255=166
chaotic value 2=0.7891×255=201
 chaotic value 3=0.1234×255=31
chaotic value 4=0.9998×255=254
Next, we modify the intensity of each pixel in the image using the
chaotic sequence
• Next, we modify the intensity of each pixel in the image using the chaotic
sequence this can be done using XOR (bitwise operation)
• let’s assume the first 4 pixel values in the original grayscale image are:
[120,80,200,50]
• applying XOR on each pixel with its corresponding chaotic value.
120 ⊕166=222
80⊕201=153
200⊕31=215
50⊕254=204
• After applying the XOR operation, the modified (encrypted) pixel values
are:
• [222,153,215,204]
https://ieeexplore.ieee.org/
Benefits of Permutation and Substitution
in chaotic image encryption
1. When permutation and substitution are applied together, a small change in the original
image (like changing one pixel) can cause both pixel positions and values to change
drastically in the encrypted image, making the encryption even stronger.
2. The combination of permutation (which scrambles positions) and substitution (which
modifies values) increases robustness against a variety of attacks, including:
• Brute force attacks: The randomness introduced by chaos makes it infeasible to
guess the key.
• Statistical attacks: Since pixel values and positions are both modified, it's difficult for
attackers to use statistical analysis to identify patterns in the encrypted image.
• Known-plaintext attacks: Even if some parts of the original image are known, the
combined transformation from permutation and substitution makes it hard to
reverse-engineer the encryption process.
 Histogram Analysis
• A histogram displays the distribution of pixel
intensities in an image. For grayscale images, it
shows how often each intensity value (0 to 255)
appears. In unencrypted images, patterns emerge
based on content. An effective encryption
algorithm creates a uniform histogram, indicating
random pixel distribution. This uniformity
prevents attackers from extracting information
from the encrypted image.
• Original Histogram: Peaks and valleys are visible,
showing that certain pixel intensities dominate,
such as light or dark areas in the image.
• Encrypted Image Histogram: The distribution
becomes flat and uniform, indicating that the
pixel intensities are now evenly spread across all
possible values, which is a good indication of
encryption strength.
(https //dergipark.org.tr/tr/pub/spcd
 Test for Security - Correlation
• Correlation is the measure ofsimilarity between adjacent pixels whether they be
horizontal, vertical,or diagnol
if correlation is repreasented by , r =

Covariance If positive, they tend to increase together; if negative, one

increases while the other decreases.

variance It measures the spread or variability of X or Y

around its mean.
• Highly correlated variables have correlation close to 1
• Un correlated variables have correlation close to 0
• Negative correlated variables have correlation close to -1
https://sipi.usc.edu/database/
Conclusion
• Chaotic image encryption using the Logistic Map is an effective method for
securing digital images.
• It results in an unpredictable encrypted image that is resistant to
cryptographic attacks.
• Analysis shows the method reduces pixel correlation
• High sensitivity to initial parameters ensures that small changes in the key
lead to significantly different encryption outcomes.
• The Logistic Map's simplicity and computational efficiency make it suitable
for real-time applications.
• Overall, this method provides a robust and lightweight solution for protecting
digital images, balancing encryption complexity with efficiency.
References
1] E. Yavuz, “A novel chaotic image encryption algorithm based
on content-sensitive dynamic function switching scheme,”
Optics & Laser Technology, vol. 114, pp. 224–239, 2019.

[2] Z. Bashir, T. Rashid, and S. Zafar, “Hyperchaotic dynamical

system based image encryption scheme with time-varying
delays,” Pacifc Science Review A:Natural Science and Engineering, vol. 18, no. 3,
pp. 254–260, 2016.
[

3] Z. Bashir, J. Wa˛tro´bski, T. Rashid, S. Zafar, and W. Sałabun,

“Chaotic dynamical state variables selection procedure based
image encryption scheme,” Symmetry, vol. 9, no. 12, p. 312, 2017.

05-12-2023 S7/ECE/MITS/ECQ413/BATCH2020/ROLL.NO.33
[5]Toughi, M. H. Fathi, and Y. A. Sekhavat, “An image encryption scheme based on elliptic
curve pseudo random and
advanced encryption system,” Signal Processing, vol. 141,
pp. 217–227, 2017.
[6] L. Y. Zhang, Y. Liu, F. Pareschi et al., “On the security of a class of
difusion mechanisms for image encryption,” IEEE Transactions
on Cybernetics, vol. 48, no. 4, pp. 1163–1175, 2018.
[7] S. Amina and F. K. Mohamed, “An efcient and secure chaotic
cipher algorithm for image content preservation,” Communications in Nonlinear Science and
Numerical