**ABSTRACT**

In this study, declared a new fangled methodology for image encryption using one of the cryptographic modes. The need for protection rises phenomenally with greater than before custom of internet and online communication. It is challenging and crucial to safeguard the information be it any multimedia file online and to check illegal entrée’. Naturally images play a huge role in doing so in so called cryptographic and steganographic techniques. The former is very primeval but interestingly is still in use and lends a helping hand to realize secret sharing. Of the various fruits of cryptographic techniques, image encryption is awe-inspiring having multiple proficiencies possessing countless platforms to explore. This paper paints yet another advantageous model to image encryption where the image undergoes exceptional echelon of shuffling, scrambling and encrypting customs with Cipher Block Chaining (CBC) cryptographic mode as the brain. The analytical results demonstrate that this proposal is unsurpassed in the grounds of Correlation, BER, UACI, NPCR, PSNR and MSSIM. The encrypted images and their corresponding histograms are publicized to prove the paper’s purpose creation.

PDF Abstract XML References Citation

**Received:**April 29, 2013;

**Accepted:**May 21, 2013;

**Published:**August 06, 2013

####
**How to cite this article**

*Research Journal of Information Technology, 5: 341-351.*

**URL:**https://scialert.net/abstract/?doi=rjit.2013.341.351

**INTRODUCTION**

Rapid progress in use of digital information and its communication indeed demands for ideal security mechanisms. Moreover, images, being an integral part of online communication, need highest assiduity (Cheddad *et al*., 2010b; Hmood *et al*., 2010a, b). Not only just meant for recreation and sharing, images have now become a necessitated mode of apportioning in diverse domains, be it, engineering, medical, satellite communicating, geographical and oceanic applications and research, computer science etc. Having referred that, exploiting images for sharing and distributing secrets is not a big surprise (Amirtharajan *et al*., 2012a, b; Stefan and Fabin, 2000).

Okay that image is very helpful in communicating confidential information (Amirtharajan and Rayappan, 2012a-d; Cheddad *et al*., 2010a). But how? Just like that it would not accommodate any hush-hush data. Various researches had been and have been going on to make this a possibility. Legion methodologies and practices are invented to do so by taking ‘Cryptography’ as blood-line. It is an art, can also be entitled as science, by making use of which clandestine messages are shared between end to end users. Since present day technologies have a new facet with amalgamation of other horizons, Cryptography is not an elision (Salem *et al*., 2011; Schneier, 2007). It has spread its wings in many notable fields of study; to quote some computer science, information security, engineering, mathematics etc.

A few eminent cryptographic routines are DES, AES, IDEA, HASH, SHA, Block and Stream Ciphers, Cryptographic modes (ECB, CBC etc.), RSA, Pseudo random sequence generators and many more (Schneier, 2007). This encryption paper uses CBC (Amirtharajan *et al*., 2012a) as backbone; it is for block ciphers where XOR operation is performed on plaintext with cipher text before getting encrypted. Feedback register is used to store the result; to make the message distinct from others, Initialization vector is used. Interesting fact here is that a single key can be used to encrypt surplus messages. Features of CBC like speed, cipher text is a block longer than that of plaintext, no pre-processing, un-parallelizable encryption, parallelizable decryption, fault-tolerance, unrecoverable synchronization error are worth mentioning (Stallings, 2010a, b). As a result, CBC finds its way in cryptographic mechanisms involving images that too mainly for image encryption. Encryption is one among a few modes that insures stability by inexplicably maximizing the probability of acknowledging that hush-hush information is truly enciphered (Schneier, 2007). Such encrypted images showing no sign of secret in it has jaw-dropped many. An interesting part here is that besides image, audio and video too can be taken advantage of and are in use at present (Zaidan *et al*., 2010). Thus, image encryption has the power to hold out deliberate third party attacks while still maintaining haphazard arrangement on count. No doubt that image encryption has stretched its technical boundaries (Zhang and Liu, 2011; Zhu *et al*., 2011 ).

Amin *et al*. (2010) proposed an image cryptosystems through chaotic block cipher algorithm for better security (Tong, 2013). Cheddad *et al*. (2010a) suggested a hash based image encryption for authentication. In addition there are several pixel based methods are reported in literature for image encryption (Hu and Han, 2009; Huang and Nien, 2009; Ye, 2010). Authentication based on image encryption reported by Yang *et al*. (2010). In image encryption, time taken to perform the process is reduced through fast image encryption algorithms (Wang *et al*., 2011). Shyu (2009) suggested random grids based image encryption.

The cardinal maxims of encryption algorithms can be stated as mystification and dissemination. It can be said that the backbone of such algorithms is the key used in encryption in the source and decryption in the destination. So, it is vivid that the image encryption modus operandi is the blend of cryptography and steganography (Cheddad *et al*., 2010b; Hmood *et al*., 2010a, b). Having mentioned that, image encryption has pulled in numerous concepts in developing an algorithm. Above mentioned are inscrutable domains to explore. Image encryption is so vast that it is dug through versatile bailiwicks of engineering and mathematics. For instance, chaotic maps, permutation, correlation, statistical analysis, 3D baker maps, Phase and Magnitude manipulation, Matrix, SCAN patterns and many more (Amin *et al*., 2010; Cheddad *et al*., 2010b; Hu and Han, 2009; Huang and Nien, 2009; Shyu, 2009; Wang *et al*., 2011; Yang *et al*., 2010; Ye, 2010; Zhang and Liu, 2011; Zhu *et al*., 2011).

There are other ways to preserve the confidential information, like image steganography (Amirtharajan and Rayappan, 2012a-d; Amirtharajan *et al*., 2012a, b; Stefan and Fabin, 2000; Zhu *et al*., 2011), watermarking (Stefan and Fabin, 2000; Zeki *et al*., 2011; Zhang *et al*., 2006) apart from Image encryption (Zhang and Liu, 2011; Zhu *et al*., 2011). Image steganography is useful in hiding the confidential information of any digital media in spatial or transform domain co-efficient and watermarking is useful for **copyright protection** and authentication. But this paper deals only with image encryption.

**PROPOSED METHOD**

In the proposed algorithm of image encryption for a gray image, first we scramble the positions of the pixels in the plain image, then for this scrambled image we decompose pixel values into bits.

Fig. 1: | Block diagram for proposed method |

Fig. 2: | Flow chart for proposed method |

For changing the intensity values we shuffle the bits in a particular order and convert to its respective decimal values. Then for this converted matrix we apply cipher block chain algorithm with a public key and a private key. To increase the complexity and security of the algorithm we also complement the intensity values. The algorithm is explained below in steps. The schematic diagram for this study is given in Fig. 1 and flowchart is given in Fig. 2.

Encryption algorithmDecryption algorithm |

**RESULTS AND DISCUSSION**

A perfect encryption algorithmic rule should stand for it in opposition to Cryptanalysis assails. Contrasting the conventional encryption methods, the requisites of digital encryption sound dissimilar. It does need cryptographic together with perceptual refuge. In this script, algorithm is run in MATLAB 7.1 with gray Lena as plain images which are of dimension 256x256 and their shuffled, encrypted versions and their corresponding histograms are shown in Fig. 3a-f, respectively. Tentative results for this study are depicted in Table 1.

In this script, algorithm is run in MATLAB 7.1 with gray Baboon as plain images which are of dimension 256x256 and their shuffled, encrypted versions and their corresponding histograms are shown in Fig. 4a-f, respectively.

In this script, algorithm is run in MATLAB 7.1 with gray Mahatma gandhi as plain images which are of dimension 256x256 and their shuffled, encrypted versions and their corresponding histograms are shown in Fig. 5a-f, respectively.

Table 1: | Experimental results of image metrics obtained for image encryption |

Fig. 3(a-f): | (a) Lena, (b) Secret image shuffled image, (c) Encrypted image, Histogram of (d) Secret image, (e) Shuffled image and (f) Encrypted image |

In this script, algorithm is run in MATLAB 7.1 with gray Kovil as plain images which are of dimension 256x256 and their shuffled, encrypted versions and their corresponding histograms are shown in Fig. 6a-f, respectively.

**Stochasticity tests:** Ergodic properties top the priorities of a consummate encryption model. Original and enciphered images are shown in figures which look absolutely absurd. Random literally mentions the processes bring forth identically detached and free-lance samples. The process is random if pragmatic value is determined through its position in sequence else through subsequent observations. Tentative outcomes suggest that this output produced in this paper is absolutely random giving no hint about the clandestine information.

Fig. 4(a-f): | Baboon (a) Secret image, (b) Shuffled image, (c) Encrypted image Histogram of (d) Secret image (e) Shuffled image (f) Encrypted image |

**Histogram tests:** Histograms for pixels in all the four images are given. It is noticed that plain image histograms demonstrate a pattern whereas pixels distribution in encrypted version is flat. It signifies the fact that frequency investigation is unable to crack this algorithm. Also, in order to not letting the intruders to know about the covert information, it is mandatory that the histograms of original and end result remain statistically identical. Thus, in this paper encrypted histograms are appreciably unlike from their original ones. Plain histograms have huge cum spiky peaks trailed by jagged declines but the resultants comprise of homogenous variations.

**Correlation of pixels:** As the final outputs give the impression of being unsystematic, it is okay if third party expects zero correlation. As a matter of fact, pixel correlation is a key measure of performance in any image encryption algorithm. Here presented the values of all horizontal, vertical and diagonal correlation among pixels in both plain and encrypted images.

Fig. 5(a-f): | Mahatma Gandhi, (a) secret image (b) shuffled image (c) encrypted image Histogram of (d) Secret image (e) Shuffled image and (f) Encrypted image |

While for the former the correlation is nearly equal to 1 and almost 0 is the case for the latter. Thus plain images exhibit high correlation and encrypted images depict negligible correlation between adjacent pixel pairs in this study. The correlation coefficient is expressed by:

where, σ = i and j’s standard deviations, respectively cov(i, j) = Covariance of i and j.

Covariance is given as:

Fig. 6(a-f): | Kovil: (a) Secret image (b) Shuffled image (c) Encrypted image Histogram of (d) Secret image (e) shuffled image (f) Encrypted image |

Here, μ_{i} and μ_{j} are i and j’s mean, respectively.

**Differential attack:** This index is to quantify the security of the algorithm. Here by altering a single pixel one can observe the subsequent resultant image. If there is any such change, then this run is said to be bungling and not viable. The two constraints involved in studying persuasion of a solitary pixel change are NPCR and UACI. Their expressions are given below:

This study is differential attack tested by exposing all the images which are of varying size. NPCR of approximately 99.6% and UACR of roughly 33.6% are witnessed in this paper which is fairly upright. Thus one cannot trace a small similarity between the original and resultant images. As a result, differential attack is not viable on this algorithm.

**Image metrics:** Making it ideal from the rest, this study is vindicated by BER, MSSIM and PSNR. These images have very less PSNR which signifies the fact that there is no relation between the original and the resultants. Moreover, the third party cannot predict that there is some confidential information contained in them. In simple, PSNR predicts the resemblance between two images which in this case is anticipated.

Mssim generally lies between -1 and 1; the nearer the value to 1 higher is the similarity between the images. The proposed model exhibits MSSIM of almost 0 that makes the paper take pride in security grounds. This means only trifling blunder is encountered by this algorithm which is for sure allowable and acceptable.

Where:

μ_{O} is the estimate of the mean intensity of the cover (N = 255), σ_{0} is the standard deviation

Here σ_{OS} is correlation coefficient.

BER is also a performance criterion which tells about the error witnessed in the procedure. This proposal gives it approximately as 0.5 for all the images. It confirms there are almost 50% error rate.

**CONCLUSION**

This study introduces an inimitable image encryption model which takes Cipher Block Chaining Mode as the fundamental element and constructs further plots to achieve a secret sharing scheme. The algorithm takes advantage of dissemination and mystification via spoofing the secret image and with the help of keys and scrambling, the relation between the secret images and encrypted images is brought to zilch. The paper withstands some notable attacks namely differential, correlation, histograms to prove its creation for which simulation upshots are illustrated. It maximizes the efficiency by significantly improving the randomness among pixels and security as well. Experimental results confirm the practicality of this proposal. These features boost to put forward the paper as a pertinent and promising encryption algorithm. Since it is an image encryption routine, it does not bestow data expanding and thus is very much sensible to parameters having a good prognosis in information security.

####
**REFERENCES**

- Amin, M., O.S. Faragallah and A.A. Abd El-Latif, 2010. A chaotic block cipher algorithm for image cryptosystems. Commun. Nonlinear Sci. Numer. Simul., 15: 3484-3497.

CrossRefDirect Link - Amirtharajan, R., J. Qin and J.B.B. Rayappan, 2012. Random image steganography and steganalysis: Present status and future directions. Inform. Technol. J., 11: 566-576.

CrossRefDirect Link - Amirtharajan, R. and J.B.B. Rayappan, 2012. An intelligent chaotic embedding approach to enhance stego-image quality. Inform. Sci., 193: 115-124.

CrossRefDirect Link - Amirtharajan, R. and J.B.B. Rayappan, 2012. Brownian motion of binary and gray-binary and gray bits in image for stego. J. Applied Sci., 12: 428-439.

CrossRefDirect Link - Amirtharajan, R. and J.B.B. Rayappan, 2012. Pixel authorized by pixel to trace with SFC on image to sabotage data mugger: A comparative study on PI stego. Res. J. Inform. Technol., 4: 124-139.

CrossRefDirect Link - Amirtharajan, R. and J.B.B. Rayappan, 2012. Inverted pattern in inverted time domain for icon steganography. Inform. Technol. J., 11: 587-595.

CrossRefDirect Link - Cheddad, A., J. Condell, K. Curran and P. McKevitt, 2010. Digital image steganography: Survey and analysis of current methods. Signal Process., 90: 727-752.

CrossRefDirect Link - Cheddad, A., J. Condell, K. Curran and P. McKevitt, 2010. A hash-based image encryption algorithm. Opt. Commun., 283: 879-893.

CrossRefDirect Link - Hmood, A.K., B.B. Zaidan, A.A. Zaidan and H.A. Jalab, 2010. An overview on hiding information technique in images. J. Applied Sci., 10: 2094-2100.

CrossRefDirect Link - Hmood, A.K., H.A. Jalab, Z.M. Kasirun, B.B. Zaidan and A.A. Zaidan, 2010. On the capacity and security of steganography approaches: An overview. J. Applied Sci., 10: 1825-1833.

CrossRefDirect Link - Hu, J. and F. Han, 2009. A pixel-based scrambling scheme for digital medical images protection. J. Network Comput. Appl., 32: 788-794.

CrossRefDirect Link - Huang, C.K. and H.H. Nien, 2009. Multi chaotic systems based pixel shuffle for image encryption. Opt. Commun., 282: 2123-2127.

CrossRefDirect Link - Salem, Y., M. Abomhara, O.O. Khalifa, A.A. Zaidan and B.B. Zaidan, 2011. A review on multimedia communications cryptography. Res. J. Inform. Technol., 3: 146-152.

CrossRefDirect Link - Shyu, S.J., 2009. Image encryption by multiple random grids. Pattern Recognit., 42: 1582-1596.

CrossRefDirect Link - Tong, X.J., 2013. Design of an image encryption scheme based on a multiple chaotic map. Commun. Nonlinear Sci. Numer. Simul., 18: 1725-1733.

CrossRefDirect Link - Wang, Y., K.W. Wong, X. Liao and G. Chen, 2011. A new chaos-based fast image encryption algorithm. Applied Soft Comput., 11: 514-522.

CrossRef - Ye, G., 2010. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recognit. Lett., 31: 347-354.

CrossRefDirect Link - Yang, H., K.W. Wong, X. Liao, W. Zhang and P. Wei, 2010. A fast image encryption and authentication scheme based on chaotic maps. Commun. Nonlinear Sci. Numer. Simul., 15: 3507-3517.

CrossRefDirect Link - Zaidan, B.B., A.A. Zaidan, A.K. Al-Frajat and H.A. Jalab, 2010. On the differences between hiding information and cryptography techniques: An overview. J. Applied Sci., 10: 1650-1655.

CrossRefDirect Link - Zhang, G. and Q. Liu, 2011. A novel image encryption method based on total shuffling scheme. Optics Commun., 284: 2775-2780.

CrossRef - Zhu, Z.L., W. Zhang, K.W. Wong and H. Yu, 2011. A chaos-based symmetric image encryption scheme using a bit-level permutation. Inform. Sci., 181: 1171-1186.

CrossRef - Zeki, A.M., A.A. Manaf and S.S. Mahmod, 2011. High watermarking capacity based on spatial domain technique. Inform. Technol. J., 10: 1367-1373.

CrossRef