Encryption speed improvement on “an improvement over an image encryption method based on total shuffling”

Encryption security and encryption speed are two important aspects of image encryption algorithm. Recently, Zhang et al. proposed a plaintext related image encryption method based on chaos and permutation-diffusion architecture [G. Zhang, Q. Liu, Opt. Commun. 284 (2011) 2775-2780]. In the same year Wang et al. pointed out that Zhang´s scheme cannot resist chosen plaintext attacks [X. Wang, G. He, Opt. Commun. 284 (2011) 5804-5807]. Most recently, Eslami et al suggested an improvement over Zhang´s method with slower encryption speed [Z. Eslami, A. Bakhshandeh, Opt. Commun. 286 (2013) 51-55]. This paper presented another improvement over Eslami´s scheme using a lookup table to enhance the speed of encryption algorithm without loss of security, which makes it more feasible in practical communication.