Generalized Discrete Fractional Hadamard Transformation and its Application on the Image Encryption
IIH-MSP '07 Proceedings of the Third International Conference on International Information Hiding and Multimedia Signal Processing (IIH-MSP 2007) - Volume 01
Closed-form discrete fractional and affine Fourier transforms
IEEE Transactions on Signal Processing
The fractional Fourier transform and time-frequency representations
IEEE Transactions on Signal Processing
Collision-based flexible image encryption algorithm
Journal of Systems and Software
A secure image encryption algorithm based on Rubik's cube principle
Journal of Electrical and Computer Engineering
A novel encryption method with associative approach for gray-scale images
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Hi-index | 0.00 |
The original information in the existing security system based on the fractional Fourier transform (FRFT) is essentially protected by only a certain order of FRFT. In this paper, we propose a novel method to encrypt an image by multiorders of FRFT. In the image encryption, the encrypted image is obtained by the summation of different orders inverse discrete FRFT of the interpolated subimages. And the original image can be perfectly recovered using the linear system constructed by the fractional Fourier domain analysis of the interpolation. The proposed method can be applied to the double or more image encryptions. Applying the transform orders of the utilized FRFT as secret keys, the proposed method is with a larger key space than the existing security systems based on the FRFT. Additionally, the encryption scheme can be realized by the fast-Fourier-transform-based algorithm and the computation burden shows a linear increase with the extension of the key space. It is verified by the experimental results that the image decryption is highly sensitive to the deviations in the transform orders.