Image compression and encryption using tree structures
Pattern Recognition Letters - special issue on pattern recognition in practice V
Efficient selective encryption for JPEG 2000 images using private initial table
Pattern Recognition
Journal of Visual Communication and Image Representation
Lossless image compression via predictive coding of discrete Radon projections
Image Communication
JPEG Encryption with File Size Preservation
IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
A robust chaos-based image encryption scheme
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Compression-unimpaired batch-image encryption combining vector quantization and index compression
Information Sciences: an International Journal
Image and Video Compression for Multimedia Engineering: Fundamentals, Algorithms, and Standards
Image and Video Compression for Multimedia Engineering: Fundamentals, Algorithms, and Standards
A new chaos-based fast image encryption algorithm
Applied Soft Computing
IEEE Transactions on Signal Processing
Design of integrated multimedia compression and encryption systems
IEEE Transactions on Multimedia
Multimedia Selective Encryption by Means of Randomized Arithmetic Coding
IEEE Transactions on Multimedia
Proceedings of the 20th ACM international conference on Multimedia
Triple-image encryption scheme based on one-time key stream generated by chaos and plain images
Journal of Systems and Software
Image encryption based on the finite field cosine transform
Image Communication
Hi-index | 0.00 |
A chaos-based joint image compression and encryption algorithm using discrete cosine transformation (DCT) and Secure Hash Algorithm-1 (SHA-1) is proposed. As SHA-1 is fast and input-sensitive, it is employed to enhance the diffusion effect on image pixels. The DCT coefficients of the whole image are separated into two sequences for mutual interaction. The sequence of low-frequency coefficients, together with the secret keys, generates a message digest to perturb another sequence composed of high-frequency coefficients. The last cipher block of the high-frequency sequence is used as a feedback to control the diffusion and permutation in the low-frequency sequence. Huffman code is chosen as the entropy coding to compress the encrypted chains. Experimental results confirm that our algorithm is efficient and highly sensitive to both the key and the plain-image.