2012, I J ARCSSE All Rights Reserved Page | 285

Volume 2, Issue 10, October 2012 ISSN: 2277 128X

International Journal of Advanced Research in
Computer Science and Software Engineering
Research Paper
Available online at: www.ijarcsse.com
Proposed Method of Cryptographic Key Generation for
Securing Digital Image
Amrita Sahu
*
, Yogesh Bahendwar, Swati Verma, Prateek Verma
Departmentof Electronics & Telecommunication
CSVTU,
Chhattisgarh, India

Praveen Verma
Asst. Manager, NTPC
Chhattisgarh, India

Abstract I n the digital world, security is an important issue, and encryption is one of the ways to ensure security.
This paper presents image encryption/decryption scheme using biometric template (Palm Print). The proposed scheme
is especially useful for encryption of large amounts of data, such as digital images using proposed key generation
algorithm. This scheme satisfies the characters of convenient realization, less computation complexity and good
security. The salient features of the proposed image encryption method are loss-less, asymmetric public key
encryption, a very large number of secret keys, and key-dependent pixel value replacement.[2]
Keywords I mage processing, Biometric, Image encryption and decryption, Palm Print.
I. INTRODUCTION
Security is an important issue in communication and storage of images, and encryption is one the ways to ensure
security. Image encryption has applications in internet communication, multimedia systems, medical imaging,
telemedicine, and military communication. However, Images are different from text. Although we may use the traditional
cryptosystems (such as RSA and DES) to encrypt images directly, it is not a good idea for two reasons. One is that the
image size is almost always greater than that of text [8]. Therefore, traditional cryptosystems need much time to encrypt
the image data. The other problem is that the decrypted text must be equal to the original text. Due to the characteristic of
human perception, a decrypted image containing small distortion is usually acceptable. The main idea behind the present
work is that an image can be viewed as an arrangement of bits, pixels and blocks. The intelligible information that is
present in an image is because of the correlations among the bits, pixels and blocks given in the arrangement [8, 9]. In
order to transmit secret images to other people, a variety of encryption schemes have been proposed. Schemes that we
analyze here can be classified into three major types: position permutation [4, 5], value transformation [1, 2, 3, 6] and
visual transformation [4].
Because of the scheme based on bit wise XOR, it is easily implemented and highly efficient to quickly encrypt
and decrypt image messages. The asymmetric encryption mechanism makes the encrypted data more secure.
The rest of the paper is as follows. Section 2 gives survey of some related image cryptosystems. Section 3 gives
characteristics of an image cryptosystem. Section 4 describes a proposed key generation algorithm and process of
encrypting and then decrypting an input image. Experimental results and conclusions are given in section 5 and section 6,
respectively. The encryption keys in are generated using low-level combination of biometric features and cryptology.
Reliability in computer aided personal authentication is becoming increasingly important in the information-based world,
for effective security system. Biometrics is physiological characteristics of human beings, unique for every individual
that are usually time invariant and easy to acquire. Palm print stable and unique characteristics amongst other biometric
features. It is the rich information of palm print which offers one of the powerful means in personal recognition.
II. RELATED IMAGE CRYPTOSYSTEMS
According to the differences between image and text, recently there have been several innovative encryption techniques:
A Technique for Image Encryption using Digital Signatures
Alok Sinha and Kehar Singh [1] proposed a new technique for encryption an image for secure image transmission. The
digital signature of the original image is then added to the encoded version of the original image. Image encoding is then
done by using an appropriate error control code, such as a Bose- Chaudhuri Hochquenghem (BCH) code. After the
decryption of the image, the digital signature can be used to verify the authenticity of the image at the receiver end.

A. A new Image encryption algorithm based on vector quantization
C-C Chang (2001) [3] proposed a fast image encryption algorithm based on vector quantization (VQ), cryptography and
number theorems. In VQ, the image was first decomposed into vectors and the sequentially encoded vector by vector.
Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 286
Then traditional cryptosystem from commercial applications was used, for enhancing security and reducing the
computational complexity of encryption/decryption, some number theorems were applied. VQ is an efficient approach to
low bit-rate image compression, therefore speeds up the encryption process and achieve high security [12]


B. A New Chaotic Image Encryption Algorithm
Jui-Cheng Yen and Jiun-In Guo [5] proposed a new image encryption scheme based on a chaotic system. In that method,
an unpredictable chaotic sequence is generated. It is used to create a binary sequence again. According to the binary
sequence, an images pixels are rearranged. This algorithm has four steps. Step-1 determines a chaotic system and its
initial point x(0), row size M and column size N of the image f, iteration number no, and constants , ?, and used to
determine the rotation number. Step-2 generates the chaotic sequence from the chaotic system. Step-3 generates the
binary sequence. Step-4 includes special functions to rearrange image pixels.

C. Colour Image Encryption Using Double Random Phase Encoding
Shuqun Zhang and Mohammad A. Karim [6] have proposed a new method to encrypt color images using existing optical
encryption systems for grayscale images. The color images are converted to their indexed image formats before they are
encoded. In the encoding subsystem, image is encoded to stationary white noise with two random phase masks, one in
the input plane and the other in the Fourier plane[13]. At the decryption end, the color images are recovered by
converting the decrypted indexed images back to their RGB (Red-Green- Blue) formats.

D. Visual Cryptography for Colour Images
Visual cryptography uses the characteristics of human vision to decrypt encrypted images. It needs neither cryptography
knowledge nor complex computation. For security concerns, it also ensures that hackers cannot perceive any clues about
a secret image from individual cover images. Young-Chang Hou [7] have proposed three methods for visual
cryptography. All these proposed methods belong to symmetric key cryptosystem, they are vulnerable in case they
employ the unique key in their proposed system (Jinn- Ke Jan, 1996). Here, we propose a novel asymmetric image
encryption scheme. Using certain matrix transformation to create a novel asymmetric block encryption scheme, all the
pixels and frequencies in each block of the original image are scrambled. Our method can achieve the following two
goals. One is that it is easily implemented and highly efficient to quickly encrypt and decrypt image messages based on
matrix transformation. The other is that asymmetric encryption mechanism makes the encrypted data more secure.

III. CHARACTERISTICS OF AN IMAGE CRYPTOSYSTEM
For studying image encryption, we must first analyze the implementing differences between image and text data:
1) When cipher text is produced, the decrypted text must be equal to the original text in a full lossless manner. This
requirement is not necessary for image, the cipher image can be decrypted to a original image in some lossy
manner.
2) Text data is a sequence of words, it which can be encrypted directly by using block or stream ciphers. However,
digital image data are represented as 2D array.
3) Since the storage space of a picture is very large, it is inefficient to encrypt or decrypt image directly. One of the
best methods is to only encrypt/decrypt information that is used by image compression for reducing both its
storage space and transmission time.
For privacy, an unauthorized user can not disclose a message. For integrity, an unauthorized user can not modify or
corrupt a message. For availability, message is made available to authorized users faithfully. A perfect image
cryptosystem is flexible in the security mechanism, has high overall secure performance, the image security requires
following characteristics [8]:
1) The encryption system in use should be computationally secure. It requires a extremely long time to attack,
unauthorized user should not be able to read privileged image.
2) Encryption and decryption should be fast enough not to grade system performance. The algorithm for
encryption and decryption must be simple enough to be done by user in personal computer.
3) The security mechanism must be as widespread as possible.
4) The security mechanism should also be flexible.
5) There should not be a large expansion of encrypted image data.
IV. PROPOSED KEY GENERATION ALGORITHM

1) A palm image is taken and divided into n number of pixels such that each pixel possesses 24 bit size.
2) Based on the RGB component, pixels binary value is calculated.
3) Now binary to decimal conversion occurs.
4) Here we have decimal value of each pixel
5) Then we group the pixels such that all group consists of equal numbers of pixels
6) Rms value of each group is calculated.
7) Again grouping of above calculated rms value is done whose rms value is calculated.
Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 287
8) We repeat the process of grouping and calculating rms value until we get the rms value of 5-10 pixels. For
example if we have number of 1000 pixels in an image then after calculating its decimal value followed by
binary value, we group pixels in 100 numbers, each group consisting of 10 pixels. It means we have 100 groups
of pixels. Of each group we calculate the rms and so here we have 100 rms values. Now again we group 100
rms values into 10 groups each group consisting of 10 pixels whose rms value is calculated.
9) Calculated rms vaue is converted into ASCII format(string of characters) which is called as password or key
value.
The objective of Biometric Encryption algorithm is to provide a mechanism for the linking and subsequent retrieval of a
digital key using biometric such as palm print. This digital key can then used as cryptography key.

A. Encryption
Step1: Taking a matrix of input image as A.
Step2: Taking the matrix of palmprint to be used for encryption as B which is retrieved from the generated
encryption key.
Step3: Calculating bit XOR of A and B.
Step4: Resultant matrix C is the encrypted image.
Saving the encrypted image as bmp file.

B. Decryption
Step1: Taking the matrix of palmprint to be used for decryption as D
Step 2: Calculating bit XOR of C and D.
Step 3: Resultant matrix E is the decrypted image.
Saving the decrypted image as bmp file.

V. EXPERIMENTAL RESULT


Figure 5.1: Layout of Proposed System

Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 288




Figure 5.2: Taking Input Image



Figure 5.3: Input Image for Encryption



Figure 5.4: Generating Key Using Palm Print for Encryption

Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 289


Figure 5.5: Generated Key



Figure 5.6: Encrypted Image



Figure 5.7: Encrypted Image For Decryption
Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 290

Figure 5.8: Generated Key For Decryption


Figure 5.9: Decrypted Image

VI. CONCLUSION & FUTURE SCOPE

In this paper, we proposed a new key generation algorithm based on palm print which is used for encryption and
decryption of an image. Our scheme allows one party to send a secret image to another party over the open network, even
if many eavesdroppers listen. Therefore, we can use our scheme in many applications. Our scheme gives reliable security
[11]. We presented an image encryption/decryption scheme based on bitXOR method in this paper. The salient features
of the proposed asymmetric image encryption scheme can be summarized as: (a) Lossless encryption of image. (b) Less
computational complexity. (c) Convenient realization. (d) Choosing a suitable size of matrix according to the size of
image. (e)Encryption/decryption scheme uses integer arithmetic and logic operations. It requires minimized
computational resources [7].We can implement this type of system in various fields like in Military, Defence, and other
places where the confidentially of data should be must.



Figure 6.1: Application in Military

Amrita et al., I nternational J ournal of Advanced Research in Computer Science and Software Engineering 2 (10),
October- 2012, pp. 285-291
2012, I J ARCSSE All Rights Reserved Page | 291
REFERENCES

[1]. Cancellable biometrics, Information Processing Letters, vol. 93, no. 1, pp. 1-5, 2005.
[2]. C.-S. Laih, and K. Y. Chen, "Generating visible RSA public keys for PKI", International Journal of Information
Security, Vol. 2, No. 2, Springer-Verlag, Berlin, 2004, pp. 103- 109.
[3]. X.Y. Jing and D. Zhang, A face and palmprint recognition approach based on discriminant DCT feature
extraction, IEEE Transactions, vol. 34, no. 6, pp. 2405-2415, 2004.
[4]. X. Wu, D. Zhang, K. Wang, Palmprint classification using principal lines, Pattern Recognition, vol. 37, no. 10,
pp. 1987-1998, 2004.
[5]. C. Poon, and H.C. Shen, Personal identification and verification: fusion of palmprint representations,
Proceedings of International Conference on Biometric Authentication, pp. 782-788, 2004.
[6]. F. Li, M.K.H. Leung and X. Yu, Palmprint identification using Hausdorff distance, in Proceedings of
International Workshop on Biomedical Circuits and Systems, pp. S3/3-S5-8, 2004.
[7]. A. Okatan, C. Akpolat and G. Albayrak, Palmprint verification by using cosine vector, IJSIT Lecture Note of
International Conference on Intelligent Knowledge Systems, vol. 1, no. 1, pp. 111-113, 2004.
[8]. S. Ribaric and N. Pavesic, Multimodal biometric user-identification system for network-based applications,
IEEE Proceedings, 2003, 1-6.
[9]. MS, "Public Key Cryptography-Applications Algorithms and Mathematical Explanations", Tata Elxsi Ltd, 2007.
[10]. C. Chan, and Y. Wu, "A Visual Information Encryption Scheme Based on Visual Cryptography and D-H Key
Agreement Scheme", International Journal of Computer Science and Network Security, Vol. 8, No. 4, 2008, pp.
128-132.
[11]. W. Stallings, Cryptography and Network Security-Principles and Practices, Prentice Hall, Inc, 4th Ed., (2006).
[12]. F. Yan, B. Ma, Q.X. Wang, D. Yao, C. Fang and X. Zhou, Information fusion of biometrics based-on
fingerprint, hand-geometry and palm-print in Proceeding of IEEE Workshop on Automatic Identification
Advanced Technologies, pp. 7-8, no. 247-252, 2007.
[13]. T. Connie, A. Teoh, M. Goh and D. Ngo, PalmHashing: a novel approach for Processing, vol. 150, no. 6, pp.
409-416, 2003.