Joint image compression–encryption using

discrete fractional transforms

N. Jindal* and K. Singh
Exchange of data in the form of text and image on internet is in fast progression and it is spawning
new compression and encryption algorithms for bandwidth and security respectively. We have
proposed a new kind of joint algorithm using discrete fractional transforms for compression–
encryption of image. In this algorithm, the discrete fractional Fourier transform which is discrete
version of fractional Fourier transform, is used to compress the images with variation of its
parameter ‘a’ (order of transform). The compressed image is encrypted using discrete fractional
cosine transform to provide security. The advantage of this method is its feasible implementation
in practice, superior, robustness, security and sensitivity of keys, which has a good prospect and
practicability in information security field. Results of computer simulations are presented to verify
the validity of the proposed method such as mean square error (MSE) and peak signal to noise
ratio between the original image and decrypted image. Sensitivity for right decryption key is
proved with respect to MSE.
Keywords: Compression, DFrFT, DFrCT, Encryption, MSE

Introduction fractional cosine transforms (DFrCTs). The section on

Digital image processing techniques, compression1–3 and
encryption4,5 are becoming very imperative issues in
communication as bandwidth and security are of utmost
concern respectively. Compression of images for efficient
use of storage space and transmission bit rate has become
a necessity. Image compression using discrete cosine
transform (DCT),6 fractional Fourier transform (FrFT)
and set partitioning in hierarchical tree (SPIHT),7
fractional Fourier transform,8 etc. provides low bit
rate representation by preserving a high visual quality
of decompressed image. Encryption ensure privacy
using improper Hartley transforms,9 fractional Mellin
transform,10 multiple order discrete fractional Mellin
transform,11 simplified fractional Hartley transforms,12
based on phase retrieval algorithm13 and various other
methods.14–18 Several transforms are implemented in the
past decade by optical instruments.19–22 Because of the
importance of transforms, its implementation in signal
processing has become an important issue. The motiva-
tion of our research for joint compression–encryption
using discrete fractional Fourier transforms (DFrFTs) is
from23 which combine discrete wavelet transform for
compression and block cipher data encryption standard
for image encryption. It has been proved elsewhere23 that
joint effort improves transmission rate and security.
This paper is organised into six sections. The section on
‘Fractional operations’, presents preliminaries about
fractional operations, FrFTs, DFrFTs and discrete
Department of ECE, Thapar University, Patiala 147004, Punjab, India
*Corresponding author, email neerusingla99@gmail.com
‘DFrFT for compression/decompression’, describes com-
pression using DFrFT. Then, the encryption using
DFrCT is discussed in the section on ‘DFrCT for
encryption/decryption’. In the section on ‘Joint image
compression-encryption algorithm’, we develop a joint
image compression–encryption model and present com-
puter simulation results to verify its efficiency and
performance for security. Final conclusions are made in
the section on ‘Conclusions’.
Fractional operations
Going from the whole of an entity to its fractions
represents a relatively major conceptual leap. The fourth
power of 3 may be defined as 3453636363, but it
is not obvious from this definition how 33?5 might
be defined. It must have taken sometime before the
common definition 33?5537/25!37 emerged. The first and
second derivatives of the function (x) are commonly
marked set by df (x)/dx and as in equation (1)
   2
d2 f ðxÞ d df ðxÞ d½df ðxÞ=dx d
~ ~ ~ f ðxÞ (1)
dx dx dx dx dx
respectively. Similarly, higher order derivatives are
defined. Let (m) denote the Fourier transform (FT) of
f(x). The FT of the nth derivative of f (x), dn f(x)=dxn is
known to be given by (i2pm)n (m), for any positive
integer n. Now, let us generalise this property by
replacing n with the real-order a and take it as the ath
derivative of f (x). Thus to find da f(x)=dxa , the ath
derivative of f (x), find the inverse Fourier transform of

ß 2014 RPS
Received 29 November 2011; accepted 3 September 2013
DOI 10.1179/1743131X13Y.0000000062 The Imaging Science Journal 2014 VOL 62 NO 5 265
Jindal and Singh Joint image compression–encryption

(i2pm)a (m). Both of these examples deal with the

fractions of an operation performed on an entity, rather
:
than fractions of the entity itself. The function ½f(x)0 5 is
the square root of the function f (x). However,
: :
d0 5 f(x)=dx0 5 is the 0?5th derivative of f (x),
:
ðdf(x)=dxÞ0 5 being the square root of the derivative
operator d/dx.24
Fractional Fourier transforms is the generalisation of
conventional Fourier transforms. Fractional Fourier
transform is mainly used in the area of signal processing
owing to its potential. The FrFT mainly depends on
parameter a and can be interpreted as a rotation by an
angle a in the time frequency plane.25 An FrFT with a5
p/2 corresponds to classical Fourier transform, and an
FrFT with a50 corresponds to identity operator. The
computation of the FrFTs corresponds to following steps:
(i) a product by a chirp
(ii) a Fourier transform 1 CR vs PSNR of rice image for DFrFT and DFrCT
(iii) another product by a chirp
(iv) a product by a complex amplitude factor.
Since chirps have constant magnitude, this immediately
allows making a general statement about the existence of chirp multiplication operations and one Fast Fourier
transform. The two-dimensional (2D) FrFT of a transform. Thus the total number of multiplication
function with separable kernel is applied separately in operation required is 2Pz(P/2) log 2(P) where
both directions ‘m’ and ‘p’ is defined as follows24 in P52Mz1, is the length of output.27 Though the method
equation (2) does not satisfy the additivity property, it is possible to
convert the transform result of one order to another
ð
? ð
?
order by two chirp multiplications and one convolution
Fom on ½f ðm,nÞðp,qÞ~ Kom on ðm,n : p,qÞf ðm,nÞdmdn (2) operation. In comparison with results of continuous
{? {? FrFT, the error involved in this method of DFrFT
with the kernel Kom on ðm,n : p,qÞ~Kom ðm,pÞKon ðn,qÞ computation is the order of 1026–10214.21
Ð
?
Discrete fractional cosine transform
The one-dimensional FrFT is defined as: Fom ~ f(m)
ko ðm,nÞdmdn and {? The application of fractional version of cosine transform
called DFrCT for image encryption is fairly new.
Ko ðm,nÞ~ Discrete fractional cosine transform shares many useful
0    1 properties of regular DCT and it has additional free
Aam exp ip m2 cot am {2mp csc am zp2 cot am if am =np
B C parameter, its fraction. When it is 0, we get cosine
B dðm{pÞif am ~2np C modulated version of input signal. When it is unity, we
@ A
dðmzpÞif am ~ð2nz1Þp get conventional DCT. As the fraction changes from 0
to 1, we get different forms of signals which interpolate
e{i½p sgn(am )=4{am =2 between cosine modulated form of signal and its DCT
and Aam ~ signal representation. The steps for constructing the N-
(jsin aj)1=2
point DFrCT with angular parameter a are as follows.28
Step 1. Compute Mc point discrete Fourier transform
where am ~om p=2 is the angle corresponding to the (DFT) Hermite even eigenvectors. where, Mc52(N–1)
transform order along the x-axis. The kernel along Step 2. Use Step 1 to find the DCT-I eigenvectors
y-axis Kan ðn,qÞ has the same form by simply substituting from the DFT Hermite even eigenvectors.
n for m and q for p respectively. Step 3. Find the DFrCT transform kernel by the
2a=
Discrete fractional Fourier transform equation:CN,a ~VN DN p VNt , where VN5[|v0|v2|…|v2N–2|].
When FrFT is analysed in discrete domain; there are Vk is the DCT-I eigenvector obtained from the kth
many definitions of DFrFT. Santhanam and McClellan order DFT Hermite eigenvectors by equation: V ~
 pffiffiffi pffiffiffi T
first reported the work on DFrFT in 1995.26 Thereafter v0 , 2v1 ,:::, 2vN{2 ,vN{1 .
within a short span of time a lot of definitions of DFrFT The FrFT and FrCT can be used for image
came into existence and these definitions are classified compression and their results were much better than
according to the methodology used for calculations in that of FT.2 It was also shown that DFrFT gives better
2000 by Pei and Ding.27 Discrete fractional Fourier results than DFrCT in case of compression when
transform is an orthogonal transform with chirp as basis quantisers are optimised. Figure 1 plots the peak signal
signal. To derive FrFT, ath power of eigen values is to noise ratio (PSNR) vs compression ratio (CR) for rice
appropriately chosen and to derive DFrFT, these eigen image and clearly reflects the superior performance of
functions are discretised. However, this method puts DFrFT performed in compression.29 The value of
certain constraints on the signal-sampling rate and it PSNR varies for different test images at different CRs,
lacks fast computation algorithm.27 The concept of but DFrFT always show high PSNR in comparison with
DFrFT computation27 is straightforward. There are two DFrCT in proposed algorithm.

266 The Imaging Science Journal 2014 VOL 62 NO 5

 Jindal and Singh Joint image compression–encryption

2 Block diagram for image compression-decompression using DFrFT

DFrFT for compression/decompression particular CR. At decoder simply inverse process of

encoder is performed by using inverse 2D DFrFT. The
The use and reliance on computers by human is growing performance of DFrFT is illustrated on images of Lena,
at explosive rate, compression of images30 is of great Cameraman, IC, Barbara and Rice with 2566256
interest, where efficiency with respect to data storage pixels. These images are compressed for CRs of 10, 20,
and transmission bandwidth is sought. The cost of 30, 40, 50 and 75% for varying values of a. We observed
implementing the FrFT is similar to the cost of that the optimum compression performance is achieved
implementing the ordinary Fourier transform.2 The for values of ‘a’ varying between 0?91 and 0?97. The
one-dimensional DFrFT is useful in processing single- optimised value of ‘a’ is dependent both on image and
dimensional signals such as speech waveforms and for 2D the CR. Figure 3 from29 is the comparative plot between
image, 2D DFrFT is used for compression. In the case of
2D DFrFT we have to consider two angles of rotation,
the order along x and y direction. We have taken
ax5ay5a, i.e. in both directions order is the same. The
block diagram for image compression-decompression
using DFrFT is shown in Fig. 2.
At the encoder side, an image is first partitioned into
non-overlapped n6n subimages. The most popular
subimage sizes are 868, 16616. In the proposed
implementation scheme subimage size chosen is 868.
In second step, a 2D DFrFT is applied to each block to
convert the grey levels of pixels in the spatial domain
into coefficients in the frequency domain. Run-length
coding is used. The final step in compression process is
to quantise the transformed coefficients according to cut
off selected and value of a. By adjusting the cut off of
the transform coefficients, a compromise can be made
between image quality and compression factor. The high
CR can be achieved using the DFrFT by varying its free 4 Fractional order a vs PSNR of different images at CR
parameter a, even for same cut off. Quantisers are of 10% using DFrFT
designed for optimum value of fractional order at

3 Fractional order a vs PSNR of Lena image for different 5 Fractional order a vs PSNR of different images at CR
CRs using DFrFT of 50% using DFrFT

The Imaging Science Journal 2014 VOL 62 NO 5 267

Jindal and Singh Joint image compression–encryption
6 Fractional order a vs PSNR of different images at CR
of 75% using DFrFT
PSNR and ‘a’, for CRs of 10, 20, 30, 40, 50 and 75%
respectively. Figures 42629 shows a plot between ‘a’ and
PSNR for different images at CRs of 10, 50 and 75%
respectively.
Using the same fractional order at different CRs, the
images can be compressed. For CR of 2?5, 16 and 28%
and 2566256 image, the proposed algorithm has mean
square error (MSE) 0?0000, 0?02 and 0?063 respectively
and Alfalou et al.3 (Fig. 7a) calculated 0?0289, 0?08 and
0?122 respectively. Therefore, an improvement in MSE
0?0289, 0?078 and 0?059 respectively was obtained.
DFrCT for encryption/decryption
In electronic commerce, for exchange of information
encryption is carried out for the security of data. In the
proposed method, for encryption cascaded multistage
DFrCT with random phase filters have been utilised. A
primary image encryption technique31 involves the
process in which the primary image is encoded using
three cascaded stages of fractional order with two
intermediate randomly encoded phase masks. The n-
stage of DFrCT can provide n-dimensional extra keys
indicated by the fractional orders. In case of 2D DFrCT
transform, there are two different fractional orders
7 Block diagram for image encryption and decryption using DFrCT
268 The Imaging Science Journal 2014 VOL 62 NO
along x- and y-axis respectively. Such a system can have
n21 random phase filters, so that total encryption keys
can be increased to as many as 3n21. Thus the security
strength of the encryption keys can be greatly enhanced.
The order ‘a’ along x- and y-axis are taken to be the
same, i.e. ax5ay5a and three stages of DFrCT are
cascaded together. Thus in the intermediate planes two
randomly encoded phase masks are used.32
Let f (m0, n0), a real valued 2D data, denote the image
we want to encrypt. The image is discrete fractional
cosine transformed three times using fractional orders
a1, a2 and a3 as encryption keys. In the intermediate
stages we put two random phase masks (RPMs),R1 ðm1 ,
n1 Þ~exp½{i2pwðm1 ,n1 Þ and R2 ðm2 ,n2 Þ~exp½{i2pwðm2 ,
n2 Þ respectively serving as phase filters, where functions
w1 ðm1 ,n1 Þ and w2 ðm2 ,n2 Þ are randomly generated homo-
geneously distributed functions with values (0, 1). Thus the
resultant transformed functionyðm,nÞ can be written as in
equation (3)
yðm,nÞ~Fca3 fy2 ðm2 ,n2 ÞRðm2 ,n2 Þg (3)
with y2 ðm2 ,n2 Þ~Fca2 fy1 ðm1 ,n1 ÞRðm1 ,n1 Þg
and y1 ðm1 ,n1 Þ~Fca1 ff ðm0 ,n0 Þg
The resultant function yðm,nÞ can be regarded as the
encrypted image.32 The decryption process is the reverse
operation with respect to the encryption. First we take a
DFrCT of order –a3 on the encrypted image yðm,nÞand
multiplying the RPM R2 ðm,nÞ and then we get the
midterm function y2 ðm2 ,n2 Þ. Then we perform a DFrCT
of order –a2 on the function y2 ðm2 ,n2 Þ and multiplying
the RPM R1 ðm1 ,n1 Þ, thus function y1 ðm1 ,n1 Þ will be
recovered. After another DFrCT of order –a1 on the
function y1 ðm1 ,n1 Þ, we finally get the original image
(m0,n0). Here the random mask R2 ðm,nÞ and R1 ðm1 ,n1 Þ
are the complex conjugate of R1 ðm1 ,n1 Þ and R2 ðm2 ,n2 Þ
respectively. Figure 7 is the block diagram for image
encryption and decryption using DFrCT.
The encryption and decryption are not only sensitive
to RPMs but also to the fractional orders. Encryption
and decryption results for Barbara, cameraman, Lena
and rice images of 2566256 pixels using DFrCT are
obtained. Figure 8a is the original Lena image.
Encrypted form of this image is Fig. 8b. The encrypted
5
 Jindal and Singh Joint image compression–encryption

8 Simulation results of encryption for Lena image using DFrCT: a original Lena image; b encrypted Lena image;
c decrypted image with right key; d decrypted Image with wrong key

9 Joint model for compression–encryption using fractional orders

The Imaging Science Journal 2014 VOL 62 NO 5 269

Jindal and Singh Joint image compression–encryption

10 Simulation results of joint compression–encryption for Cameraman image using DFrFT and DFrCT respectively: a ori-
ginal Cameraman image; b compressed image (CR520%); c compressed–encrypted image; d decrypted–decompressed
image (with wrong key); e decrypted–decompressed image (with right key)

270 The Imaging Science Journal 2014 VOL 62 NO 5


11 a graph of MSE vs (–a3) and b graph of MSE vs (–a1)
image Fig. 8b is messy in nature and shows high
encryption quality. The encryption quality is expressed
in terms of the total change in pixels values between the
plain-frame and cipher-frame. Figure 8c and d shows
the simulation results of decrypted Lena image with
right and wrong key respectively.
Joint image compression-encryption
algorithm
The proposed joint approach used for image compres-
sion–encryption has several advantages in image trans-
mission. Compression before encryption will remove
redundancy of data and security will increase. Figure 9
describes the joint model of compression–encryption
method using fractional transform.
Numerical simulations have been performed on test
images Baboon, Peepers, baboon, cameraman and house to
examine the validity of this algorithm. The original image
was the picture of Cameraman with 2566256 pixels, which
is shown in Fig. 10a. Figure 10b shows the compressed
image with 20% CR and cut-off 1?23 with fractional order
(o) 0?98. This compressed image is encrypted with fractional
keys {1, 0?93, 0?8} in Fig. 10c. The other fractional orders
can be used for compression and encryption. Figure 10d
and e is the decrypted–decompressed image with wrong key
and right key respectively.
The decryption sensitivities with respect to fractional
orders are the most significant factors and have been
investigated by calculating MSE between original
primary image and decompressed–decrypted image.32,33
We observed that sensitivities of encryption keys were
more for without compression method. If r(i,j) and o(i,j)
are the retrieved and original images respectively at (i,j)
pixel, the MSE can be defined by equation (4) as the
energy of the difference image
2 random phase encoding. The RSA algorithm in Ref. 37
1 X M X N
MSE~kr{ok2 ~ jrði,j Þ{oði,j Þj (4)
M|N i~1 j~1
The curves for the MSE versus the changes of
fractional orders, –a3 and –a1 have been calculated and
depicted in Fig. 11a and b for joint compression–
encryption method. In decryption, MSE is minimum
Jindal and Singh Joint image compression–encryption
with right fractional orders. The graphical results show
that with change in the original fractional order, the
value of MSE increases in decryption. Decrypted image
is sensitive to –a3 than to a1.
The sensitivity of fractional order keys provides
security to proposed algorithm. However, compressed–
encrypted must be secured from various attacks. The
security in proposed algorithm is doubted in concern of
double random phase encoding. However, double
random phase encoding has been effectively used for
encryption34 and information hiding.35 Its weakness lies
in its linearity. The double random phase encoding
potentially insecure the algorithm against known plain-
text attack and chosen plaintext attack and Brute force
attack.
Brute force attack depends upon exhaustive keys
search and is feasible only for the cryptosystems with
relatively small key space. The value of fractional part
for each key can be increased upto any number. The
increased key space size infeasible this attack. It has
been demonstrated elsewhere36 that Brute force attack
is also intractable in concern of double random phase
encoding.
The inadequacy of proposed algorithm is its vulner-
ability to known plaintext attack and chosen cipher text
attack owing to double random phase encoding.36 A
known plaintext attack is a cryptanalytic attack in which
the cryptanalyst possess a substantial quantity of plain
images and corresponding cipher images. A chosen
cipher text attack is a cryptanalytic attack in which the
cryptanalyst can submit an unlimited number of plain
images of his own choice and examine the resulting
cipher images.
Several methods using Rivest–Shamir–Adelman
(RSA) algorithm and double random phase encoding
are considered37,38 to manage the security of double
improved the signal to noise ratio (SNR) and increase
robustness when compared with.39 The SNR calculated
by Yuan et al. is 5?66 dB. The SNR calculated with RSA
algorithm by Saini and Sinha37 is 304?73 dB. Therefore,
it has been demonstrated in Ref. 37 that improvement
of 299?07 dB is obtained. It has been also demons-
trated elsewhere37 that the RSA algorithm37 increased
The Imaging Science Journal 2014 VOL 62 NO 5 271
Jindal and Singh Joint image compression–encryption
robustness for wrong decryption key. The SNR of Yuan
et al. with wrong key remains the same and equal to
5?66 dB. The SNR of Ref.37, obtained with wrong key
decryption was 0?17 dB.
An analysis in Ref. 38 demonstrates that this method
improves security from Ref. 40, for information hiding
using double random phase encoding. In Zhou’s
method, the technical metrics are quite different from
those of composed images. It increases insecurity.
Therefore, in Ref. 38 an improved method (with random
perturbations) for effective image quality and security is
proposed. The three technical metrics are improved but
worth of composed image has been degraded. An
additional method in Ref. 38, called further improved
method is proposed and worth of composed image is
kept acceptable.
Conclusion
A joint algorithm for image compression and encryption
based on DFrFT for compression and DFrCT for
encryption is proposed. It has been observed that
DFrFT and DFrCT make the full use of the additional
degrees of freedom provided by fractional orders to
achieve an optimum domain in compression and
encryption. With change in fractional order value in –
a3 and –a1, the value of MSE changes, which shows
sensitivity of right keys. Decryption results are more
sensitive for change in –a3 as compared to –a1. The
proposed joint algorithm has an excellent feature of
robustness in security. Numerical simulations verified
the validity and efficacy of algorithm.
Acknowledgement
The authors would like to thank anonymous reviewers
for their valuable comments.
References
1. Cebrail, T. and Serder, S. An overview of image compression
approaches, Proc. 3rd Int. Conf. on Digital Telecommunication,
Koblenz, Germany, December 2008, pp. 164–208.
2. Yetik, I. S., Kutay, M. A. and Ozaktas, H. M. Image representa-
tion and compression with the fractional Fourier transform, Opt.
Commun., 2001, 197, 275–278.
3. Alfalou, A., Elbouz, M., Mansour, A. and Keryer, G. New spectral
image compression method based on an optimal phase coding and
the RMS duration principle, J. Opt., 2010, 12, 115403.
4. Liu, Z., Li, Q., Dai, J., Sun, X., Liu, S. and Ahmad, M. A. A new
kind of double image encryption by using a cutting spectrum in the
1-D fractional Fourier transform domains, Opt. Commun., 2009,
282, 1536–1540.
5. Hennely, B. and Sheridan, J. T. Image encryption and fractional
Fourier transform, Optik, 2003, 114, 251–265.
6. Gonzalez, R. C. and Woods, R. E. Digital Image Processing, 2004,
2nd edition (Pearson Education (Singapore) Pte. Ltd, Delhi).
7. Vijaya, C. and Bhat, J. S. Signal compression using discrete
fractional Fourier transform and set partitioning in hierarchical
tree, Signal Process., 2006, 86, 1976–1983.
8. Zhou, N. R., Wang, Y. X., Gong, L. H., He, H. and Wu, J. H.
Novel single-channel color image encryption algorithm based on
chaos and fractional Fourier transform, Opt. Commun., 2011, 284,
(12), 2789–2796.
9. Singh, N. and Sinha, A. Optical image encryption using improper
Hartley transforms and chaos, Optik, 2010, 121, (10), 918–925.
10. Zhou, N. R., Wang, Y. X. and Gong, L. H. Novel optical image
encryption scheme based on fractional Mellin transform, Opt.
Commun., 2011, 284, (13), 3234–3242.
11. Zhou, N. R., Wang, Y. X. and Wu, J. H. Image encryption
algorithm based on the multi-order discrete fractional Mellin
transform, Opt. Commun., 2011, 284, (24), 5588–5597.
272 The Imaging Science Journal 2014 VOL 62 NO 5
12. Li, X. X. and Zhao, D. M. Optical image encryption with
simplified fractional hartley transform, Chin. Phys. Lett., 2008,
25, 2477–2480.
13. Wu, J. H., Zhang, L. and Zhou, N. R. Image encryption based on
the multiple-order discrete fractional cosine transform, Opt.
Commun., 2010, 283, (9), 1720–1725.
14. Zhou, N. R., Dong, T. J. and Wu, J. H. Novel image encryption
algorithm based on multiple-parameter discrete fractional random
transform, Opt. Commun., 2010, 283, (15), 3037–3042.
15. Hennely, B. and Sheridan, J. T. Fractional Fourier transform based
image encryption: Phase retrieval algorithm, Opt. Commun., 2003,
226, 61–80.
16. Sinha, A. and Singh, K. Image encryption by using fractional
Fourier transform and jigsaw transform in image bit planes, SPIE-
Int. Soc. Opt. Eng., 2005, 44, 15–18.
17. Wang, X., Zhao, D. and Chen, L. Image encryption based on
extended fractional Fourier transform and digital holography
technique, Opt. Commun., 2006, 260, 449–453.
18. Zhu, B. and Liu, S. Optical image encryption based on multi
fractional Fourier transform, Opt. Lett., 2000, 25, 1159–1161.
19. Liu, Z. and Liu, S. Random fractional Fourier transform, Opt.
Lett., 2007, 32, 2088–2090.
20. Liu, Z., Zhao, H. and Liu, S. A discrete fractional random
transform, Opt. Commun., 2005, 255, 357–365.
21. Z. Liu and S. Liu: Randomization of the Fourier transform, Opt.
Lett., 2007, 32, 478–480.
22. Liu, Z., Ahmad, M. A. and Liu, S. A discrete fractional angular
transform, Opt. Commun., 2008, 281, 1424–1429.
23. Dang, P. P. and Chau, P. M. Image encryption for secure internet
multimedia applications, IEEE Trans. Consum. Electron., 2000, 46,
(3), 395–403.
24. Ozaktas, H. M., Zalevsky, Z. and Kutay, M. A. The Fractional
Fourier Transform with Applications in Optics and Signal
Processing, 2000 (John Wiley & Sons Ltd, New York).
25. Almeida, B. L. The fractional Fourier transform and time-
frequency representations’, Proc. IEEE Trans. Signal Process.,
1994, 42, 3084–3091.
26. Santhanam, B. and McClellan, J. H. The DRFT-A rotation in time
frequency space, Proc. ICASSP, 1995, 5, 921–924.
27. Pei, S. C. and Ding, J. J. Closed form discrete fractional and affine
Fourier transforms, IEEE Trans. Signal Process., 2000, 48, 1338–
1353.
28. Pei, S. C. and Yeh, M. H. The discrete fractional cosine and sine
transforms, IEEE Trans. Signal Process., 2001, 49, 1198–1207.
29. Singh, K. Performance of discrete fractional Fourier transform
classes in signal processing applications, PhD thesis, Thapar
University, Patiala, 2006.
30. Saha, S. Image compression-from DCT to Wavelets: a review, The
ACM Student Magazine, 2000.
31. Tao, R., Xin, Y. and Wang, Y. Double image encryption based on
random phase encoding in the fractional Fourier domain, Opt.
Express, 2007, 15, 16067–16079.
32. Liu, S., Yu, L. and Zhu, B. Optical image encryption by cascaded
fractional Fourier transform with random phase filtering, Opt.
Commun., 2001, 187, 57–63.
33. Ozturk, I. and Sogukpinar, I. Analysis and comparison of Image
Encryption Algorithms, World Acad. Sci., Eng. Technol., 2005, 3,
26–30.
34. Jin, W. and Yan, C. Optical image encryption based on multi-
channel fractional Fourier transform and double random phase
encoding technique, Optik, 2007, 118, 38–41.
35. Sheng, Y., Xin, Z., Alam, M. S., Xi, L. and Xiao-Feng, L.
Information hiding based on double random-phase encoding and
public-key cryptography, Opt. Express, 2009, 17, (5), 3270–3284.
36. Frauel, Y., Castro, A., Naughton, T. J. and Javidi, B. Resistance of
the double random phase encryption against various attacks, Opt.
Express, 2007, 15, (6), 10253–10265.
37. Saini, N. and Sinha, A. Key management of the double random-
phase-encoding method using public-key encryption, Opt. Lasers
Eng., 2010, 48, 329–334.
38. Sang, J., Xiang, H., Fu, L. and Sang, N. Security analysis and
improvement on a double-random phase-encoding technique based
information hiding method, Opt. Commun., 2009, 282, 2307–2317.
39. Yuan, S., Zhou, X., Li, D.-H. and Zhou, D.-F. Simultaneous
transmission for an encrypted image and a double random-phase
encryption key, Appl. Opt., 2007, 46, 3747–3753.
40. Zhou, X., Lai, D., Yuan, S., Li, D.-H. and Hu, J.-P. A method for
hiding information utilizing double-random phase-encoding tech-
nique, Opt. Laser Technol., 2007, 39, (7), 1360–1363.
Copyright of Imaging Science Journal is the property of Maney Publishing and its content
may not be copied or emailed to multiple sites or posted to a listserv without the copyright
holder's express written permission. However, users may print, download, or email articles for
individual use.