Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Fast Compressive Sensing Based Digital Image Encryption Technique using Structurally Random Matrices and Arnold Transform

Published 13 Feb 2014 in cs.CR | (1402.4702v1)

Abstract: A new digital image encryption method based on fast compressed sensing approach using structurally random matrices and Arnold transform is proposed. Considering the natural images to be compressed in any domain, the fast compressed sensing based approach saves computational time, increases the quality of the image and reduces the dimension of the digital image by choosing even 25 % of the measurements. First, dimension reduction is utilized to compress the digital image with scrambling effect. Second, Arnold transformation is used to give the reduced digital image into more complex form. Then, the complex image is again encrypted by double random phase encoding process embedded with a host image; two random keys with fractional Fourier transform are been used as a secret keys. At the receiver, the decryption process is recovered by using TwIST algorithm. Experimental results including peak-to-peak signal-to-noise ratio between the original and reconstructed image are shown to analyze the validity of this technique and demonstrated our proposed method to be secure, fast, complex and robust.

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.