On the Security of Image Encryption Using Discrete Fourier Transform and Fractional Fourier Transform
Esam Elsheh1, Saddek Elbendago2, Marwan Ali.H.Omer3
1Esam Elsheh, Department of Information Technology, College of Engineering Technology–Janzour, Tripoli, Libya.
2Saddek Elbendago, Department of Information Technology, College of Engineering Technology–Janzour, Tripoli, Libya.
3Marwan Ali.H.Omer, Department of Information Technology, College of Engineering Technology–Janzour, Tripoli, Libya.
Manuscript received on 15 October 2015 | Revised Manuscript received on 25 October 2015 | Manuscript Published on 30 October 2015 | PP: 93-96 | Volume-5 Issue-1, October 2015 | Retrieval Number: A4307105115/15©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Recent developments of different forms of discrete Fourier transform, have encouraged many researchers to design image encryption algorithms based on a discrete fractional or multiple fractional Fourier transforms. One of these algorithms is proposed by Ashutosh and Sharma, (International Journal of Engineering and Advanced Technology, Vo. 2, Issue. 4, 2013). In this paper, we show that this algorithm represents a classic textbook example of insecure cipher; all the building blocks of this scheme are linear, and thus, breaking this scheme, using a known plaintext attack, is equivalent to solving a set of linear equations. We also invalidate several of the security and performance advantages claimed by the authors, namely, the efficiency, key sensitivity, and the complexity
Keywords: Image Processing, Encryption, Discrete Transforms, Linear Cipher.
Scope of the Article: Image Processing