Image encryption method based on using least square error techniques at the decryption stage Online publication date: Sat, 28-Feb-2015
by Mahmood Al-khassaweneh
International Journal of Information and Computer Security (IJICS), Vol. 4, No. 4, 2011
Abstract: To protect digital data, provide secure communication and ensure privacy, many encryption algorithms have been proposed recently. Many of the proposed image encryption methods are based on shuffling the image pixels to make the relation between the encrypted and original images unclear. The shuffling-based methods with small key space, usually, lack the security, since knowing the encryption algorithm will help the hacker recover the original image. In this paper, a new image encryption algorithm with large key space is proposed which uses least square approximation techniques in the decrypting stage. The encrypted image is obtained through multiplying the original image by randomly generated vectors. At the receiver, least square approximation techniques are applied on the encrypted image and the randomly generated vectors to recover the original image. The method has been tested on a large number of images and the simulations show the effectiveness and the enhancement in security of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook