By Topic

The Fast Realization of Image Scrambling Algorithm Using Multi-dimensional Orthogonal Transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

We propose the fast algorithms for image scrambling using multi-dimensional orthogonal transform. The multi-dimensional orthogonal sequence can provide an orthogonal transform for image scrambling and descrambling. This scrambling method has the characteristic of high security because the keys for scrambling and descrambling are a set of the parameters to generate the orthogonal sequence. But the disadvantage of this method is that the computing complexity is high. In order to save the computing time, serial and parallel fast algorithms are proposed. When using these fast algorithms, another image can be used as a key to improve the security. For a binary image and a gray scale image, different sequences and fast algorithms are used to scramble. The experimental results show that these fast algorithms can effectively decrease the computing complexity and the histograms of digital image after scrambling have random Gaussian distribution.

Published in:

Image and Signal Processing, 2008. CISP '08. Congress on  (Volume:3 )

Date of Conference:

27-30 May 2008