NobleBlocks

Research indexJournal article

Image Compression-Encryption Algorithm Using Huffman Coding and AES

Farajallah, Isayed, Tamimi and 1 other

AI Computer Science and Robotics Technology7 Apr 2026Open access

NobleIDark:/48914/w1/20261105/E8E4B792DOI10.5772/acrt.20250107

Free to read at the publisher

You can read the abstract here, or the full text at the publisher.

Read at the publisher

Abstract

The rapid growth of multimedia data transmission over the internet has intensified the need for efficient and secure image compression techniques. This paper proposes an integrated grayscale image compression–encryption algorithm that combines a novel subtraction–thresholding preprocessing filter with Huffman coding for compression and the Advanced Encryption Standard (AES) for secure encryption. The subtraction–thresholding filter reduces redundancy by normalizing pixel intensities within a defined range, improving Huffman coding efficiency and lowering computational overhead during encryption. The proposed method is experimentally evaluated on standard grayscale test images using quantitative metrics, including peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), compression ratio (CR), and mean square error (MSE) for compression performance, and the number of pixel change rate, unified average changing intensity, and Hamming distance for security assessment. The highest CR of 3.95 is achieved at a threshold value of 8 and a block size of 64 × 64, with corresponding PSNR and SSIM values of 17.11 dB and 0.36, respectively. Experimental results confirm that the proposed Huffman–AES framework provides an effective trade-off between image quality, compression efficiency, and encryption robustness, making it suitable for lightweight, real-time image transmission applications.

Discussion

Citations

More

Suggest a correction or report