Real-time image encryption and decryption methods based on the Karhunen-Loeve transform
by Hasan Rashaideh; Ahmad Shaheen; Nijad Al-Najdawi
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 7, No. 5, 2019

Abstract: There is always a need for a reliable, fast, and accurate encryption algorithm where marginal concessions are not acceptable. The choice of encrypting images in the frequency domain is more suitable as the image components are de-correlated, which provides a suitable platform to classify those values according to their significance. In this work and based on the Karhunen-Loeve transform and the advanced encryption standard algorithm a symmetric lossless encryption and decryption algorithms are proposed. The proposed encryption scheme is applicable for applications that require protected delivery of high-quality data. In terms of quality, the proposed decryption algorithm outperforms the rest of the algorithms in this domain by providing lossless decrypted images that are identical to the originals. Moreover, well-known statistical tests and security measures have been performed in order to validate the security of the proposed encryption algorithm, the results outperform the state-of-the-art algorithms in this domain.

Online publication date: Fri, 15-Nov-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Intelligent Engineering Informatics (IJIEI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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