On the security of multiple Huffman table based encryption》.pdfVIP

J. Vis. Commun. Image R. 22 (2011) 85–92 Contents lists available at ScienceDirect J. Vis. Commun. Image R. journal homepage: /locate/jvci On the security of multiple Huffman table based encryption Qing Zhou a,⇑, Kwok-wo Wong b, Xiaofeng Liao a, Yue Hu a a Department of Computer Science and Engineering, Chongqing University, Chongqing 400044, China b Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China a r t i c l e i n f o a b s t r a c t Article history: Recently, an encryption algorithm using multiple Huffman tables was proposed to protect multimedia Received 3 September 2007 content. Since the encryption operation can be efficiently implemented, its speed is several times faster Accepted 18 October 2010 than AES (Advanced Encryption Standard) or any known stream ciphers. In this paper, the security of this Available online 11 November 2010 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 Keywords: thousands of ciphertexts by ciphertext-only attack. Multimedia encryption Crown Copyright 2010 Published by Elsevier Inc. All rights reserved. Huffman encoding Cryptographic analysis Pruning Known-plaintext attack Ciphertext-only attack Multiple Huffma