International Journal of Electrical & Electronics Engineering

16
www.ijeee-apm.com

depicted in Fig. 2. The image is first compressed (if needed). Afterwards the algorithm only encrypts part of the
bitstream with a well-proven ciphering technique; incidentally a message (a watermark) can be added during this
process. To guarantee a full compatibility with any decoder, the bitstream should only be altered at places where it
does not compromise the compliance to the original format. This principle is sometimes referred to as format
compliance. WEN et al. [] have recently described a general framework for format-compliant encryption.
Fig. 2: Selective encryption mechanism.
A.

Input Image
The simplest way to hide binary data on an image is to use a lossless image format (such as a Bitmap) and replace
the least significant bits of each pixel in scan lines across the image with the binary data. This is not secure as an
attacker can simply repeat the process to quickly recover the hidden info
rmation. This technique, known here as BlindHide
because of the way it blindly hides information, is also not good at hiding

the initial portion of the image is left degraded while the rest remains untouched. The proposed project work
consist of mainly two algorithms which are (i) Steganography using Genetic Algorithm (ii) Visual Cryptography
with Threshold. The application initiates with Steganography module where the cover image will be encrypted to
generate Stego image. The stagographic image generated in this module will act as an input for visual cryptographic
module. Algorithm: Steganography Input: Cover Image Output: Stego Image 1)

Read the cover image. 2)

Find out the pixel values of cover image. 3)

Read the secret data character wise. 4)

Convert each character into its equivalent ASCII code. 5)

ASCII code is converted into binary values. 6)

Enter the secret key. 7)

Secret data is converted into cipher data. 8)

The stream of 8 bit(cipher data) are embedded into LSB of each pixel of the cover image. 9)

To apply Genetic Algorithm in the stego image the pixel location should be modified. Algorithm: Visual
Cryptography Input: Stego-Image Output: Encrypted Shares 1)

Read Stego-Image generated. 2)

The stego image is breaked into three layers namely split-1, split-2, split-3 these three files are containing the hidden
data and to get the hidden data these three files have to be reconstructed perfectly. 3)

The re-assembled picture and the extracted data will be gained again. The proposed scheme is based on standard
visual cryptography as well as visual secret sharing. The implementation of the algorithm yields in better result with
insignificant shares when stego images are normally with light contrast. It can also be seen that the algorithm gives much
darker shares in gray output the proposed scheme is based on standard visual cryptography as well as visual secret
sharing. The implementation of the algorithm yields in better result with insignificant shares when stego images are
normally with light contrast. It can also be seen that the algorithm gives much darker shares in gray output. This
algorithm gives better results in terms of image quality and stegnalysis. good at hiding

the initial portion of the image is left degraded while the rest remains untouched. The proposed project work
consist of mainly two algorithms which are (i) Steganography using Genetic Algorithm (ii) Visual Cryptography
with Threshold. The application initiates with Steganography module where the cover image will be encrypted to
generate Stego image. The stagographic image generated in this module will act as an input for visual cryptographic
module. The original message is embedded into the image by using LSB insertion method. The resultant image is
called as stego image shown in Figure 3. Then apply genetic algorithm to modify the pixel location and detection of
message is complex. Then apply visual cryptography scheme stego image is splitted into two shares based on
threshold. The shares of the stego image is shown in Figure 4. It is almost impossible for anyone who will attempt to
decrypt the encrypted data within that image to reveal if the secret shares which they posses are set of all encrypted
shares or certain secret shares are missing. V.

PERFORMANCE ANALYSIS
The performance of the proposed system is experimented by performing stegnalysis and conducting benchmarking
test for analysing parameters like Mean Squared Error (MSE) and Peak Signal to Noise Ratio. Cover image : rice.png
Size : 256*256 Mean Square Error (MSE) : 0.0678 Peak Signal-to-Noise Ratio (PSNR) : 59.8188db After applying
Genetic Algorithm the measured performance is shown in below


www.ijeee-apm.com International Journal of Electrical & Electronics Engineering
17

Mean Square Error (MSE) : 0.794 Peak Signal-to-Noise Ratio (PSNR) : 39.4011db After applying genetic algorithm all the
pixel location are altered. Due to the change the pixel location MSE and PSNR values are increased. From Figure 1
and 2, we can conclude that both the sender and receiver before they start to communicate with each other, they
should use the same images database, image channel (R, G or B), K value for the key array, and the session type.
This study implemented the key generation as 1 image/session. The session period can be an hour or one day. For
instance, hourly session uses one image for each hour and the daily session uses one image for each day. Phase 1:
Database creation: In this phase, we create a database of color RGB images which would be used for generating the
key for encryption/decryption process. In case of using hourly session, the database should contain 24 images;
otherwise, it should contain 7 images for the daily session. Both the sender and the receiver should use the same
database of images (24 or 7 images) as the names of the images should be the same in both sides.
B.

Key Generation:
In this section, we present the pseudo code for the key generation algorithm and the algorithm steps as follows: 1. Get the
value of K variable and the value of N from binaries message step. 2. Select color image from the database
according to the session type and current date or time. 3. Retrievethe image and create array Img [x, y] as LSB of the pixels for
one channel (red, green or blue) where the image has x*y dimension. 4. Create array Key [N, k] to represent the
encryption key. 5. Loop i=0 to N-1 /* for each row in Key*/ 6. Loop c=0 to k/2-1 step 2//fill array by two each7. Scan the
LSB Img[x,y] to find two neighbor values where the absolute difference between them is one. 8. Key[i,c] = First LSB
value. 9. Key[i,c+1] = Second LSB value. 10. End loop 11. End loop
C.

Image Encryption
In this section, we present the pseudo code for the encryption algorithm and the algorithm steps as follows: 1. Get the
value of K variable. 2. Read a message to encrypt 3. Binaries the message and store the binary data in array Data[N,N]
where message bits <= N*N 4. Generate the key using key generation algorithm and create Key [N, k]. 5. Create array
EncData [N, N] to store the encrypted data 6. c=0 7. Loop i=0 to N-1// for each row in Data /* the elements in the
Data array row i compare with two columns of Key array start from c */ 8. Loop j=0 to N-1// for each bit in the row i 9. If Data[i,j]
= Key[j,c] 10. EncData[i,j]=0 // the value in the first column 11. Else 12. EncData[i,j]=1 // the value in the second column 13.
End loop 14. c=c+2// go to next two columns of Key array. 15. if c >= K then c=0// return to the first two columns
of Key array 16. End loop 17. Convert the Enc. Data from binary data to text.
D.

Decryption:
In this section, we present the pseudo code for the decryption algorithm and the algorithm steps as follows: 1. Get the
value of K variable. 2. Binaries the encrypted message and store the binary data in array EncData[N,N] 3. Generate the
key using key generation algorithm and create Key [N, k]. 4. Create Data[N, N] to store the original data 5. c=0 6. Loop i=0 to N-1 /*
for each row in Data*//* the elements in the Data array row i compare with two columns of Key array start from c */ 7. Loop j=0 to N-1 // for
each bit in the row i 8. If Encdata[i,j]=0 then VI.

RESULTS
E.

Results for image encryption and decryption
This figure shows the result of image encryption, decryption and histogram of each image.
Input ImageEncrypted ImageFinal Image010002000Histogram of input


Fig. 3: Results for image encryption and decryption


International Journal of Electrical & Electronics Engineering
18
www.ijeee-apm.com

Image encryption and decryption algorithm is developed in matlab. In the first step we take any image which we
want to encrypt and apply any key consist of number, words and special character. When we apply this key to image
its visualization is hidden and its histogram is also change. When we want to decrypt this image we need to enter
same key. If we provide wrong key then image will not decrypt. Fig. 4:
Results for image encryption and decryption
VII.

C
ONCLUSIONS
Images play an important role in our lives. They are used in many applications. Therefore it is necessary to affirm
the integrity and confidentiality of the digital image being transmitted. Some image encryption and authentication
schemes are discussed in this paper and further improvements are also suggested in the previous section. The chaos
based image cryptography is increasing and improving day by day. The paper presents different chaos based image
cryptographic techniques proposed in the last decade. We discussed the cryptanalysis of an image encryption
scheme and conclude that if the algorithm is not designed properly, it may be possible that the image being
protected will be insecure. Therefore proper security mechanisms should be adopted to secure the image. Each
technique is unique and is suitable for different applications. Everyday new image encryption techniques are
evolving, hence fast and secure image security techniques will always work with high rate of security. We are doing
research work in the field of image security. Image security techniques should be such that any unauthorized user
cannot access the image and if any modifications can be made to the image, that modifications can be detected at the
receiving side. Hashing is a good technique that can be used to verify integrity of the image. Along with hashing, if
proper encryption is provided to the image, the image will be more secure. Using encryption, any unauthorized user
cannot access the image. Hence, to improve the image security, proper combination of encryption as well as authentication
techniques presents ideal alternative. To achieve high level of image security, we are functioning on a hybrid
technique based on image encryption and authentication. The technique consists of hash generation of the plain
image. The generated hash is embedded in the image and the entire image is encrypted using combination of chaotic
maps and substitution-diffusion techniques. The technique can provide high level security to the image with less
computation overheads. R
EFERENCES

[1]

Marc Van Droogenbroeck and Raphael Benedett
,
Techniques for a selective encryption of uncompressed and compressed images

In Advanced Concepts for Intelligent Vision Systems (ACIVS), Ghent, Belgium, pages 90-97, September 2002. [2]

Amitesh Singh Rajput, "Towards the Growth of Image Encryption and Authentication Schemes, "2013 International
Conference on Advances in Computing, Communications and Informatics, P.N.454-459. [3]

Mrs.G.Prema, S.Natarajan, "Steganography using Genetic Algorithm along with Visual Cryptography for Wireless
Network Application" [4]

Tawfiq S. Barhoom, Zakaria M. Abusilmiyeh, "A Novel Cryptography Method Based on Image for Key
Generation", In "2013 Palestinian International Conference on Information and Communication Technology", 2013
IEEE, P.N. 71-76. [5]

M. Sabery.K, M.Yaghoobi, A New Approach for Image encryption using Chaotic logistic map, 978
-0-7695-3489-3/08 2008 IEEE. [6]

[
8] Chen G, Mao Y and Chui CK. A symmetric image encryption scheme based on 3D chaotic cat maps. Chaos
Solitons Fractals 2004;
21:749

61. [7]

[9] Zhang Q, Guo L and Wei X. Image encryption using DNA addition combining with chaotic maps. Math
Comput Model 20
10; 52:2028

35. [8]

[10] Sun F, Liu S, Li Z, and Lu Z. A novel image encryption scheme based on spatial chaos map. Chaos Solitons
Fractals 2008; 38:631
40. [9]

[11] Rhouma Rhouma and Safya Belghith, Cryptanalysis of a new
image encryption algorithm based on hyper-
chaos, Physics Letters A
372(2008) 5973

5978. [10]

[12] Atieh Bakhshandeh and Ziba Eslami , An authenticated image
encryption scheme based on chaotic maps and memory cellular
automata, Optics and Lasers in Engineering, Volume 51, Issue 6,
June 2013, Pages 665-673. [11]

[13] Aloka Sinha and Kehar Singh, A technique for image encryption using digital signature, Optics
Communications, Volume, 1 April
2003, Pages 229-234. [12]

[14] Jing Qiu and Ping Wang, Image encryption and authentication scheme, IEEE, Computatio
nal Intelligence and Security (CIS), 2011 Seventh International Conference, 3-4 Dec. 2011, 784

787. [13]

[15] Siddharth Malik, Anjali Sardana and Jaya, A Keyless Approach to Image Encryption, IEEE 2012
International Conference on
Communication Systems and Network Technologies (2012), 879-883.