PROJECT REVIEW

IMAGE ENCRYPTION
Under The Supervision of
Ms Alisha Banga
(Assistant Professor)
Prepared by:
Anukool
20SCSE1010497

1
 School of Computing Science & Engineering

Introduction
• Since the last decade, there has been widespread demand of using computers, internet, and
multimedia applications. The demand of users is not only restricted to text but to share
information on the widespread network i.e., internet, they also use audio, video and images.
• So, with the use of images and video the demand of secure and reliable network has become
a necessity. In present times, images are being transmitted and stored in electronic form, so
there is likelihood that the information present in the image gets modified or altered by the
illegal access.
• As one of the effective protections of image security, digital image encryption has become
the focus .
• In order to enhance the security, many steganography techniques have been developed
which encrypt the secret data before hiding it.
• There are two types of image encryption:
1. Traditional encryption
2. chaos-based
Group No:2 encryption. 3
 School of Computing Science & Engineering
Literature Survey/Project Design
The security of images became a significant goal as the network is growing. The security o
images is an important research field in different trends like data security, secure data
transmission and copyright security. So, Image encryption algorithms and hiding algorithm
should be designed to enhance the effectiveness of transmission and keep safety from attack
by the intruders. So, the proposed method can achieve the highest level of data integrity
confidentiality and security.
In this report, trying to verify the confidentiality of images that makes uses of RC4 stream
cipher and Arnold Cat Map. The objective of using RC4 stream cipher is to improve the
confidentiality to encryption and the objective of Arnold Cat Map is used for confusion .
In general, there are two techniques that can be performed with chaos-based image encryption
confusion and diffusion. [6] Confusion involves shuffling the pixel positions that make up an
image, while diffusion involves changing pixels’ gray values. In encryption, both technique
should be used; the use of just one can reduce the power of the encryption.

P
4 rogram Name: B.Tech Sem: III
 School of Computing Science & Engineering
RIVEST CIPHER 4 (RC4) ALGORITHM

• This algorithm is developed by Ronald Rivest and thus, the name of the algorithm was put
after Ronald’s Rivest.
• It is one of the algorithm which is used for both encryption and decryption as the data
stream is simply XORed with the generated key sequence.
• The key stream is completely independent of the plaintext used. It uses a flexible length
key from 1 to 256 bit to modify a 256-bit state table.
• The state table is used for consequent generation of pseudo-random bits after that to
generate a XORed pseudo-random stream with the plaintext to give the cipher text.
• The algorithm can be divided into two stages:
• First stage is initialization, and other operation.
• In the first stage the 256-bit state table, S is populated, using the key, K as a seed. Once
the state table is setup, it continues to be modified in a regular pattern as data is
encrypted .

Program Name: B.Tech

4 Sem: III
 School of Computing Science & Engineering

Literature Survey
Algorithm 1. Key Scheduling Algorithm (KSA).

INPUT: K [….], m
OUTPUTS: S
1. S[i]=i, for i=0,1, 2, … ,255
2. j 0
3. For i 0 to 255
3.1 j (j + S[i]+K [i mod L]) mod 256
4. Swap S[i] with S[j]
5. Return (s)

P
4 rogram Name: B.Tech Sem: III
 School of Computing Science & Engineering

Literature Survey
Algorithm 2. Pseudo-Random Generation Algorithm (PRGA).
INPUT: State S
OUTPUT: Key sequence Kseq
1. j 0
2. i 0
3. While not end of sequence
3.1. i (i+1) mod 256
3.2. j (j + S[i]) mod 256
3.3. Swap S[i] with S[j]
3.4. Kseq S[(S[i]+ S[j]) mod 256]
4. Return (Kseq)

Program Name: B.tech. Sem: III 4

School of Computing Science & Engineering

Literature Survey

P
4 rogram Name: B.Tech Sem: III
 School of Computing Science & Engineering
(2). Arnold’s Cat Map
Literature Survey
.
• ACM is a chaotic map model that is used to randomize the pixel positions in an image.
• It was first introduced by Vladimir Arnold as a way to shuffle an image of a cat.
Mathematically, this concept works by stretching and distorting a square shape and then
reassembling it into the same shape.
• Since it was introduced, ACM has been intended to randomize the pixel position of an
image so that it does not look the same, which is a confusion technique. ACM works by
scrambling a pixel’s position without changing the value of the pixel itself.
• Although ACM is a chaotic map, if iterations are repeated many times, it is possible that
the original image will be rearranged because the ACM concept relies on position
randomization only.

Program Name: B.tech. Sem: III 4

 School of Computing Science & Engineering
Functionality/ Working Diagram
ER Diagram
Applying KSA and
Key generation Key
PRGA Algorithms

The image matrix and

key are passed to
Arnold’s cat
encryption algorithm

Original Image
Arnold’s Cat
Image Matrix Map
The original Image
is first converted
into a matrix To get Encrypted
Encrypted Image Image

P
4 rogram Name: B.Tech Sem: III
 School of Computing Science & Engineering
Result and Discussion
Image Encryption Testing using Confusion:
In this test, encryption was performed with only confusion, using ACM as the
chaotic map .

FIG 3.

Program Name:B.tech. Sem: III Sem: III 4

School of Computing Science & Engineering

Program Name: B.Tech Sem: III

School of Computing Science & Engineering
 School of Computing Science & Engineering

Conclusion and Future Scope

A cryptography and chaos-based algorithm are proposed to increase security and
authentication of images transmitted in a network environment. The cryptography
technique RC4 has been implemented to generate the keystream for Arnold’s cat map.
For Key generation, RC4 is used as it create sequence of pseudo-random 128-bit
encryption key. Here, a chaotic map is used as it provide good combination of speed,
high security complexity, low computational overheads.
According to tested we found that the system has provide a high security and easy way
to encrypt.
 School of Computing Science & Engineering
References
[1]. Manish Mishra, Shraddha Pandit “Image Encryption Technique Based on Chaotic System and Hash Function”
2014 IEEE International Conference on Computer Communication and Systems (ICCCS '14), Feb 20-21, 2014,
Chennai, INDIA.
[2]. Assist.Lec. May H. Abood “An Efficient Image Cryptography using Hash-LSB Steganography with RC4 and
Pixel Shuffling Encryption Algorithms” Annual Conference on New Trends in Information & Communications
Technology Applications-(NTICT'2017) 7 - 9 March 2017.
[3]. Sara Sajasi, Amir-Masoud Eftekhari-Moghadam “A high quality image hiding scheme based upon Noise Visibility
Function and an optimal chaotic based encryption method”
[4]. Geetanjali N. Narhare, Savita R. Bhosale “DATA HIDING USING RC4 ALGORITHM IN IMAGE FORM”
International Journal of Advanced Technology in Engineering and Science Volume No 03, Special Issue No. 01, April
2015.
[5]. Anak Agung Putri Ratna, *, Frenzel Timothy Surya, Diyanatul Husna, I Ketut Eddy Purnama, Ingrid Nurtanio,
Afif Nurul Hidayati, Mauridhi Hery Purnomo, Supeno Mardi Susiki Nugroho, Reza Fuad Rachmadi “Chaos-Based
Image Encryption Using Arnold’s Cat Map Confusion and Henon Map Diffusion”
[6]. S. Fadhel Hamood, M.S. Mohd Rahim, O. Farook Mohammado, “Chaos image encryption methods: A survey
study,” Bulletin of Electrical Engineering and Informatics, 6(1), 99–104, 2017, doi:10.11591/eei.v6i1.599.
[7]. L. Kocarev, “Chaos-based cryptography: A brief overview,” IEEE Circuits and Systems Magazine, 1(3), 6–21,
2001, doi:10.1109/7384.963463.
 School of Computing Science & Engineeringg

Course Code : XXXXXX Course Name: Data structures using C

THANK YOU
P
4 rogram Name: B.Tech Sem: III