A linear quadtree compression scheme for image encryption

Henry Ker Chang Chang*, Jiang Long Liu

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

103 Scopus citations


A private key encryption scheme for a two-dimensional image data is proposed in this work. This scheme is designed on the basis of lossless data compression principle. The proposed scheme is developed to have both data encryption and compression performed simultaneously. For the lossless data compression effect, the quadtree data structure is used to represent the image; for the encryption purpose, various scanning sequences of image data are provided. The scanning sequences comprise a private key for encryption. Twenty four possible combinations of scanning sequences are defined for accessing four quadrants, thereby making available 24n × 4n(n-1)/2 possibilities to encode an image of resolution 2n × 2n. The security of the proposed encryption scheme therefore relies on the computational infeasibility of an exhaustive search approach. Three images of 512 × 512 pixels are used to verify the feasibility of the proposed scheme. The testing results and analysis demonstrate the characteristics of the proposed scheme. This scheme can be applied for problems of data storage or transmission in a public network.

Original languageEnglish
Pages (from-to)279-290
Number of pages12
JournalSignal Processing: Image Communication
Issue number4
StatePublished - 09 1997
Externally publishedYes


  • Image compression
  • Image encryption
  • Image scramble
  • Linear quadtree
  • Private key


Dive into the research topics of 'A linear quadtree compression scheme for image encryption'. Together they form a unique fingerprint.

Cite this