
Article Fingerprint
ReserarchID
CSTII16F
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
In this paper, the idea of partial encoding has been proposed to use for secure encryption of only a portion of compressed data. Only 10% -25% of the output is encrypted from the Quad tree compression algorithm. As a result, the encryption and decryption time has been reduced considerably. Thus, in the compression stage, the Quad tree compression algorithm is used while in the encoding stage, the Advanced Encryption Standard (AES) algorithm is applied. The proposed partial coding system is fast and safe and does not reduce the compression performance of the underlying specific algorithm.
Marwah Kamil Hussein. 2020. "The Optimum Encryption Method for Image Compressed by AES". Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 20 (GJCST Volume 20 Issue F1).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
v1.2
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 141
Country: Iraq
Subject: Global Journal of Computer Science and Technology
Authors: Marwah Kamil Hussein (PhD/Dr. count: 0)
View Count (all-time): 401
Total Views (Real + Logic): 1860
Total Downloads (simulated): 168
Publish Date: 2020 01, Wed
Monthly Totals (Real + Logic):
We use cookies and similar technologies to improve site performance, understand traffic, and enhance your publishing experience. Cookie Policy
Choose which optional cookies Global Journals can use. Your preference applies across this platform and can be updated any time.
These cookies are required for core website functionality and security.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.