2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies

A Modified Approach of Key Manipulation in Cryptography using 2D Graphics

Image
Pratik Shrivastava
Department of Computer Science
Oriental College of Technology
Bhopal, India
pratik_shrivastava1@yahoo.in

Retesh Jain
Department of Computer Science
Oriental College of Technology
Bhopal, India
Retesh.jain@gmail.com

Abstract Cryptography is basically securing the data during

the communication between different systems. To provide the
security of data during communication in cryptography we
together require the Algorithm and Key. The confidentiality
and integrity of the data during communication depends
partially on algorithm and partially on key. Due to humanmemorizability the size of key in cryptography is limited.
2Dimension graphics image have the property that by
visualising or by listening its dimension it is not possible to
design exactly the same pattern. In this paper a modified
approach is being proposed for increasing the security of the
data. For increasing the security we are basically concentrating
on the key part of the cryptography we basically uses the
2Dimension graphics image which is designed by the user.
2Dimension Graphics image is composed of pixels in which
each pixel have different or same ASCII value. From the large
collection of pixel the proposed algorithm will generate any
size of key which can be used in encryption as well as in
decryption.

Covering media will hold the original data and it is split ted
throughout the covering media. Secret message is the
original data. Steganography function will perform the
operation of placing the original data in the covering media
and its inverse function will do the reverse operation.
Optional steganography key is optionally required in the
steganography function [1].
Cryptography is also one of the ways to enhance the
security during the communication. Cryptography involves
two techniques Encryption and Decryption. Encryption is
converting the plain text (i.e. understandable format) into
cipher text (i.e. Non understandable format) & Decryption is
converting the cipher text into plain text. To perform the
Encryption and Decryption on data we require two things
one is algorithm and another is key. On Sender side the Plain
text together with key is applied on the algorithm and the
resultant output (i.e. Cipher text) is generated. This Cipher
text is transmitted in the open network to reach at the
receiver side. On the receiver side when the cipher text is
reached than cipher text together with key is again applied in
the algorithm to get the desired output (i.e. Plain text).
Cryptography is applied in different field (i.e. it can used to
encrypt image, audio, video, text)

Keywords- Cryptography, Encrypting, Decrypting, Key,

Human-Memorizability, Confidentiality, Integrity, 2D Graphics
Image, Pixel, Randomization.

I.

INTRODUCTION

In Todays world every business, Government Sector,

Banking Sector, Education System etc is going to be provide
their services online. As these services are going to online
there is a lot of probability that these services are going to be
cracked or hacked by the unauthorized user. So to provide
the integrity, security, confidentiality of services during all
these communication some techniques has been developed.
Among all these parameters security is one of the major
concern in Internet. Among all the techniques one is
Steganography, one is Cryptography and another is hash
function technique.

For generating the cipher text from the plain text the
algorithm performs two processes one is Substitution and
another is Transposition. Substitution is substituting the
original character with some another character and
Transposition is doing the permutation among the original
characters (i.e. it shuffles the position of original character
from their original places) [2].
To enhance the security in cryptography we can either
modify the algorithm or we can modify the key generation
technique. In this paper we have concentrated on the key part
of the cryptography we have proposed one modified
approach of key generation and manipulation technique
using 2D graphics image.2D graphics image have the
property that by simply viewing or listening its dimensions it
is not possible to design the same Graphics image.

Steganography is the way to provide the security by

hiding the original data. In this we basically we use some
another object and in that object we are placing the data of
original object(i.e. we are actually hiding the original data in
the back of images, audio, video, IP Datagram, Plain Text).
For using the steganography technique we required the
following contents. Covering media, secret message,
steganography function and its inverse function, optional
steganography key.

978-1-4799-2102-7/14 $31.00 2014 IEEE

DOI 10.1109/ICESC.2014.40

K.S. Raghuwanshi
Department of Computer Science
Oriental College of Technology
Bhopal, India
drkuldeepraghuwanshi@oriental.ac.in

Digital images are composed of pixels. Each pixel represents

the color (or gray level for black and white photos) at a
single point in the image, so a pixel is like a tiny dot of a
particular color. By measuring the color of an image at a
194

large number of points, we can create a digital approximation

of the image from which a copy of the original can be
reconstructed. A digital image is a rectangular array of pixels
sometimes called a bitmap.

correcting algorithm to directly encrypt and decrypt the

data. In this paper from an iris textural image a ROI (i.e. a
Region of Interest) is defined. This ROI is sufficient to
differentiate between different images. Next this ROI part is
passed through Gabor Filter which is rotated at different
angle to get filtered image this filtered image is divided into
sub-parts and the mean value of each sub-part is calculated.
Due to noise the mean of similar images is different. Then
the normalized iris feature vector is calculated from the
filtered image and by using Add/Subtract operation
encryption and decryption operation is perform [3].

Types of Digital Images For photographic purposes, there

are two important types of digital imagescolor and black
and white. Color images are made up of colored pixels while
black and white images are made of pixels in different
shades of gray.
Black and White Images a is made up of pixels each of
which holds a single number corresponding to the gray level
of the image at a particular location. These gray levels span
the full range from black to white in a series of very fine
steps, normally 256 different grays. Assuming 256 gray
levels, each black and white pixel can be stored in a single
byte (8 bits) of memory.

B. Santhi, K.S. Ravichandran, A.P. Arun and L.

Chakkarapani (2012) proposed a Novel Cryptographic Key
Generation Method Using Image Features. In this paper
encryption and decryption is performed using image feature.
For executing the encryption and decryption GLCM (i.e.
Gray Level Co-Occurrence Matrix) is created from the
image and then the GLCM properties are calculated using
that matrix. Next then feature extraction is done on the basis
of high rank among all the properties from the matrix. From
the feature extracted the key is generated and that key is
used for encryption and decryption is performed [4].

Color Images is made up of pixels each of which holds three

numbers corresponding to the red, green, and blue levels of
the image at a particular location. Red, green, and blue
(sometimes referred to as RGB) are the primary colors for
mixing lightthese so-called additive primary colors are
different from the subtractive primary colors used for mixing
paints (cyan, magenta, and yellow). Any color can be created
by mixing the correct amounts of red, green, and blue light.
Assuming 256 levels for each primary, each color pixel can
be stored in three bytes (24 bits) of memory. This
corresponds to roughly 16.7 million different possible colors.

III.

Binary or Bi-level images use only a single bit to represent

each pixel. Since a bit can only exist in two stateson or off,
every pixel in a binary image must be one of two colors,
usually black or white. This inability to represent
intermediate shades of gray is what limits their usefulness in
dealing with photographic images.
Indexed Color Images are created using a limited palette of
colors, typically 256 different colors. These images are
referred to as indexed color images because the data for each
pixel consists of a palette index indicating which of the
colors in the palette applies to that pixel. There are several
problems with using indexed color to represent photographic
images. First, if the image contains more different colors
than are in the palette, techniques such as dithering must be
applied to represent the missing colors and this degrades the
image. Second, combining two indexed color images that use
different palettes or even retouching part of a single indexed
color image creates problems because of the limited number
of available colors.
II.

PROPOSED METHODOLOGY

In this paper we concentrate on the key part of the

cryptography. In this paper user is provided with an interface
in which user is free to designed any type of pattern, shape,
signature etc. which can be easily remembered by the user.
The designed pattern is of size 1260*800. The designed
pattern constitutes of pixels and each pixel has some color
which is represented by binary value. For example

Figure 1
Figure 1 shows the sample graphics of free design which
can be created by the user according to its creativity.

RELATED WORK

Xiukun Li, Xiangqian Wu*, Ning Qi, Kuanquan

Wang(2008) have proposed A Novel Cryptographic
Algorithm based on Iris Feature which uses iris textural
features, Add/Minus operation and Reed-Solomon error-

Figure 2

195

Figure 2 shows a sample graphics design which can be

also created by the user. This 2D graphics pattern is
manipulated as a Black & White image in which each pixel
is 8 bit. The designed 2D graphics pattern is just used to
generate the key. The Proposed algorithm is used to generate
the key from the image. The proposed algorithm is given
below.
Proposed Algorithm
1.
2.

Read the user created Graphical image.

Read the pixels and shuffle among them there
position (i.e. exchange the 1st pixel value with the
last position pixel value, 2nd pixel value with the
second last position pixel value and soon until we
reached to the centre pixel value).
3. Create a group of pixels (i.e. 64 bits).
4. Shuffle the groups among their position (i.e.
exchange the 1st position group with the last
position group, 2nd position group with the second
last position group and soon until we reached to the
center position).
5. Initiate i=1
6. Declare array to store key in array Result[16].
7. Declare two variables var1 and var2.
8. Store the 1st group value in var1 and 2nd group value
in var2.
9. While i < size of array
a. Perform the XOR operation between var1 and
var2.
b. Store the result of XOR operation in ith block
of array.
c. Store the value of result obtained in var1 and
next group value into var2.
d. Increment the value of variable i and go to step
9.
10. Results obtained from Step9 are applied in each
phase of DES algorithm as independent sub-keys.

Figure 3
Figure 3 shows the flow of how the process is executed. In
the given Figure 3 firstly the user has to design the pattern
the designed pattern can be of any shape and size. After
designing the pattern the designed graphics is saved as an
image in the local file system. After saving the image the
proposed algorithm extract the pixel value from the image
and then the pixel is grouped together to generate the key.
This generated key is used in the encryption algorithm to
convert the plain text into cipher text and when the cipher
text is generated it is send in the network to reach at its
destination place.

The result obtained from the proposed algorithm is

applied in DES algorithm. In DES algorithm user provides
the key and by performing the rotation on the same key we
can generate the different key for each phase of encryption as
well as for decryption. Through this proposed algorithm we
can generate the different set of independent key. This
independent set of keys may be used in different phase of
DES algorithm. By using the above described proposed
algorithm it becomes infeasible to identify the relationship
between the plain text and the generated cipher text.
Through the proposed algorithm it becomes hectic task for
the crypto analyst to attack the code because it is not possible
to design the same 2D graphics pattern by simply viewing or
by listening its dimension. A little change in the pixel value
of the designed 2D graphics may generate the different set of
keys. Below is given the flow diagram of encryption and
decryption algorithm.

Figure 4

196

In the future work we can involve the color in designing

the 2D graphics pattern. In colorful 2D graphics pattern each
pixel will contain the RGB value where each pixel size is 24
bits. Form this color image we can generate the key.

Figure 4 describes when the cipher text is received at the

receiver side then the same image and same proposed
algorithm is used to generate the key and that key is used in
reverse order in the decryption algorithm to convert the
cipher text into plain text so that the actual information is
received by the receiver.
IV.

REFERENCES
[1]

CONCLUSION AND FUTURE WORK

This Paper proposed a modified approach of generating

key using 2D Graphics. In this paper user is free to design
any type of pattern according to his convenience for his
remembrance and from that pattern a 128 bit key is
generated. A little bit change in part of image will generate a
new key value. In the proposed algorithm a different key is
generated for each stage of DES. The same image can be
used for different text encryption.

[2]
[3]
[4]

197

Soumyendu Das, Subhendu Das, Bijoy Bandyopadhyay, and Sugata

Sanyal, L. L. 1993. Steganography and Steganalysis: Different
Approaches.
Atul Kahate, Cryptography and Network Security, 2nd edition,Tata
Mcgraw Hill Education Private Limited, 2011
Xiukun Li, Xiangqian Wu*, Ning Qi, Kuanquan Wang, A Novel
Cryptographic Algorithm based on Iris Feature, 2008.
B. Santhi, K.S. Ravichandran, A.P. Arun and L. Chakkarapani, A
Novel Cryptographic Key Generation Method Using Image Features,
2012.