Robust real-time image encryption with aperiodic chaotic map and random-cycling bit shift
- 179 Downloads
This work tackles a recent challenge in real-time image encryption: how to ensure the correctness of the image content if an encrypted image is performed by active attack? We tackle this problem by designing a robust encryption scheme with aperiodic chaotic map and random-cycling bit shift. The original image is first scrambled using aperiodic generalized Arnold transform. Then, for the scrambled image, cycling bit shift is randomly performed on each pixel by changing the pixel values at bit-level. Finally, the encryption procedure can be achieved by conducting XOR operation between the scrambled image and a secret matrix generated by chaotic map. Our scheme is robust in the sense that the recipient can decrypt the original image successfully even if they are performed with diverse attacks during delivery. Since the initial value of the chaotic map is controlled by the image pixel values in the encryption process, the proposed scheme has a sensitive key space and satisfy the Permutation–diffusion architectures. Comprehensive experimental results show that our proposed method outperforms the state of the arts in terms of low computation complexity and robustness.
KeywordsImage encryption Aperiodic chaotic map Random-cycling bit shift Real-time Robustness
This work was supported by the Natural Science Foundation of China under Grants (61602295, 61503235) and the Natural Science Foundation of Shanghai (16ZR1413100).
- 1.Amalarethinam, D., Geetha, J.: Image encryption and decryption in public key cryptography based on MR. In: Proceedings of the IEEE (2015)Google Scholar
- 22.Li, M., Liang, T., He, Y.: Arnold transform based image scrambling method. In: 3rd International Conference on Multimedia Technology (ICMT 2013), pp. 1309–1316 (2013)Google Scholar
- 23.Shang, Z., Ren, H., Zhang, J.: A block location scrambling algorithm of digital image based on Arnold transformation. In: The 9th International Conference for Young Computer Scientists, pp. 2942–2947 (2008)Google Scholar