Advanced
Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images
Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images
Journal of the Optical Society of Korea. 2014. Apr, 18(2): 129-133
Copyright © 2014, Journal of the Optical Society of Korea
  • Received : March 03, 2014
  • Accepted : March 03, 2014
  • Published : April 25, 2014
Download
PDF
e-PUB
PubReader
PPT
Export by style
Share
Article
Author
Metrics
Cited by
TagCloud
About the Authors
In-Ho Lee
Myungjin Cho
mjcho@hknu.ac.kr
Abstract
In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.
Keywords
I. INTRODUCTION
In data transmission, encryption techniques are necessarily required in order to prevent unauthorized access. Thus, encryption techniques have been widely studied [1 - 18] .In particular, optical encryption techniques with an advantage in terms of the encryption speed have been well researched [5 - 16] . Double random phase encryption (DRPE), which is the most widely used optical encryption technique, has been proposed [5] . It can be implemented easily and its speed of encryption is faster than that of non-optical encryption methods. DRPE employs two independent random phase masks to encrypt the primary image. Although such an optical encryption technique improves the security of the transmission information, color information cannot be handled in decryption since the primary image is illuminated with monochromatic light [19] .
DRPE-based encryption techniques for a color image have been presented [19 , 20] . The color image encryption using fractional Fourier transforms [19] and the color image encryption by wavelength multiplexing based on lensless Fresnel transform holograms [20] have been proposed. In these techniques, the color image is separated into red, green, and blue components, and they are independently encrypted. Also, these techniques use many keys for both encryption and decryption. Though the data security can improve with an increase in the number of keys or the length of keys, the encryption and decryption system can become more complicated as the amount of key information rises.
In this paper, we propose a simple DRPE-based orthogonal encoding technique for color image encryption. In the proposed technique, a color image is segregated into red, green, and blue components before encryption and each of the components is independently encrypted, analogous to the previous encryption techniques. However, we employ DRPE using the same key in encrypting three components in order to reduce the complexity of encryption and decryption, unlike the previous cases. In addition, we adopt a Hadamard matrix [21] with orthogonal property in order to encode the encrypted data in each of red, green, and blue channels. The orthogonal encoding scheme is able to enhance the security of DRPE using the same key for three components at the expense of a little complexity. Furthermore, the orthogonal encoder is easy to implement because it consists of simple linear operations. Therefore, the proposed DRPE-based orthogonal encoding technique can be a low-complexity and effective encryption technique for color images.
The paper is organized as follows. First we briefly present the DRPE in Section II. Then, the orthogonal encoding technique using DRPE is described in Section III. To show the effects of DRPE-based orthogonal encoding technique, simulation results are provided in Section IV. Finally, we conclude the paper with a summary in Section V.
II. DOUBLE RANDOM PHASE ENCRYPTION
Optical encryption has many advantages such as the parallel processing of optical systems, the fast processing time, and the data handling in various domains. One of the optical encryption methods, double random phase encryption (DRPE), uses two sets of random phase information. Let us consider the encryption of a one-dimensional signal for simplicity. Figure 1(a) shows the optical schematic setup of DRPE for encryption. Let s ( x ) be the primary data. Then, for encryption, we use two uniformly distributed random noises over [0, 1] which are ns ( x ) in the spatial domain and nf ( μ ) in the spatial frequency domain. First, the random phase noise, exp[ i 2 π ns ( x )] multiplies the primary data, s ( x ). Then, this data passes through lens 1 which means a Fourier transform of s ( x )exp[ i 2 πns ( x )]. To obtain the convolution result between s ( x )exp[ i 2 πns ( x )] and h ( x ) where the Fourier transform of h ( x ) is
PPT Slide
Lager Image
{ h ( x )}=exp[ i 2 πnf (μ)], their Fourier transforms are multiplied by each other. Finally, the inverse Fourier transform of this data can be recorded through lens 2. That is, the encrypted data by DRPE, se ( x ) is a complex-valued function as the following: [13]
PPT Slide
Lager Image
where
PPT Slide
Lager Image
and
PPT Slide
Lager Image
mean Fourier transform and inverse Fourier transform, respectively. By the characteristics of complex-valued function, encrypted data has amplitude and phase, i.e., se ( x ) = | se ( x )|exp[ iφe ( x )].
PPT Slide
Lager Image
Optical schematic setup of double-random-phase encryption technique for (a) encryption and (b) decryption.
Figure 1(b) illustrates the optical schematic setup of DRPE for decryption. To decrypt the primary data, encrypted data as shown in Eq. (1) is multiplied by the complex-conjugate of the Fourier transform of h ( x ) as the following: [13]
PPT Slide
Lager Image
III. DRPE-BASED ORTHOGONAL ENCODING TECHNIQUE
Figures 2(a) and (b) show the orthogonal encoding procedure using DRPE for encryption and decryption, respectively. As shown in Fig. 2(a) , the primary color image, p ( x ), is decomposed into red, green, and blue components, sR ( x ), sG ( x ), and sB ( x ), before DRPE. Then, the DRPE of the three components is independently performed, but with the same key information, as depicted in Fig. 2(a) . Thus, after DRPE, three encrypted data,
PPT Slide
Lager Image
x ,
PPT Slide
Lager Image
x , and
PPT Slide
Lager Image
x , are obtained in red, green, and blue channels, respectively. Then, three encoded data, cR ( x ), cG ( x ), and cB ( x ), are obtained by encoding the encrypted data of red, green, and blue channels, respectively, with the orthogonal code. Note that the encrypted and encoded data are complex-valued.
To acquire the primary color image, first the three encoded data are independently decoded with the orthogonal property used in the encoder, and then the three decoded data,
PPT Slide
Lager Image
( x ),
PPT Slide
Lager Image
( x ), and
PPT Slide
Lager Image
( x ), are decrypted as depicted in Fig. 2(b) . Finally the three decrypted data,
PPT Slide
Lager Image
( x ),
PPT Slide
Lager Image
( x ), and
PPT Slide
Lager Image
( x ), are composed to obtain the color image.
For orthogonal encoding and decoding, we use the Hadamard matrix of order 2, denoted by H 2 , with the orthogonal property as the following equation [21] :
PPT Slide
Lager Image
where H 2 =[1 1; 1 -1], I 2 denotes the 2×2 identity matrix, and H T is the transpose of H . Using the Hadamard matrix in the encoder, the real and imaginary parts of the encrypted data are encoded as follows:
PPT Slide
Lager Image
where rre ( x ), rim ( x ) are the real and imaginary parts of the encrypted data [ se ( x )] and c 1 (x), c 2 ( x ) are the first and second encoded data, respectively. Furthermore, the factor 1/2 is multiplied for normalization of the factor 2 shown in Eq. (3). Finally the complex-valued encoded data, c ( x )= c 1 ( x ) + jc 2 ( x ), is obtained from the real-valued encoded data, c 1 ( x ) and c 2 ( x ). The encrypted and encoded data, se ( x ) and c ( x ), represent the encrypted and encoded data in each of red, green, and blue channels, respectively. It is noted that in the proposed orthogonal encoding technique we encode the real and imaginary parts of the encrypted data because they are independent from each other.
PPT Slide
Lager Image
DRPE-based orthogonal encoding procedure. (a) encryption and (b) decryption.
PPT Slide
Lager Image
Orthogonal (a) encoder structure and (b) decoder structure.
In the decoder, the real and imaginary parts of the encoded data, c ( x ), are decoded using the Hadamard matrix and the following equation:
PPT Slide
Lager Image
where
PPT Slide
Lager Image
( x ) and
PPT Slide
Lager Image
( x ) are the decoded data of c1 ( x ) and c 2 ( x ). By replacing c 1 ( x ) and c 2 ( x ) in Eq. (5) with ones in Eq. (4), we obtain
PPT Slide
Lager Image
( x ) = rre and
PPT Slide
Lager Image
( x ) = rim ( x ). Then, the complex-valued decoded data,
PPT Slide
Lager Image
( x ) =
PPT Slide
Lager Image
( x )+ j
PPT Slide
Lager Image
( x ), is obtained using the real-valued decoded data,
PPT Slide
Lager Image
( x ) and
PPT Slide
Lager Image
( x ). The decoded data,
PPT Slide
Lager Image
( x ), includes three color components; red, green, and blue.
Figures 3(a) and (b) depict the linear operations of the encoder in Eq. (4) and the decoder in Eq. (5), respectively. As shown in these figures, the structures of the encoder and decoder are the same except for the normalization factor and consist of simple linear operations, so that the orthogonal encoder and decoder are easy to implement.
IV. SIMULATION RESULTS
For simulations, we consider a color image with 1350(H) ×1350(V) pixels in Fig. 4 . The color image is captured by digital camera with 50 mm imaging lens. Figures 4(a) ~ (d) show the primary color image and its separated color channel (R, G, and B) images, respectively. The primary color image and the three separated images correspond to p ( x ), sR ( x ), sG ( x ), and sB ( x ) in Fig. 2 , respectively, and their encrypted and encoded images correspond to
PPT Slide
Lager Image
( x ),
PPT Slide
Lager Image
( x ),
PPT Slide
Lager Image
( x ), cR ( x ), cG ( x ), and cB ( x ) in Fig. 2 , respectively. Figure 5 demonstrates that the encoded images by orthogonal encoding are well encrypted like the encrypted images by DRPE.
PPT Slide
Lager Image
Primary color image with (a) full color channels, (b) red channel, (c) green channel, and (d) blue channel.
PPT Slide
Lager Image
Simulation results of DRPE-based orthogonal encoding for a color image. (a) encrypted image of red channel, (b) encrypted image of green channel, (c) encrypted image of blue channel, (d) encoded image of red channel, (e) encoded image of green channel, and (f) encoded image of blue channel.
Figure 6 shows the decrypted images without decoding, by simulation. Figures 6(a) ~ (c) show the decrypted images of red, green, and blue channels without decoding, respectively. When no decoding is used, the complex-valued encoded data are directly decrypted, i.e.,
PPT Slide
Lager Image
( x ) = cR ( x ),
PPT Slide
Lager Image
( x ) = cG ( x ), and
PPT Slide
Lager Image
( x ) = cB ( x ) in Fig. 2 , and it is assumed that the key information used for DRPE is perfectly known in decrypting the encoded data. From Figs. 6(a) ~ (d) , it is observed that the decrypted images without decoding are still encrypted ones even though the decryption is done with the perfect key information. On the other hand, when the key information of DRPE is known, the decrypted images with decoding as shown in Figs. 7(a) ~ (d) perfectly match with the primary images in Figs. 4(a) ~ (d) .
PPT Slide
Lager Image
Simulation results of decryption of DRPE-based orthogonal encoding for a color image without decoding. (a) decrypted image of red channel, (b) decrypted image of green channel, (c) decrypted image of blue channel, and (d) decrypted full color image.
PPT Slide
Lager Image
Simulation results of decryption of DRPE-based orthogonal encoding for a color image with decoding. (a) decrypted image of red channel, (b) decrypted image of green channel, (c) decrypted image of blue channel, and (d) decrypted full color image.
Table 1 shows mean square error (MSE) results for the images as shown in Figs. 4 ~ 6 , where it is assumed that the pixel intensity (integer value) range of each image is from 0 to 255. The values of three different columns in Table 1 are MSE results between primary and encoded images, between encrypted and encoded images, and between primary and incorrectly decrypted images for red channel, green channel, and blue channel, respectively. From MSE results, it is illustrated that compared images are clearly different from each other.
MSE results for the images as shown in Figs. 4-6
PPT Slide
Lager Image
MSE results for the images as shown in Figs. 4-6
V. CONCLUSION
In this paper, we have proposed the DRPE-based orthogonal encoding technique for encryption of color images. To encrypt each of red, green, and blue components of a color image, the proposed orthogonal encoding technique employs DRPE with the same key and the orthogonal encoding scheme that uses the simple linear operations with a little complexity. Also, for decryption, we provide the orthogonal decoding scheme that has the same structure as the encoding scheme. The simulation results show that the proposed orthogonal encoding technique provides the powerful encryption effects in the absence of the orthogonal decoding although the key information of DRPE is perfectly known. Hence, the proposed orthogonal encoding technique can be used as a low-complexity and effective encryption technique for color images.
Acknowledgements
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2013-067321) and this research was supported in part by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2013R1A1A20 57549).
References
Menezes A. , Okamoto T. , Vanstone S. 1993 “Reducing elliptic curve logarithms to logarithms in a finite field,” IEEE Trans. Inf. Theory 39 1639 - 1646
Rackoff C. , Simon D. 1991 “Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack,” in Proc. Crypto’ 91 433 - 444
Tsuji S. , Itoh T. 1989 “An ID-based cryptosystem based on the discrete logarithm problem,” IEEE Journal on Selected Areas in Communication 7 467 - 473
Tanaka H. 1987 “A realization scheme for the identity-based cryptosystem,” in Proc. Crypto’ 87 341 - 349
Refregier P. , Javidi B. 1995 “Optical-image encryption based on input plane and Fourier plane random encoding,” Opt. Lett. 20 767 - 769
Matoba O. , Javidi B. 1999 “Encrypted optical storage with angular multiplexing,” Appl. Opt. 38 7288 - 7293
Nomura T. , Javidi B. 2000 “Optical encryption system with a binary key code,” Appl. Opt. 39 4783 - 4787
Singh M. , Kumar A. , Singh K. 2008 “Secure optical system that uses fully phase-based encryption and lithium niobate crystal as phase contrast filter for decryption,” Opt. Laser Technol. 40 619 - 624
Liu Z. , Li S. , Yang M. , Liu W. , Liu S. 2012 “Image encryption based on the random rotation operation in the fractional Fourier transform domains,” Opt. Lasers Eng. 50 1352 - 1358
Joshi M. , Shakher C. , Singh K. 2010 “Fractional Fourier transform based image multiplexing and encryption technique for four-color images using input images as keys,” Opt. Commun. 283 2496 - 2505
Liu Z. , Xu S.L. , Lin C. , Dai J. , Liu S. 2011 “Image encryption scheme by using iterative random phase encoding in gyrator transform domains,” Opt. Lasers Eng. 49 542 - 546
Monaghan D.S. , Gopinathan U. , Naughton T.J. , Sheridan J.T. 2007 “Key-space analysis of double random phase encryption technique,” Appl. Opt. 46 6641 - 6647
Perez-Cabre E. , Cho M. , Javidi B. 2011 “Information authentication using photon-counting double-random-phase encrypted images,” Opt. Lett. 36 22 - 24
Sarkadi T. , Koppa P. 2012 “Quantitative security evaluation of optical encryption using hybrid phase- and amplitudemodulated keys,” Appl. Opt. 51 745 - 750
Ujvári T. , Koppa P. , Lovasz M. , Varhegyi P. , Sajti S. , Lorincz E. , Richter P. 2004 “A secure data storage system based on phase-encoded thin polarization holograms,” J. Opt. A: Pure Appl. Opt. 6 401 - 411
Koppa P. 2007 “Phase-to-amplitude data page conversion for holographic storage and optical encryption,” Appl. Opt. 46 3561 - 3571
Liu Z. , Yang M. , Liu W. , Li S. , Gong M. , Liu W. , Liu S. 2012 “Image encryption algorithm based on the random local phase encoding in gyrator transform domains,” Opt. Commun 285 3921 - 3925
Cho M. , Javidi B. 2013 “Three-dimensional photon counting double-random-phase encryption,” Opt. Lett. 38 3198 - 3201
Joshi M. , Singh K. 2007 “Color image encryption and decryption using fractional Fourier transform,” Opt. Commun. 279 35 - 42
Chen L.F. , Zhao D.M. 2006 “Optical color image encryption by wavelength multiplexing and lensless Fresnel transform holograms,” Opt. Express 14 8552 - 8560
Sylvester J.J. 1867 “Thoughts on orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colors, with applications to Newton’s rule, ornamental tilework, and the theory of numbers,” Phil. Mag. 34 461 - 475