On the security of multiple Huffman table based encryption

Authors:
Qing Zhou;Kwok-wo Wong;Xiaofeng Liao;Yue Hu
Affiliations:
Department of Computer Science and Engineering, Chongqing University, Chongqing 400044, China;Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China;Department of Computer Science and Engineering, Chongqing University, Chongqing 400044, China;Department of Computer Science and Engineering, Chongqing University, Chongqing 400044, China
Venue:
Journal of Visual Communication and Image Representation
Year:
2011

Citing 11
Cited 0

An Empirical Study of Secure MPEG Video Transmissions

SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Protecting Intellectual Property in Digital Multimedia Networks

Computer
Performance Study of a Selective Encryption Scheme for the Security of Networked, Real-Time Video

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
SCAN-Based Compression-Encryption-Hiding for Video on Demand

IEEE MultiMedia
Multimedia Security Handbook

Multimedia Security Handbook
Partial encryption of compressed images and videos

IEEE Transactions on Signal Processing
Efficient frequency domain selective scrambling of digital video

IEEE Transactions on Multimedia
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
Cryptanalysis of Some Multimedia Encryption Schemes

IEEE Transactions on Multimedia
A joint signal processing and cryptographic approach to multimedia encryption

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, an encryption algorithm using multiple Huffman tables was proposed to protect multimedia content. Since the encryption operation can be efficiently implemented, its speed is several times faster than AES (Advanced Encryption Standard) or any known stream ciphers. In this paper, the security of this algorithm will be analyzed in detail. It is shown that the key is recovered with one ciphertext and the corresponding plaintext consisting of about 10 blocks of symbols by known-plaintext attack or with thousands of ciphertexts by ciphertext-only attack.