An efficient key-scheduling and bit shuffling algorithm for image data encryption

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.