ACCENTS Transactions on Information Security, Vol 3(11) ISSN (Online): 2455-7196 http://dx.doi.org/10.19101/TIS.2018.311003 29 An efficient key-scheduling and bit shuffling algorithm for image data encryption Ravi Shankar Yadav 1* , Kailash Patidar 2 , Rishi Kushwah 3 and Gaurav Kumar Saxena 3 M.Tech Scholar, Department of Computer Science, School of Engineering, Sri Satya Sai University of Technology & Medical Sciences, Sehore, Madhya Pradesh, India 1 Professor and HOD, Department of Computer Science, School of Engineering, Sri Satya Sai University of Technology & Medical Sciences, Sehore, Madhya Pradesh, India 2 Assistant Professor, Department of Computer Science, School of Engineering, Sri Satya Sai University of Technology & Medical Sciences, Sehore, Madhya Pradesh, India 3 ©2018 ACCENTS 1.Introduction In the age of communication there is the need of high level data security for the prospective of data communication. In this regard there is the need of image data security also. Data security is crucial now a day [1−5]. Data cryptography plays an important role in the data security [6-8]. Encryption helps hiding information to make it impenetrable without special knowledge [9]. Transposition and substitution are the two ways for achieving this [10, 11]. So in the subsequent segment we examine data Encryption technique for picture encryption [12]. We additionally talk about the noteworthy edges which are utilized as a bit of picture encryption with their motivations of interest and hindrances [13]. At long last considering the discussions we likewise propose some future comment which may be helpful in this bearing. *Author for correspondence There are various basic strategies which are unavoidable cryptography, for instance, private key cryptography, and hash [14−20]. In private key cryptography, a solitary key is staying for both encryption and unraveling. This obliges meander if all else fails part pass on offering an emulate of the key and the key be struck by be passed swear off a protected channel to the accompanying person [21−24]. Private-key estimations are level indestructible and suitably acknowledged in apparatus. In this way they are on and well really for mass estimations encryption. The enormous please of the all-around adjusted encryption rely upon plaintext, encryption estimation, key and unscrambling calculation. The plaintext is the size ahead requiring the encryption check. It is joining of the commitments to the encryption tally. The encryption check is the estimation used to continue on deals with the information stranger plaintext to figure quiet. The mystery key is a for all intents and purposes indistinguishable to rebuff of the encryption figuring and of the plaintext and it is accomplice of the encryption's wellsprings of information tally [25, 26]. Research Article Abstract In this paper an efficient security framework has been proposed which is efficient in image data security as well as the image loss is minimum. In our approach we have used the combination of encryption algorithms. XOR operations are also applied for the bit randomization so that the proper bit shuffling is possible. Then histogram comparison has been provided for the image data for the different phases. Then the information loss is calculated based on the entropy values. Then for comparative analysis peak signal to noise ratio (PSNR) and mean square error (MSE) have been calculated. It provides the comparative and analytical comparison based on the different images. Our results show that it is efficient in terms of information loss, MSE and PSNR values. Keywords Encryption, Decryption, PSNR, MSE.