On the security of multiple Huffman table based encryption

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

9 Scopus Citations
View graph of relations

Author(s)

  • Qing Zhou
  • Kwok-Wo Wong
  • Xiaofeng Liao
  • Yue Hu

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)85-92
Journal / PublicationJournal of Visual Communication and Image Representation
Volume22
Issue number1
Publication statusPublished - Jan 2011

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. © 2010 Published by Elsevier Inc. All rights reserved.

Research Area(s)

  • Ciphertext-only attack, Cryptographic analysis, Huffman encoding, Known-plaintext attack, Long-term key, Multimedia encryption, Multiple Huffman table, Per-message key, Pruning

Citation Format(s)

On the security of multiple Huffman table based encryption. / Zhou, Qing; Wong, Kwok-Wo; Liao, Xiaofeng; Hu, Yue.

In: Journal of Visual Communication and Image Representation, Vol. 22, No. 1, 01.2011, p. 85-92.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review