International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 117 | Views: 184

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 4 Issue 7, July 2015

Hueristic Approch for Image Encryption and then Compression by Tree Pattern Approach

Devashri Anil Vyawahare [2] | Anil Gujar [2]

Abstract: Most of the times while any message is transferring across the network for security reasons they are normally encrypted directly to make user visibly unreadable or it will be encrypted (hidden) in an image. And now a days data hacker becomes too intelligent to break the encrypted images to get the original contents. So many systems are designed to combine the encryption and compression in single mould to provide greater security. So we are presenting a novel approach of encryption by maintaining run time LSB (least significant bit) using image decomposition method. This actually enhances the encryption processes by converting image into small blocks of hierarchical cluster of the LSBs. These blocks can be holding the users message in many different patterns which is actually highly difficult to predict by the hackers. And then all individual blocks can be put in a tree to compress in the same hierarchy of decomposition. Numbers of techniques are proposed to do so. Image encryption is one of them, it provides a high level security to the image. Larger images are difficult to process hence image compression can be done after encryption process. Proposed approach designs the image encryption and then compression (ETC) which is suitable for both lossy and loss less images. Also the proposed scheme is operated on the prediction error domain. An arithmetic code based approach is used for the compression of the image because it performs well than any others.

Keywords: Encryption, Compression, normalization, byte tree

Edition: Volume 4 Issue 7, July 2015,

Pages: 2603 - 2607

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait