.png){kind=icon}
Return
A linear quadtree compression scheme for image encryption
.png){kind=icon}
PRE
AI
DOI：10.1016/S0923-5965(96)00025-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 24(n) x 4(n(n-1)/2) possibilities to encode an image of resolution 2(n) x 2(n). The security of the proposed encryption scheme therefore relies on the computational infeasibility of an exhaustive search approach. Three images of 512 x 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. (C) 1997 Elsevier Science B.V.
Keywords:
linear quadtree
image compression
image encryption
private key
Image scramble
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
2.7
Papers:
2.8K
Citations:
4.2K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave