By Topic

On the security of image encryption schemes based on Multiple Parameters Transforms

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

2 Author(s)
Elsheh, E. ; Concordia Inst. for Inf. Syst. Eng., Concordia Univ., Montreal, QC, Canada ; Youssef, A.

Recent developments of generalized forms of signal processing transforms with a large number of independent parameters, such as the Multiple Parameter Fractional Fourier Transform and the Discrete Fractional Cosine Transform, have encouraged many researchers to propose image encryption algorithms based on a single or multiple applications of these transforms. In order to claim a high level of security of these parameterized transforms-based schemes, their authors usually use the argument that the encrypted image is visually indistinguishable from random noise. In this paper, we show that these algorithms represent typical textbook examples of insecure ciphers; all the building blocks of these schemes are linear, and hence, breaking these scheme, using a known plaintext attack, is equivalent to solving a set of linear equations. We also invalidate the argument of relying on the visual quality of the encrypted image ciphertext by presenting an example for a trivially insecure system that produces ciphertext images with the same property. An agreement against the claimed efficiency of these schemes is also provided.

Published in:

Signal Processing and Information Technology (ISSPIT), 2010 IEEE International Symposium on

Date of Conference:

15-18 Dec. 2010