University of Surrey

Test tubes in the lab Research in the ATI Dance Research

On the security of a secure Lempel-Ziv-Welch (LZW) algorithm

Li, SJ, Li, CQ and Kuo, C-CJ (2011) On the security of a secure Lempel-Ziv-Welch (LZW) algorithm In: 2011 IEEE International Conference on Multimedia and Expo (ICME 2011), 2011-07-11 - 2011-07-15, Barcelona, Spain.

[img] Text
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (199kB)
[img] Text (licence)
Restricted to Repository staff only

Download (33kB)


This paper re-evaluates the security of a secure Lempel-Ziv-Welch (LZW) algorithm proposed at ICME'2008. A chosen-plaintext attack is proposed to break all ciphertext indices corresponding to single-symbol dictionary entries. For short plaintexts the chosen-plaintext attack works well because string-symbol strings appear very frequently. The number of required chosen plaintexts is at the order of the alphabet size. The complexity of the chosen-plaintext attack is O(ML), where M is the number of chosen plaintexts and L is the size of the ciphertext. The chosen-plaintext attack can also be generalized to chosen-ciphertext attack. In addition to the security problem, we point out that the secure LZW algorithm has a lower compression efficiency compared with the original LZW algorithm. Finally we propose several enhancements to the secure LZW algorithm under study.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
Li, SJ
Li, CQ
Kuo, C-CJ
Date : 2011
DOI : 10.1109/ICME.2011.6011939
Contributors :
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 14:42
Last Modified : 31 Oct 2017 14:34

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800