# A Secure Asymmetric Optical Image Encryption Based on Phase Truncation and Singular Value Decomposition in Linear Canonical Transform Domain

Authors: Anshula Sangwan; Hukum Singh
Journal: International Journal of Optics
 (2021)

---

## Abstract

A new asymmetric optical double image encryption algorithm is proposed, which combines phase truncation and singular value decomposition. The plain text is encrypted with two-stage phase keys to obtain a uniformly distributed cipher text and two new decryption keys. These keys are generated during the encryption process and are different from encryption keys. It realizes asymmetric encryption and improves the security of the system. The unscrambling keys in the encryption operation are mainly related to plain text. At the same time, the system is more resistant to selective plain text attacks; it also improves the sensitivity of decryption keys. With the application of phase truncation, the key space expanded and the security of the cryptographic system is enhanced. The efficacy of the system is calculated by evaluating the estimated error between the input and retrieved images. The proposed technique provides innumerable security keys and is robust against various potential attacks. Numerical simulations verify the effectiveness and security of the proposed technique.


---

## Body

## 1. Introduction

With the rapid development of modern online transactions, protecting information security has become increasingly difficult. Unauthorized users may access the data, so information hiding techniques are required to conceal the multimedia data from unintended users. To overcome this problem, many encoding methods have been developed in the field of optical security, biometrics, and holographic storage. Parameters such as phase, amplitude, wavelength, frequency, and polarization have multiple degrees of freedom, thus increasing the key space. Therefore, optical techniques are the prime requirement, where a given data will be transmitted secretly on it, and any attacker in the middle cannot obtain the data. In the previous years, many encoding techniques were developed [1–6]. The double random phase encoding (DRPE) method [1] suggested by Refregier and Javidi in 1995 is the most effective image coding scheme. DRPE is an effective solution because the information is encrypted into an unrecognizable format. In DRPE, the original images are multiplied by randomly generated phase keys by using the input domain and the Fourier domain and a random phase mask (RPM) used as a security key. Use the conjugate of the encrypted image or the conjugate of the RPM to decrypt and return to tracing the optical path. In addition, DRPE - based coding methods are prolonged from Fourier transform (FT) to many other domains, such as fractional Fourier transform [7–12], Fresnel transform [13, 14], Fresnel wavelet transform [15], fractional Mellin transform [16–19], gyrator transform (GT) [20–25], gyrator wavelet transform (GWT) [26, 27], ghost Holography [28], etc.In all these techniques, the indistinguishable RPM acts as a key during the decryption process. Similarly, due to the inherent nature of attacks, symmetrical schemes are used to deal with attacks, such as chosen cipher attack (CCA), chosen plain attack (CPA), and known plain attack (KPA) [29–31] because of an immanent stretch; it faces the problem of precondition administering and conducts. To address aforesaid matter, some dissymmetric optical cryptosystems have been proposed. Qin and Peng [32] put forward one of the pioneering work about asymmetric phase reservation (PR) and amplitude-truncation (AT) techniques to make the linearity of symmetric routines better. Since the decryption keys differ from the encryption keys, the author [33] claims that the PTFT-based cryptosystem is nonlinear. In 2013 [34], a speech restoration based on the AM-FM model in the linear canonical transform (LCT) domain was proposed. One relies on linear canonical transform domain filtering; the other relies on restoring the speech signal in the LCT domain. Kumar et al. [35] proposed an asymmetric method that uses two-dimensional nonseparable linear canonical transform (2D-NSLCT) and an iterative phase retrieval algorithm for duplex image encryption. First, PRA generates an encryption security key. Here, two intensity images are combined to form a complex image. Rakheja et al. [36] proposed a duplex image encoding based on the 3D Lorenz chaotic system and QR decomposition in the two-dimensional nonseparable linear canonical transform domain. In this communication, the unconventional framework of the 2D–NSLCT extends the key-size of the initiate scheme and enhances the robustness against brute-force attacks. The phase truncation part will continue for further processing, whereas the phase reserve part is used as the decryption key. After the intermediate cipher text is multiplied by a random phase mask, the inverse two-dimensional inseparable canonical transform will be performed. The output obtained is QR decomposition to get the final cipher text and another private key. Rajput and Matoba [37] proposed optical voice encryption in the other optical domains such as fractional Fourier, Fresnel and gyrator transforms, which convert input information into different mixed space-frequency domains. They also analyzed the experimental recording conditions of the human voice and some security aspects of the scheme. Their results show that the original voice cannot be retrieved unless the correct keys and correct domain orders are used. Number of papers published in the linear canonical transform have been studied [38–49]. Wang et al. [50–61] proposed the high-dimension Lorenz chaotic system and perceptron model, a chaotic image encryption system. Image encryption and various analysis have also been performed by authors [62, 63]. They describe the algorithm flow in detail and analyze the cryptographic security. Some of the papers on image encryption in different context have been noted [64, 65].In this communication, we have introduced an unpredictable method for narrating duplex picture encryption using two-dimensional LCT and DPM besides esteem deterioration. The proposed LCT has comparable properties, such as numerous well-known scientific changes. We know that the classical DRPE experiences issue of key space and optical hub arrangement. To overcome these issues and to extend the key space, we favor utilizing a deterministic phase mask (DPM) [56, 62] rather than conventional RPM. The use of LCT has advantages such as computational ease and convenience in their optical implementation. The variations of LCT orders are achieved by rotation of the lens system because there is no need to change the distance like the optical implementation of fractional Fourier transform. The proposed scheme provides enhanced security by increasing the key space through the use of a deterministic phase mask. Such phase masks are easier to position in the decoding and provide their own security parameters.In this article, the security of the cryptosystem depends on the linear canonical transform domain. The rest of the manuscript is organized as follows: Section2 reflects the conceptual framework of the suggested scheme, Section 3 gives the proposed encryption and decryption methods, Section 4 indicates the various simulation results and robustness of DPM, and the concluding remarks are given in Section 5.


## 2. Principle

### 2.1. Generation of Deterministic Phase Mask (DPM)

The deterministic phase mask (DPM) is produced by characterizing the arrangementm , which is given by the number of subkeys (NSK) in a single stage cover, where NSK = 2m×2m. As described in [19, 66, 67], the upcoming DPM can consist of a combination of the 16 submasks Mi,j represented. DPM for the specific esteem of m = 4 is displayed in Figure 1(1)DPM=∑i=02m∑j=02mMi,jd×d,where Mi,j is defined as follows:(2)Mi,jx,y=e2iπuk⋅x+vk⋅y,where k = 1, 2, ……….. NSK (number of subkeys) and uk and vk are randomly generated in the interval [1, d], where k is defined into the interval. 1,2m.Figure 1
Generation of deterministic phase mask (DPM) form = 4.For simplicity, we display the example when the order of encryptionm=2,3 and 4. If m=2, deterministic masks are considered 256×256 with 16 NSK of size 64×64. Each DPM1 or DPM2 is combined with 16 submasks Mij, as k interval is from 1 to 4, uk and vk are randomly generated in the interval from 1 to 64. If m=3, deterministic masks 256×256 are constructed with 8 NSK of size 32×32. Each DPM1 or DPM2 is combined with 64 submasks Mi,j, k interval is from 1 to 8; uk and vk are randomly generated in interval from 1 to 32.


### 2.2. Theoretical Background of LCT

LCT is generated by ABCD transform, generalized Fresnel transform, and amplified fractional Fourier transform. LCT may be directly changing course, with three parameters characterized as follows [38, 42]:(3)LCTα,β,γfx,y=ku,v=βe−iπ/4∬∞∞expiπrx,u,y,vfx,ydxdy,where kernel rx,u,y,v=αx2+y2−2βux+vy+γu2+v2LCT(α, β, γ) [] indicate that the LCT administrator has three genuine change parameters. These three parameters are independent of (x, y) and (u, v) domains. Inverse two-dimensional LCT is written as follows:(4)LCT−α,−β,−γku,v=fx,y=βeiπ/4∬∞∞exp−iπsx,u,y,vku,vdudv,sx,u,y,v=αx2+y2−2βux+vy+γu2+v2,where LCT(−α, −β, −γ) [] denotes the inverse LCT. If α,β,γ,d=0,1,−1,0, the 2D LCT is simplified to the FT with a multiplier factor −i, where α,β and γ are constants and are related by unit determinant matrix. The elements α,β,γ convey three parameters as the order of LCT. These orders are considered as the key parameters for image encryption purposes. LCT is a unitary transform, a special case, including FT, FrFT, FrT, and operations including scaling and chirp multiplication. The optical LCT system can be implemented using an arbitrary number of thin lenses and propagate through free space. The implementation belongs to the quadratic phase system (QPS) category [68].The optical implementation of an LCT using a single lens is shown in Figure(2).Figure 2
Representation of single lens LCT.The LCT parametersα,β, and γ can be directly related to the distances d1 and d2, and the focal length f is as given below:(5)α=d1−fλfd1+d2−d1d2,β=fλfd1+d2−d1d2,γ=d2−fλfd1+d2−d1d2.


### 2.3. Singular Value Decomposition (SVD)

The SVD may be a numerical method utilized to diagonalizable matrices. It breaks down am × m real matrix A into a product of three matrices as follows [69–73]:(6)A=USVT=u1,u2,u3,…,um×σ10⋯00σ2⋯0⋮0⋱000⋯σm×v1,v2,v3,…,vmT.The matrixU and V are orthogonal matrices (i.e., UUT=1 and VVT=1) having sizes m×n and n×n, respectively, while S could be an m × n diagonal matrix with nonnegative real values called singular values. Moreover, the arrangement of USV multiplication is very critical for the input image to be recouped accurately. Amid encryption, USV is made for cipher image C (x, y). At the time of decoding, perform reverse singular value decomposition.(7)USV=SVDCx,y,ISVD=USVT.If the multiplication arrangement has been changed to [UVS], [VUS], and [VSU], you cannot recompose the image. Finally, if the multiplication order is USV, the image can be restored. Because of multiplication, order plays an important role, so if the door opener gets any components from any channel, he will not be able to determine the first image.


### 2.4. Nonlinear Phase Truncation Fourier Transform (PTFT)

PTFT can be a preparation of Fourier transform, but it has phase truncation, which means that because it only retains the amplitude (modulus part) of the Fourier spectrum, the phase part of the spectrum is truncated. Letfx,y denote the image to be encoded, LCT [ ] the operator of linear canonical transform, PT [ ] the operator of the phase truncated, and PR [ ] denote phase reservation. The phase truncation operation of the image fx,y in the two-dimensional linear canonical transform can be written as follows:(8)Fu,v=LCTfx,y=Fu,v⋅ei∅u,v.The phase truncation (PT) and the phase reservation (PR) operations can be expressed, respectively, as follows:(9)PTFu,v=Fu,v,PRFu,v=ei∅u,v.


## 2.1. Generation of Deterministic Phase Mask (DPM)

The deterministic phase mask (DPM) is produced by characterizing the arrangementm , which is given by the number of subkeys (NSK) in a single stage cover, where NSK = 2m×2m. As described in [19, 66, 67], the upcoming DPM can consist of a combination of the 16 submasks Mi,j represented. DPM for the specific esteem of m = 4 is displayed in Figure 1(1)DPM=∑i=02m∑j=02mMi,jd×d,where Mi,j is defined as follows:(2)Mi,jx,y=e2iπuk⋅x+vk⋅y,where k = 1, 2, ……….. NSK (number of subkeys) and uk and vk are randomly generated in the interval [1, d], where k is defined into the interval. 1,2m.Figure 1
Generation of deterministic phase mask (DPM) form = 4.For simplicity, we display the example when the order of encryptionm=2,3 and 4. If m=2, deterministic masks are considered 256×256 with 16 NSK of size 64×64. Each DPM1 or DPM2 is combined with 16 submasks Mij, as k interval is from 1 to 4, uk and vk are randomly generated in the interval from 1 to 64. If m=3, deterministic masks 256×256 are constructed with 8 NSK of size 32×32. Each DPM1 or DPM2 is combined with 64 submasks Mi,j, k interval is from 1 to 8; uk and vk are randomly generated in interval from 1 to 32.


## 2.2. Theoretical Background of LCT

LCT is generated by ABCD transform, generalized Fresnel transform, and amplified fractional Fourier transform. LCT may be directly changing course, with three parameters characterized as follows [38, 42]:(3)LCTα,β,γfx,y=ku,v=βe−iπ/4∬∞∞expiπrx,u,y,vfx,ydxdy,where kernel rx,u,y,v=αx2+y2−2βux+vy+γu2+v2LCT(α, β, γ) [] indicate that the LCT administrator has three genuine change parameters. These three parameters are independent of (x, y) and (u, v) domains. Inverse two-dimensional LCT is written as follows:(4)LCT−α,−β,−γku,v=fx,y=βeiπ/4∬∞∞exp−iπsx,u,y,vku,vdudv,sx,u,y,v=αx2+y2−2βux+vy+γu2+v2,where LCT(−α, −β, −γ) [] denotes the inverse LCT. If α,β,γ,d=0,1,−1,0, the 2D LCT is simplified to the FT with a multiplier factor −i, where α,β and γ are constants and are related by unit determinant matrix. The elements α,β,γ convey three parameters as the order of LCT. These orders are considered as the key parameters for image encryption purposes. LCT is a unitary transform, a special case, including FT, FrFT, FrT, and operations including scaling and chirp multiplication. The optical LCT system can be implemented using an arbitrary number of thin lenses and propagate through free space. The implementation belongs to the quadratic phase system (QPS) category [68].The optical implementation of an LCT using a single lens is shown in Figure(2).Figure 2
Representation of single lens LCT.The LCT parametersα,β, and γ can be directly related to the distances d1 and d2, and the focal length f is as given below:(5)α=d1−fλfd1+d2−d1d2,β=fλfd1+d2−d1d2,γ=d2−fλfd1+d2−d1d2.


## 2.3. Singular Value Decomposition (SVD)

The SVD may be a numerical method utilized to diagonalizable matrices. It breaks down am × m real matrix A into a product of three matrices as follows [69–73]:(6)A=USVT=u1,u2,u3,…,um×σ10⋯00σ2⋯0⋮0⋱000⋯σm×v1,v2,v3,…,vmT.The matrixU and V are orthogonal matrices (i.e., UUT=1 and VVT=1) having sizes m×n and n×n, respectively, while S could be an m × n diagonal matrix with nonnegative real values called singular values. Moreover, the arrangement of USV multiplication is very critical for the input image to be recouped accurately. Amid encryption, USV is made for cipher image C (x, y). At the time of decoding, perform reverse singular value decomposition.(7)USV=SVDCx,y,ISVD=USVT.If the multiplication arrangement has been changed to [UVS], [VUS], and [VSU], you cannot recompose the image. Finally, if the multiplication order is USV, the image can be restored. Because of multiplication, order plays an important role, so if the door opener gets any components from any channel, he will not be able to determine the first image.


## 2.4. Nonlinear Phase Truncation Fourier Transform (PTFT)

PTFT can be a preparation of Fourier transform, but it has phase truncation, which means that because it only retains the amplitude (modulus part) of the Fourier spectrum, the phase part of the spectrum is truncated. Letfx,y denote the image to be encoded, LCT [ ] the operator of linear canonical transform, PT [ ] the operator of the phase truncated, and PR [ ] denote phase reservation. The phase truncation operation of the image fx,y in the two-dimensional linear canonical transform can be written as follows:(8)Fu,v=LCTfx,y=Fu,v⋅ei∅u,v.The phase truncation (PT) and the phase reservation (PR) operations can be expressed, respectively, as follows:(9)PTFu,v=Fu,v,PRFu,v=ei∅u,v.


## 3. Proposed Cryptosystem Technique

### 3.1. Asymmetric Cryptosystem for Encryption

The input imagefx,y is multiplied by RPM, i.e., expi2πn1x,y and then linear canonical transformation is performed in the order α1, β1, γ1. Here, n1x,y is statistically independently and randomly distributed in [0, 1]. The PTFT separates the obtained complex spectrum into amplitude and phase. The amplitude-truncation (AT) value helps generate the first decryption key (DK1) and the phase truncation (PT) value, bonded with another phase mask DPM (for the set m=4), and then proceed to α2, β2, γ2 order then further take linear canonical transformed which give the encrypted image, which is further amplitude-truncated to generate a second decryption key (DK2). Also, at the conclusion, SVD is connected; steps are appearing underneath. Finally, the encrypted image Ex,y is obtained. Improper selection of any of these parameters during decryption comes out with negative results. Presence of number of encryption keys helps in making the system more secure against unauthorized attacker. The steps (Figure 3) of encryption of an input image fx,y can be expressed as follows:(10)¥u,v=PTLCTα1,β1,γ1fx,y×expi2πn1x,y,(11)Cx,y=PTLCTα2,β2,γ2¥u,v×∑i=02m∑j=02mMi,jd×d,(12)DK1u,v=ATLCTα1,β1,γ1fx,y×expi2πn1x,y,(13)DK2x,y=ATLCTα2,β2,γ2¥u,v×∑i=02m∑j=02mMi,jd×d,(14)eξ,η=SVDCx,y,where PT denotes a phase truncation operator, LCTα1,β1,γ1 and LCTα2,β2,γ2 represent the linear canonical transform of order α1,β1,γ1 and inverse linear canonical transform order α2,β2,γ2 , respectively. The decryption keys (DKs) are obtained during the encryption process. Within the proposed strategy, the two encryption keys are treated as open keys and are not utilized within the unscrambling handle. The two decoding keys utilized are given by equations (12) and (13).Figure 3
Flow chart for the encryption scheme.


### 3.2. Asymmetric Cryptosystem for Decryption

The decryption process is shown in Figure4. First, perform inverse singular value decomposition on the image, then multiply it by second decryption key (DK2), and then LCT. Then multiply with the asymmetric key DK1 again perform LCT.Figure 4
Flow chart for decryption scheme.Steps for decryption is as follows:(15)€u,v=ISVDeξ,η,fx,y=LCTα2,β2,γ2LCTα1,β1,γ1€u,v×DK1×DK2.


### 3.3. Optoelectronic Realization

An optoelectronic experimental setup of the proposed encryption scheme has appeared in Figure5. In encryption, the image fx,y and RPM are first displayed on phase only spatial light-modulator (PO-SLM) associated with the machine and lit up by a He-Ne laser source (λ = 632.8 nm). LCT order α1,β1,γ1 is performed optically. The resulting spectrum and DPM are displayed on to second PO-SLM2, which is additionally connected with the computer and after that performing an inverse LCT. The resultant spectrum is recorded by the charged coupled device (CCD) camera and stored in the computer system. The phase truncated part may be made by CCD. The amplitude-truncated part may be done by phase-shifting interferometry. In the decryption process, the digitally acquired image Ex,y is multiplied with asymmetric key DK1 is displayed on PO-SLM1 irradiated with a laser source, and then subjected linear canonical transform through, then information is displayed on SLM2 is associated with computer and intensity of the decrypted image is recorded in the output plane.Figure 5
Proposed optoelectronic encryption setup.


## 3.1. Asymmetric Cryptosystem for Encryption

The input imagefx,y is multiplied by RPM, i.e., expi2πn1x,y and then linear canonical transformation is performed in the order α1, β1, γ1. Here, n1x,y is statistically independently and randomly distributed in [0, 1]. The PTFT separates the obtained complex spectrum into amplitude and phase. The amplitude-truncation (AT) value helps generate the first decryption key (DK1) and the phase truncation (PT) value, bonded with another phase mask DPM (for the set m=4), and then proceed to α2, β2, γ2 order then further take linear canonical transformed which give the encrypted image, which is further amplitude-truncated to generate a second decryption key (DK2). Also, at the conclusion, SVD is connected; steps are appearing underneath. Finally, the encrypted image Ex,y is obtained. Improper selection of any of these parameters during decryption comes out with negative results. Presence of number of encryption keys helps in making the system more secure against unauthorized attacker. The steps (Figure 3) of encryption of an input image fx,y can be expressed as follows:(10)¥u,v=PTLCTα1,β1,γ1fx,y×expi2πn1x,y,(11)Cx,y=PTLCTα2,β2,γ2¥u,v×∑i=02m∑j=02mMi,jd×d,(12)DK1u,v=ATLCTα1,β1,γ1fx,y×expi2πn1x,y,(13)DK2x,y=ATLCTα2,β2,γ2¥u,v×∑i=02m∑j=02mMi,jd×d,(14)eξ,η=SVDCx,y,where PT denotes a phase truncation operator, LCTα1,β1,γ1 and LCTα2,β2,γ2 represent the linear canonical transform of order α1,β1,γ1 and inverse linear canonical transform order α2,β2,γ2 , respectively. The decryption keys (DKs) are obtained during the encryption process. Within the proposed strategy, the two encryption keys are treated as open keys and are not utilized within the unscrambling handle. The two decoding keys utilized are given by equations (12) and (13).Figure 3
Flow chart for the encryption scheme.


## 3.2. Asymmetric Cryptosystem for Decryption

The decryption process is shown in Figure4. First, perform inverse singular value decomposition on the image, then multiply it by second decryption key (DK2), and then LCT. Then multiply with the asymmetric key DK1 again perform LCT.Figure 4
Flow chart for decryption scheme.Steps for decryption is as follows:(15)€u,v=ISVDeξ,η,fx,y=LCTα2,β2,γ2LCTα1,β1,γ1€u,v×DK1×DK2.


## 3.3. Optoelectronic Realization

An optoelectronic experimental setup of the proposed encryption scheme has appeared in Figure5. In encryption, the image fx,y and RPM are first displayed on phase only spatial light-modulator (PO-SLM) associated with the machine and lit up by a He-Ne laser source (λ = 632.8 nm). LCT order α1,β1,γ1 is performed optically. The resulting spectrum and DPM are displayed on to second PO-SLM2, which is additionally connected with the computer and after that performing an inverse LCT. The resultant spectrum is recorded by the charged coupled device (CCD) camera and stored in the computer system. The phase truncated part may be made by CCD. The amplitude-truncated part may be done by phase-shifting interferometry. In the decryption process, the digitally acquired image Ex,y is multiplied with asymmetric key DK1 is displayed on PO-SLM1 irradiated with a laser source, and then subjected linear canonical transform through, then information is displayed on SLM2 is associated with computer and intensity of the decrypted image is recorded in the output plane.Figure 5
Proposed optoelectronic encryption setup.


## 4. Simulation Results and Discussion

### 4.1. Encryption and Decryption Results

A series of computer simulations were performed using MATLAB (version R2020a) software to verify the efficiency of the proposed approach. The size of all the plain text images and target images selected were 256 × 256. In this scheme, two grayscale images tree and baboon Figures6(a) and 6(b) of size 256 × 256 pixels have been considered. The LCT parameters are considered in the present scheme are α1=0.3,β1=0.5,γ1=0.7 and α2=0.5,β2=0.7,γ2=0.9. For simplicity, you can use these values and other integer values. Figures 6(c) and 6(d) show the grayscale encrypted image of the grayscale used in the scheme. Using the correct LCT sequence and keys, the original images are, respectively, reflected in Figures 6(e) and 6(f).Figure 6
(a, b) Input images of 256 × 256 pixels; (c, d) encrypted images; (e, f) decrypted images.
(a)(b)(c)(d)(e)(f)


### 4.2. Performance Analysis

In this section, mean squared error (MSE) and a peak signal-noise ratio (PSNR) are used as the convergence criterion in the iterative process. Iffi and fi′ denotes input and the decrypted image, then MSE is calculated as follows:(16)MSE=∑i=1Lfi−fi′2L.In equation (16), L is the sum of pixels and denotes the size of the image. The suggested strategy is very safe because all the values of DPM must be reasonably when arranging for accurate image conversion. In case any of the esteem is inaccurately chosen automatically, there is an error in MSE; hence, decrypted image is not getting. The MSE for the tree and baboon pictures is as follows: 7.7485 × 10−25 and 2.5223 × 10−25. The minimum value of MSE demonstrates a superior likeness to the tried image.PSNR measures the modification between the input imagefi and fi′ is decoded image and its equation can be written as follows:(17)PSNR=10×logL2MSE.The numerical esteem of PSNR obtained for our suggested algorithm for the tree and baboon image is 92.42 dB and 91.48 dB, respectively.


### 4.3. Relative Error (RE)

The relative error is computed between plain image and decoding image using mathematical expression represented in the following equation:(18)RE=∑x=1L∑y=1Lfix,y−fi′x,y2∑x=1L∑y=1Lfix,y2.Among them,fix,y and fi′x,y, respectively, represented the input, decrypted picture. The RE values of the algorithm used for tree and baboon images are 0.0054 and 0.0049, respectively. It can be seen from these data that it reflects that the image is obtained faithfully.


### 4.4. Key Sensitivity Analysis

Image encryption technique is sensitive to the initial values of the secret key. To obtain a sensitivity analysis of the image encryption technique, take incorrect parameters. The correct parameters areα1=0.3,β1=0.5,γ1=0.7 and α2=0.5,β2=0.7,γ2=0.9 as the orders of LCT. The responsiveness of the architecture has also been substantiated against each individual parameter. The retrieved images for erroneous values are shown in Figure 7 for the various variable of and phase masks. Figures 7(a)–7(f) correspond to an image of a tree decrypted with incorrect values. Figures 7(a) and 7(b) are decrypted image tree and baboon by using incorrect two LCT orders; Figure 7(c) and 7(d) are decrypted image using another two-wrong parameter of LCT, and Figures 7(e) and 7(f) with wrong values of DPM and RPM. Figure 8(a) is an MSE plot with the first LCT order α1=0.5, while Figure 8(b) is another graph of MSE with iteration number for the second LCT. Figure 8(c) is another plot MSE with LCT order β2=0.6 The graphs clearly reflect that the scheme is highly sensitive to the LCT order.Figure 7
(a, b) Retrieved images of tree, baboon for wrong two LCT orders; (c, d) decrypted images using another two-wrong parameter; (e, f) wrong values of DPM and RPM.
(a)(b)(c)(d)(e)(f)Figure 8
(a) MSE plots and the number of iterations of first LCT order; (b) MSE plot against the number of iterations for single image; (c) MSE plot and the number of iterations of second LCT order.
(a)(b)(c)


### 4.5. Correlation Coefficient (CC) Analysis

In this section, the correlation coefficient (CC) of two adjacent pixels in the original image and its encrypted image is examined. The CC is calculated by the following relations:(19)CC=∑i=1Nxi−x¯yi−y¯∑i=1Nxi−x¯2∑i=1Nyi−y¯2,where x¯=1/N∑i=1Nxi and y¯=1/N∑i=1Nyi. An illegitimate user cannot obtain any valid information from this statistical data. Plots of correlation distribution for randomly chosen 15,000-pixel pairs Figures 9(a), 9(d), 9(g), 9(j), and 9(m) show the input images; Figures 9(b), 9(e), 9(h), 9(k), and 9(n) show correlation distribution of input images; Figures 9(c), 9(f), 9(i), 9(l), and 9(o) correlation distribution of encrypted images, respectively. The correlation graphics of input images are different, but the correlation plots of encrypted images are similar, so based on the encryption images, it is difficult for the hacker to identify the correct image. Table 1 shows the values of horizontal, diagonal, and vertical pixels of input and encrypted images (Figure 9).Table 1
Calculation of CC value along horizontal, diagonal, and vertical of original and cipher images.
ImageOriginal imageCipher imageHorizontalDiagonalVerticalHorizontalDiagonalVerticalLena0.95620.95090.98170.00930.01210.0086Baboon0.90770.75660.81790.00770.00920.0157OPT0.94970.93540.96950.01060.00200.0092Optical image processing0.89940.85860.94650.00060.00380.0048Figure 9
Plots of correlation distribution for randomly chosen 15,000-pixel pairs; (a, d, g, j, m) of input images; (b, e, h, k, n) correlation distribution of input images; (c, f, i, l, o) correlation distribution of encrypted images.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)


### 4.6. Statistical Analysis

To demonstrate the ability to resist statistical attacks of the proposed image encryption algorithm, different kinds of statistical analysis methods are being utilized.


#### 4.6.1. Histogram Analysis

In order to obtain an effective and safe optical image encryption scheme, it should be able to encrypt different input images into an encryption form with similar histograms. The histograms of the tree, baboon, and their corresponding encrypted images are shown in Figures10(a)–10(d). We can see from the histograms point of view input images are completely different, but the histograms of the encrypted images are indistinguishable, so it is difficult for an attacker to identify the correct picture.Figure 10
Histogram plots (a) of an input tree and (b) input image of a baboon; (c, d) encrypted images of tree and baboon.
(a)(b)(c)(d)


#### 4.6.2. Entropy Analysis

Entropy (H) can be represented as follows:(20)H=−∑i=1Mpilog2pi,The chi-square value is calculated by the following equation [74–76]:(22)χtest2=∑i=0255obsi−expiexpi,wherepi represents the probability. The ideal entropy is 8. The entropies obtained from the cipher image of the baboon, tree, optical image processing, OPT, and Lena images using the proposed algorithm are nearly standard entropy, respectively. These values are near the ideal value, then the loss is insignificant, and the suggested algorithm is strongly against the entropy attack. Table 2 shows entropies of input, encrypted and decrypted, respectively.Table 2
The entropy calculations of grayscale and text images.
S. NoImageType/sizeEntropy of input imageEntropy of encrypted imageEntropy of decrypted image1BaboonJEPG/2567.05878.0005.32392TreeJEPG/2566.91818.0006.25583Optical image processingJEPG/2566.72727.6476.72724OPTJEPG/25607.62705LenaJEPG/2567.92167.83507.9216Variance is the quantitative measure of histogram analysis. In addition, histogram variances are mainly used to quantitatively examine the uniformity of an image. Lower variance means higher uniformity of an image, alternatively the better security of the particular algorithm. The mathematical expression for calculating the variance is as follows [74–76]:(21)VarianceI=1k2∑i=0k∑j=0kIi−Ij22,where k is the number of grayscale values, Ii and Ij are the number of pixels for a particular grayscale values i and, j, respectively, and I is the vector of all Ii′s and Ij′s . Variance results are tabulated in Table 3.Table 3
Histogram variance results of 5 images using the proposed cryptosystem.
S. NoImageVariance of original imageVariance of encrypted imageRef. [77]Ref. [78]Ref. [79]1.Lena38842.58245.0547244.31276.39260.702.Tree161272.20233.272———3.Optical image processing21762.61222.02———4.OPT31541.41230.593———5.Baboon628013.38228.59———The result shows our encryption scheme is better and more efficient, giving better results than others.The chi-square test is the degree of deviation between the actual observation value and the theoretical inference value of the statistical sample. The larger the chi-square value, the less conformable and on the contrary, the more it is consistent. If the two values are completely equal, the chi-square value is 0, indicating that the theoretical value is completely consistent.whereobsi is the observed frequency of i, and expi is the expected frequency of i. The expected frequency expi is as follows:(23)expi=M×N256,where M×N is the size of images.Table4 lists the test results for encrypted images. According to the chi-square distribution, χ255;0:052=293:247 and χ255;0:012=310:457; from this, we can see that for the 1% and 5% significant level, accept the hypothesis, so we can confirm that the pixel distribution is uniform.Table 4
Results of theχtest2.
S. NoImagesχtest2Result1Lena (512 × 512)232.1440Accept2Baboon (512 × 512)230.1243Accept3Tree (512 × 512)234.2467Accept4OPT (512 × 512)231.1053Accept


### 4.7. Attack Analysis

#### 4.7.1. Robustness Method Against Pixels Cropped

In an occlusion attack, some parts of the encrypted image are blocked, which will cause the encrypted image to be blurred. This leads to blurred decrypted images depending on the size of the blocked parts. Different cases have been evaluated by taking the different sizes of the filter in the encrypted image. When the encrypted image is occluded or blocked, it impacts the quality of the recovered images. The occlusion is considered by changing the encrypted image by 10%, 25%, 50%, and 75%. As the occlusion percentage increases, the quality of the restored image gradually decreases. But still, the recovered images are visible till 25%. Figure11(a) is 10% encrypted image; Figure 11(b) is occluded 25%. Similarly, 50% is occluded in Figure 11(c), 75% in Figure 11(d), and their corresponding effect is reflected in Figures 11(e) and 11(f); the MSE and CC plot with the occluded area. A larger value of MSE states a larger loss of information and degraded condition of recovered images.Figure 11
Occlusion results to the grayscale images of varying degrees of occlusion. (a) For 10% occlusion of the encrypted image. (b) For 25% occlusion of the encrypted image. (c) For 50% occlusion of the encrypted image. (d) For 75% occlusion of the encrypted image; (e) MSE plot with the percentage of the occluded area; (f) CC plot with the percentage of occluded area.
(a)(b)(c)(d)(e)(f)


#### 4.7.2. Noise Attack Analysis

The encrypted image on the stage of image processing and image transmission is susceptible to different kinds of noise. These noises have a great influence on the quality of the decryption images. In this work, we have added Gaussian noise to the encoded image. The noise interferes with the ciphered images by relation [80–82].(24)μ′ρ,σ=μu,v+kG,where μu,v is encrypted picture and μ′ρ,σ is the noised image, k is a constant factor and G is Gaussian noise with 0 and 1 standard deviation. Figures 12(a)–12(h) show the recovered images from the encrypted data distorted by Gaussian noise with standard deviations of 0.02. Figure 13 shows the plot of MSE with noise factor (k).Figure 12
Retrieved image for (a)k = 0.1; (b) k = 0.5; (c) k = 1; (d) k = 2.
(a)(b)(c)(d)Figure 13
MSE plot of images tree and baboon with varying noise factor k.


#### 4.7.3. Classical Attack Analysis

The security of a cryptographic system depends on its resistance to four basic attacks. These basic attacks are cipher text only attack, known plain text attack, chosen plain text attack, and chosen cipher text attack. Among them, chosen plain text attack is the most powerful attack. If a cryptosystem is secure against this attack, it is secure against the other three attacks. The proposed scheme has eight keys; one from a deterministic phase mask, one from RPM, and six from linear canonical transform parameters, and the scheme is highly sensitive to all these parameters. If a small change is made in these parameters, the results would be completely different. So, the proposed scheme is secure enough against chosen plain text attacks and hence against other classical attacks too. The analysis proves that the presented system is resistant to several attacks which threaten the authenticity of any cryptosystem. Hence it is a much more secure and powerful yet simple cryptosystem.In CPA, the attacker has the plain image and scheme. With respect to these, he will try the cipher image. Normally, DRPE is highly vulnerable to CPA. If an attacker chooses the Dirac delta function, which is shown in the below equation:(25)δx,y=1,x=0andy=0,0,otherwise.Dirac delta function is to be considered a single nonzero pixel at the centre of the image and all the other values are zero. In order to perform chosen plaintext analysis, created Dirac delta function is considered as plain image and cipher image calculation is given in the equation.(26)DRPEcpa=LCTβLCTαδx,y.∗DPMx,y.∗RPMx,y.From the above equation, the second secret key is easily obtained bydrpecpa. Figure 14 shows the CPA analysis of the DRPE system.Figure 14
(a) 3D plot of Dirac delta function; (b) Dirac delta function; (c) decrypted image of DRPE with CPA; (d) DRPE encrypted image with CPA; (e) encrypted image with DPM phase key.
(a)(b)(c)(d)(e)


#### 4.7.4. Speed Performance Analysis

The speed of the scheme measures the performance and the time taken by the scheme for the execution. It is important that the encryption and decryption schemes are fast enough to meet real time requirements. The scheme needs to be faster to reach the level of real time applications. The scheme has been tested against the speed by executing the scheme on a personal computer with configuration Intel (R) Core (TM) i3-2328 CPU @ 2.20 GHz–2.71 GHz, 2 GB RAM running Windows 10 on MATLAB R2020a 5 (9.6..0.1174912) 64 bit (win64), LM: 40664749. The total time taken for both encryption and decryption is 0.66 s. This time is due to the introduction of DPM. After introducing the DPM, the time taken is still very small and proves the scheme to be fast and efficient.


#### 4.7.5. Quantitative Comparison Analysis

The proposed scheme is quantitatively compared with various recent schemes in terms of entropy, execution time, and key space. Table4 gives the key space, time execution, and entropy of cipher text of various schemes. As can be seen from Table 4, the proposed scheme has the least execution time of 1.515843 seconds with a key space of RPM, DPM, and 6 keys. The cipher-text entropy value is 7.261, which indicates the randomness in the encrypted image. All these parameters demonstrate the strength and quality of the proposed encryption scheme. Table 5 reflected the quantitative comparative analysis of the proposed scheme and earlier reported schemes.Table 5
Quantitative comparison analysis.
ParametersRef [36]Ref. [25]Ref. [83]Ref. [84]Present schemeElement in key space96 (RPM + SPM)66DPM + RPM+6 (LCT order)Entropy of the encrypted image7.4527.8417.5307.9917.942Execution time3.80553 s2.8371 s——1.515843 s


## 4.1. Encryption and Decryption Results

A series of computer simulations were performed using MATLAB (version R2020a) software to verify the efficiency of the proposed approach. The size of all the plain text images and target images selected were 256 × 256. In this scheme, two grayscale images tree and baboon Figures6(a) and 6(b) of size 256 × 256 pixels have been considered. The LCT parameters are considered in the present scheme are α1=0.3,β1=0.5,γ1=0.7 and α2=0.5,β2=0.7,γ2=0.9. For simplicity, you can use these values and other integer values. Figures 6(c) and 6(d) show the grayscale encrypted image of the grayscale used in the scheme. Using the correct LCT sequence and keys, the original images are, respectively, reflected in Figures 6(e) and 6(f).Figure 6
(a, b) Input images of 256 × 256 pixels; (c, d) encrypted images; (e, f) decrypted images.
(a)(b)(c)(d)(e)(f)


## 4.2. Performance Analysis

In this section, mean squared error (MSE) and a peak signal-noise ratio (PSNR) are used as the convergence criterion in the iterative process. Iffi and fi′ denotes input and the decrypted image, then MSE is calculated as follows:(16)MSE=∑i=1Lfi−fi′2L.In equation (16), L is the sum of pixels and denotes the size of the image. The suggested strategy is very safe because all the values of DPM must be reasonably when arranging for accurate image conversion. In case any of the esteem is inaccurately chosen automatically, there is an error in MSE; hence, decrypted image is not getting. The MSE for the tree and baboon pictures is as follows: 7.7485 × 10−25 and 2.5223 × 10−25. The minimum value of MSE demonstrates a superior likeness to the tried image.PSNR measures the modification between the input imagefi and fi′ is decoded image and its equation can be written as follows:(17)PSNR=10×logL2MSE.The numerical esteem of PSNR obtained for our suggested algorithm for the tree and baboon image is 92.42 dB and 91.48 dB, respectively.


## 4.3. Relative Error (RE)

The relative error is computed between plain image and decoding image using mathematical expression represented in the following equation:(18)RE=∑x=1L∑y=1Lfix,y−fi′x,y2∑x=1L∑y=1Lfix,y2.Among them,fix,y and fi′x,y, respectively, represented the input, decrypted picture. The RE values of the algorithm used for tree and baboon images are 0.0054 and 0.0049, respectively. It can be seen from these data that it reflects that the image is obtained faithfully.


## 4.4. Key Sensitivity Analysis

Image encryption technique is sensitive to the initial values of the secret key. To obtain a sensitivity analysis of the image encryption technique, take incorrect parameters. The correct parameters areα1=0.3,β1=0.5,γ1=0.7 and α2=0.5,β2=0.7,γ2=0.9 as the orders of LCT. The responsiveness of the architecture has also been substantiated against each individual parameter. The retrieved images for erroneous values are shown in Figure 7 for the various variable of and phase masks. Figures 7(a)–7(f) correspond to an image of a tree decrypted with incorrect values. Figures 7(a) and 7(b) are decrypted image tree and baboon by using incorrect two LCT orders; Figure 7(c) and 7(d) are decrypted image using another two-wrong parameter of LCT, and Figures 7(e) and 7(f) with wrong values of DPM and RPM. Figure 8(a) is an MSE plot with the first LCT order α1=0.5, while Figure 8(b) is another graph of MSE with iteration number for the second LCT. Figure 8(c) is another plot MSE with LCT order β2=0.6 The graphs clearly reflect that the scheme is highly sensitive to the LCT order.Figure 7
(a, b) Retrieved images of tree, baboon for wrong two LCT orders; (c, d) decrypted images using another two-wrong parameter; (e, f) wrong values of DPM and RPM.
(a)(b)(c)(d)(e)(f)Figure 8
(a) MSE plots and the number of iterations of first LCT order; (b) MSE plot against the number of iterations for single image; (c) MSE plot and the number of iterations of second LCT order.
(a)(b)(c)


## 4.5. Correlation Coefficient (CC) Analysis

In this section, the correlation coefficient (CC) of two adjacent pixels in the original image and its encrypted image is examined. The CC is calculated by the following relations:(19)CC=∑i=1Nxi−x¯yi−y¯∑i=1Nxi−x¯2∑i=1Nyi−y¯2,where x¯=1/N∑i=1Nxi and y¯=1/N∑i=1Nyi. An illegitimate user cannot obtain any valid information from this statistical data. Plots of correlation distribution for randomly chosen 15,000-pixel pairs Figures 9(a), 9(d), 9(g), 9(j), and 9(m) show the input images; Figures 9(b), 9(e), 9(h), 9(k), and 9(n) show correlation distribution of input images; Figures 9(c), 9(f), 9(i), 9(l), and 9(o) correlation distribution of encrypted images, respectively. The correlation graphics of input images are different, but the correlation plots of encrypted images are similar, so based on the encryption images, it is difficult for the hacker to identify the correct image. Table 1 shows the values of horizontal, diagonal, and vertical pixels of input and encrypted images (Figure 9).Table 1
Calculation of CC value along horizontal, diagonal, and vertical of original and cipher images.
ImageOriginal imageCipher imageHorizontalDiagonalVerticalHorizontalDiagonalVerticalLena0.95620.95090.98170.00930.01210.0086Baboon0.90770.75660.81790.00770.00920.0157OPT0.94970.93540.96950.01060.00200.0092Optical image processing0.89940.85860.94650.00060.00380.0048Figure 9
Plots of correlation distribution for randomly chosen 15,000-pixel pairs; (a, d, g, j, m) of input images; (b, e, h, k, n) correlation distribution of input images; (c, f, i, l, o) correlation distribution of encrypted images.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)


## 4.6. Statistical Analysis

To demonstrate the ability to resist statistical attacks of the proposed image encryption algorithm, different kinds of statistical analysis methods are being utilized.


### 4.6.1. Histogram Analysis

In order to obtain an effective and safe optical image encryption scheme, it should be able to encrypt different input images into an encryption form with similar histograms. The histograms of the tree, baboon, and their corresponding encrypted images are shown in Figures10(a)–10(d). We can see from the histograms point of view input images are completely different, but the histograms of the encrypted images are indistinguishable, so it is difficult for an attacker to identify the correct picture.Figure 10
Histogram plots (a) of an input tree and (b) input image of a baboon; (c, d) encrypted images of tree and baboon.
(a)(b)(c)(d)


### 4.6.2. Entropy Analysis

Entropy (H) can be represented as follows:(20)H=−∑i=1Mpilog2pi,The chi-square value is calculated by the following equation [74–76]:(22)χtest2=∑i=0255obsi−expiexpi,wherepi represents the probability. The ideal entropy is 8. The entropies obtained from the cipher image of the baboon, tree, optical image processing, OPT, and Lena images using the proposed algorithm are nearly standard entropy, respectively. These values are near the ideal value, then the loss is insignificant, and the suggested algorithm is strongly against the entropy attack. Table 2 shows entropies of input, encrypted and decrypted, respectively.Table 2
The entropy calculations of grayscale and text images.
S. NoImageType/sizeEntropy of input imageEntropy of encrypted imageEntropy of decrypted image1BaboonJEPG/2567.05878.0005.32392TreeJEPG/2566.91818.0006.25583Optical image processingJEPG/2566.72727.6476.72724OPTJEPG/25607.62705LenaJEPG/2567.92167.83507.9216Variance is the quantitative measure of histogram analysis. In addition, histogram variances are mainly used to quantitatively examine the uniformity of an image. Lower variance means higher uniformity of an image, alternatively the better security of the particular algorithm. The mathematical expression for calculating the variance is as follows [74–76]:(21)VarianceI=1k2∑i=0k∑j=0kIi−Ij22,where k is the number of grayscale values, Ii and Ij are the number of pixels for a particular grayscale values i and, j, respectively, and I is the vector of all Ii′s and Ij′s . Variance results are tabulated in Table 3.Table 3
Histogram variance results of 5 images using the proposed cryptosystem.
S. NoImageVariance of original imageVariance of encrypted imageRef. [77]Ref. [78]Ref. [79]1.Lena38842.58245.0547244.31276.39260.702.Tree161272.20233.272———3.Optical image processing21762.61222.02———4.OPT31541.41230.593———5.Baboon628013.38228.59———The result shows our encryption scheme is better and more efficient, giving better results than others.The chi-square test is the degree of deviation between the actual observation value and the theoretical inference value of the statistical sample. The larger the chi-square value, the less conformable and on the contrary, the more it is consistent. If the two values are completely equal, the chi-square value is 0, indicating that the theoretical value is completely consistent.whereobsi is the observed frequency of i, and expi is the expected frequency of i. The expected frequency expi is as follows:(23)expi=M×N256,where M×N is the size of images.Table4 lists the test results for encrypted images. According to the chi-square distribution, χ255;0:052=293:247 and χ255;0:012=310:457; from this, we can see that for the 1% and 5% significant level, accept the hypothesis, so we can confirm that the pixel distribution is uniform.Table 4
Results of theχtest2.
S. NoImagesχtest2Result1Lena (512 × 512)232.1440Accept2Baboon (512 × 512)230.1243Accept3Tree (512 × 512)234.2467Accept4OPT (512 × 512)231.1053Accept


## 4.6.1. Histogram Analysis

In order to obtain an effective and safe optical image encryption scheme, it should be able to encrypt different input images into an encryption form with similar histograms. The histograms of the tree, baboon, and their corresponding encrypted images are shown in Figures10(a)–10(d). We can see from the histograms point of view input images are completely different, but the histograms of the encrypted images are indistinguishable, so it is difficult for an attacker to identify the correct picture.Figure 10
Histogram plots (a) of an input tree and (b) input image of a baboon; (c, d) encrypted images of tree and baboon.
(a)(b)(c)(d)


## 4.6.2. Entropy Analysis

Entropy (H) can be represented as follows:(20)H=−∑i=1Mpilog2pi,The chi-square value is calculated by the following equation [74–76]:(22)χtest2=∑i=0255obsi−expiexpi,wherepi represents the probability. The ideal entropy is 8. The entropies obtained from the cipher image of the baboon, tree, optical image processing, OPT, and Lena images using the proposed algorithm are nearly standard entropy, respectively. These values are near the ideal value, then the loss is insignificant, and the suggested algorithm is strongly against the entropy attack. Table 2 shows entropies of input, encrypted and decrypted, respectively.Table 2
The entropy calculations of grayscale and text images.
S. NoImageType/sizeEntropy of input imageEntropy of encrypted imageEntropy of decrypted image1BaboonJEPG/2567.05878.0005.32392TreeJEPG/2566.91818.0006.25583Optical image processingJEPG/2566.72727.6476.72724OPTJEPG/25607.62705LenaJEPG/2567.92167.83507.9216Variance is the quantitative measure of histogram analysis. In addition, histogram variances are mainly used to quantitatively examine the uniformity of an image. Lower variance means higher uniformity of an image, alternatively the better security of the particular algorithm. The mathematical expression for calculating the variance is as follows [74–76]:(21)VarianceI=1k2∑i=0k∑j=0kIi−Ij22,where k is the number of grayscale values, Ii and Ij are the number of pixels for a particular grayscale values i and, j, respectively, and I is the vector of all Ii′s and Ij′s . Variance results are tabulated in Table 3.Table 3
Histogram variance results of 5 images using the proposed cryptosystem.
S. NoImageVariance of original imageVariance of encrypted imageRef. [77]Ref. [78]Ref. [79]1.Lena38842.58245.0547244.31276.39260.702.Tree161272.20233.272———3.Optical image processing21762.61222.02———4.OPT31541.41230.593———5.Baboon628013.38228.59———The result shows our encryption scheme is better and more efficient, giving better results than others.The chi-square test is the degree of deviation between the actual observation value and the theoretical inference value of the statistical sample. The larger the chi-square value, the less conformable and on the contrary, the more it is consistent. If the two values are completely equal, the chi-square value is 0, indicating that the theoretical value is completely consistent.whereobsi is the observed frequency of i, and expi is the expected frequency of i. The expected frequency expi is as follows:(23)expi=M×N256,where M×N is the size of images.Table4 lists the test results for encrypted images. According to the chi-square distribution, χ255;0:052=293:247 and χ255;0:012=310:457; from this, we can see that for the 1% and 5% significant level, accept the hypothesis, so we can confirm that the pixel distribution is uniform.Table 4
Results of theχtest2.
S. NoImagesχtest2Result1Lena (512 × 512)232.1440Accept2Baboon (512 × 512)230.1243Accept3Tree (512 × 512)234.2467Accept4OPT (512 × 512)231.1053Accept


## 4.7. Attack Analysis

### 4.7.1. Robustness Method Against Pixels Cropped

In an occlusion attack, some parts of the encrypted image are blocked, which will cause the encrypted image to be blurred. This leads to blurred decrypted images depending on the size of the blocked parts. Different cases have been evaluated by taking the different sizes of the filter in the encrypted image. When the encrypted image is occluded or blocked, it impacts the quality of the recovered images. The occlusion is considered by changing the encrypted image by 10%, 25%, 50%, and 75%. As the occlusion percentage increases, the quality of the restored image gradually decreases. But still, the recovered images are visible till 25%. Figure11(a) is 10% encrypted image; Figure 11(b) is occluded 25%. Similarly, 50% is occluded in Figure 11(c), 75% in Figure 11(d), and their corresponding effect is reflected in Figures 11(e) and 11(f); the MSE and CC plot with the occluded area. A larger value of MSE states a larger loss of information and degraded condition of recovered images.Figure 11
Occlusion results to the grayscale images of varying degrees of occlusion. (a) For 10% occlusion of the encrypted image. (b) For 25% occlusion of the encrypted image. (c) For 50% occlusion of the encrypted image. (d) For 75% occlusion of the encrypted image; (e) MSE plot with the percentage of the occluded area; (f) CC plot with the percentage of occluded area.
(a)(b)(c)(d)(e)(f)


### 4.7.2. Noise Attack Analysis

The encrypted image on the stage of image processing and image transmission is susceptible to different kinds of noise. These noises have a great influence on the quality of the decryption images. In this work, we have added Gaussian noise to the encoded image. The noise interferes with the ciphered images by relation [80–82].(24)μ′ρ,σ=μu,v+kG,where μu,v is encrypted picture and μ′ρ,σ is the noised image, k is a constant factor and G is Gaussian noise with 0 and 1 standard deviation. Figures 12(a)–12(h) show the recovered images from the encrypted data distorted by Gaussian noise with standard deviations of 0.02. Figure 13 shows the plot of MSE with noise factor (k).Figure 12
Retrieved image for (a)k = 0.1; (b) k = 0.5; (c) k = 1; (d) k = 2.
(a)(b)(c)(d)Figure 13
MSE plot of images tree and baboon with varying noise factor k.


### 4.7.3. Classical Attack Analysis

The security of a cryptographic system depends on its resistance to four basic attacks. These basic attacks are cipher text only attack, known plain text attack, chosen plain text attack, and chosen cipher text attack. Among them, chosen plain text attack is the most powerful attack. If a cryptosystem is secure against this attack, it is secure against the other three attacks. The proposed scheme has eight keys; one from a deterministic phase mask, one from RPM, and six from linear canonical transform parameters, and the scheme is highly sensitive to all these parameters. If a small change is made in these parameters, the results would be completely different. So, the proposed scheme is secure enough against chosen plain text attacks and hence against other classical attacks too. The analysis proves that the presented system is resistant to several attacks which threaten the authenticity of any cryptosystem. Hence it is a much more secure and powerful yet simple cryptosystem.In CPA, the attacker has the plain image and scheme. With respect to these, he will try the cipher image. Normally, DRPE is highly vulnerable to CPA. If an attacker chooses the Dirac delta function, which is shown in the below equation:(25)δx,y=1,x=0andy=0,0,otherwise.Dirac delta function is to be considered a single nonzero pixel at the centre of the image and all the other values are zero. In order to perform chosen plaintext analysis, created Dirac delta function is considered as plain image and cipher image calculation is given in the equation.(26)DRPEcpa=LCTβLCTαδx,y.∗DPMx,y.∗RPMx,y.From the above equation, the second secret key is easily obtained bydrpecpa. Figure 14 shows the CPA analysis of the DRPE system.Figure 14
(a) 3D plot of Dirac delta function; (b) Dirac delta function; (c) decrypted image of DRPE with CPA; (d) DRPE encrypted image with CPA; (e) encrypted image with DPM phase key.
(a)(b)(c)(d)(e)


### 4.7.4. Speed Performance Analysis

The speed of the scheme measures the performance and the time taken by the scheme for the execution. It is important that the encryption and decryption schemes are fast enough to meet real time requirements. The scheme needs to be faster to reach the level of real time applications. The scheme has been tested against the speed by executing the scheme on a personal computer with configuration Intel (R) Core (TM) i3-2328 CPU @ 2.20 GHz–2.71 GHz, 2 GB RAM running Windows 10 on MATLAB R2020a 5 (9.6..0.1174912) 64 bit (win64), LM: 40664749. The total time taken for both encryption and decryption is 0.66 s. This time is due to the introduction of DPM. After introducing the DPM, the time taken is still very small and proves the scheme to be fast and efficient.


### 4.7.5. Quantitative Comparison Analysis

The proposed scheme is quantitatively compared with various recent schemes in terms of entropy, execution time, and key space. Table4 gives the key space, time execution, and entropy of cipher text of various schemes. As can be seen from Table 4, the proposed scheme has the least execution time of 1.515843 seconds with a key space of RPM, DPM, and 6 keys. The cipher-text entropy value is 7.261, which indicates the randomness in the encrypted image. All these parameters demonstrate the strength and quality of the proposed encryption scheme. Table 5 reflected the quantitative comparative analysis of the proposed scheme and earlier reported schemes.Table 5
Quantitative comparison analysis.
ParametersRef [36]Ref. [25]Ref. [83]Ref. [84]Present schemeElement in key space96 (RPM + SPM)66DPM + RPM+6 (LCT order)Entropy of the encrypted image7.4527.8417.5307.9917.942Execution time3.80553 s2.8371 s——1.515843 s


## 4.7.1. Robustness Method Against Pixels Cropped

In an occlusion attack, some parts of the encrypted image are blocked, which will cause the encrypted image to be blurred. This leads to blurred decrypted images depending on the size of the blocked parts. Different cases have been evaluated by taking the different sizes of the filter in the encrypted image. When the encrypted image is occluded or blocked, it impacts the quality of the recovered images. The occlusion is considered by changing the encrypted image by 10%, 25%, 50%, and 75%. As the occlusion percentage increases, the quality of the restored image gradually decreases. But still, the recovered images are visible till 25%. Figure11(a) is 10% encrypted image; Figure 11(b) is occluded 25%. Similarly, 50% is occluded in Figure 11(c), 75% in Figure 11(d), and their corresponding effect is reflected in Figures 11(e) and 11(f); the MSE and CC plot with the occluded area. A larger value of MSE states a larger loss of information and degraded condition of recovered images.Figure 11
Occlusion results to the grayscale images of varying degrees of occlusion. (a) For 10% occlusion of the encrypted image. (b) For 25% occlusion of the encrypted image. (c) For 50% occlusion of the encrypted image. (d) For 75% occlusion of the encrypted image; (e) MSE plot with the percentage of the occluded area; (f) CC plot with the percentage of occluded area.
(a)(b)(c)(d)(e)(f)


## 4.7.2. Noise Attack Analysis

The encrypted image on the stage of image processing and image transmission is susceptible to different kinds of noise. These noises have a great influence on the quality of the decryption images. In this work, we have added Gaussian noise to the encoded image. The noise interferes with the ciphered images by relation [80–82].(24)μ′ρ,σ=μu,v+kG,where μu,v is encrypted picture and μ′ρ,σ is the noised image, k is a constant factor and G is Gaussian noise with 0 and 1 standard deviation. Figures 12(a)–12(h) show the recovered images from the encrypted data distorted by Gaussian noise with standard deviations of 0.02. Figure 13 shows the plot of MSE with noise factor (k).Figure 12
Retrieved image for (a)k = 0.1; (b) k = 0.5; (c) k = 1; (d) k = 2.
(a)(b)(c)(d)Figure 13
MSE plot of images tree and baboon with varying noise factor k.


## 4.7.3. Classical Attack Analysis

The security of a cryptographic system depends on its resistance to four basic attacks. These basic attacks are cipher text only attack, known plain text attack, chosen plain text attack, and chosen cipher text attack. Among them, chosen plain text attack is the most powerful attack. If a cryptosystem is secure against this attack, it is secure against the other three attacks. The proposed scheme has eight keys; one from a deterministic phase mask, one from RPM, and six from linear canonical transform parameters, and the scheme is highly sensitive to all these parameters. If a small change is made in these parameters, the results would be completely different. So, the proposed scheme is secure enough against chosen plain text attacks and hence against other classical attacks too. The analysis proves that the presented system is resistant to several attacks which threaten the authenticity of any cryptosystem. Hence it is a much more secure and powerful yet simple cryptosystem.In CPA, the attacker has the plain image and scheme. With respect to these, he will try the cipher image. Normally, DRPE is highly vulnerable to CPA. If an attacker chooses the Dirac delta function, which is shown in the below equation:(25)δx,y=1,x=0andy=0,0,otherwise.Dirac delta function is to be considered a single nonzero pixel at the centre of the image and all the other values are zero. In order to perform chosen plaintext analysis, created Dirac delta function is considered as plain image and cipher image calculation is given in the equation.(26)DRPEcpa=LCTβLCTαδx,y.∗DPMx,y.∗RPMx,y.From the above equation, the second secret key is easily obtained bydrpecpa. Figure 14 shows the CPA analysis of the DRPE system.Figure 14
(a) 3D plot of Dirac delta function; (b) Dirac delta function; (c) decrypted image of DRPE with CPA; (d) DRPE encrypted image with CPA; (e) encrypted image with DPM phase key.
(a)(b)(c)(d)(e)


## 4.7.4. Speed Performance Analysis

The speed of the scheme measures the performance and the time taken by the scheme for the execution. It is important that the encryption and decryption schemes are fast enough to meet real time requirements. The scheme needs to be faster to reach the level of real time applications. The scheme has been tested against the speed by executing the scheme on a personal computer with configuration Intel (R) Core (TM) i3-2328 CPU @ 2.20 GHz–2.71 GHz, 2 GB RAM running Windows 10 on MATLAB R2020a 5 (9.6..0.1174912) 64 bit (win64), LM: 40664749. The total time taken for both encryption and decryption is 0.66 s. This time is due to the introduction of DPM. After introducing the DPM, the time taken is still very small and proves the scheme to be fast and efficient.


## 4.7.5. Quantitative Comparison Analysis

The proposed scheme is quantitatively compared with various recent schemes in terms of entropy, execution time, and key space. Table4 gives the key space, time execution, and entropy of cipher text of various schemes. As can be seen from Table 4, the proposed scheme has the least execution time of 1.515843 seconds with a key space of RPM, DPM, and 6 keys. The cipher-text entropy value is 7.261, which indicates the randomness in the encrypted image. All these parameters demonstrate the strength and quality of the proposed encryption scheme. Table 5 reflected the quantitative comparative analysis of the proposed scheme and earlier reported schemes.Table 5
Quantitative comparison analysis.
ParametersRef [36]Ref. [25]Ref. [83]Ref. [84]Present schemeElement in key space96 (RPM + SPM)66DPM + RPM+6 (LCT order)Entropy of the encrypted image7.4527.8417.5307.9917.942Execution time3.80553 s2.8371 s——1.515843 s


## 5. Differential Attack Analysis

The Number of Pixels Change Rate (NPCR) and Unified Average Changing Intensity (UACI): Let encrypted images before and after one pixel change in the image beE1x,y or E2x,y. The NPCR and UACI are given as follows [76]:(27)NPCR=∑x=0M−1∑y=0N−1Dx,yM×N×100%,UACI=1M×N∑x=0M−1∑y=0N−1E1x,y−E2x,y255×100%,where Dx,y is a two-dimensional array having the same size as images E1x,y or E2x,y and M and N are the width and height of the image. The matrix Dx,y is defined by E1x,y and E2x,y; if E1x,y≠E2x,y, then Dx,y=1; otherwise Dx,y=0. The ideal values of NPCR and UACI are 99.61% and 33.46%, respectively. The NPCR and UACI between E1x,y and E2x,y are computed as 97.49% and 31.20%. The calculated values of NPCR and UACI are close to the ideal values. It means that the algorithm can resist differential cryptanalysis.


## 6. Conclusion

In this contribution, it demonstrates that the simulation LCT encrypting system is capable of information security with noise-free recovery. The experimental results show that the linear canonical transform order can be considered as an extra security key. It is found that a small variation in order will lead to a large change in CC, MSE, and PSNR values. The use of DPM increases the key space also as extra security of the scheme. The proposed scheme is asymmetric and also uses the SVD operation that increases the security of the algorithm. The scheme is tested for various attacks such as occlusion and noise and it was found the scheme is not vulnerable. Numerical simulations are performed to demonstrate the feasibility and validity of this method. Key sensitivity has been analyzed by MSE curves under different decryption keys. Several possible attacks such as KPA and CPA have been considered and results demonstrate that the proposed encryption system has higher security.



---

*Source: 5510125-2021-04-16.xml*