# Computer Network Security Management of Data Encryption Technology

Authors: Caiping Sun; Weijiang Wang
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

With the continuous promotion of high and new technologies such as computers and big data, humans enter a new period-information age. Mass data and information can be transmitted and exchanged online through the network. In recent years, research on image encryption based on optical information processing technology is becoming more and more favored by researchers. In this regard, this study will focus on the research of encryption algorithms in optical images and realize encryption through fractional Fourier transform and Arnold transform. This article first introduces the research background of the subject and analyzes the current situation of the subject at home and abroad and then proposes the theoretical guidance basis for the subject research, which covers the fractional Fourier transform, Arnold transform, computational hologram, and picture evaluation index system. Finally, MATLAB simulation and performance analysis are carried out for fractional Fourier transform, Arnold transform, and holographic encryption technology. The results shows that the improved algorithm in this study performs better in the encryption and decryption process.


---

## Body

## 1. Introduction

With the popularity of mobile devices, the increase of hardware storage space, and the continuous development of computer networks, the unlimited speed and convenience of image transmission through the Internet save a lot of costs [1]. While the network provides convenience to users, it also brings great risks to users. The basic Internet protocol is not a security protocol. When the image information is finally encrypted and transmitted through the network, it can be directly exposed to the entire network [2]. This will provide criminals with a favorable criminal channel to obtain more image information on the network. Therefore, when we use image information communication, we need to strengthen network security protection measures and the research of digital image encryption technology to ensure social stability and national security issues. Most online information involves more personal privacy, such as personal private photos, patient photos, and weapon development. Once used by criminals, it will seriously affect national security [3, 4]. Data encryption technology is of great help to the Internet at this stage. This technology is to encrypt the relevant technologies of the password and then process the password for covert transmission. This is actually the core technical problem of computer security, to provide higher security for the data of the computer network.Computer-generated hologram (CGH) is a process of simulating recording and manufacturing in a computer based on the principle of optical holography. Compared with optical holography, CGH replaces the field recording of optical holography equipment, simplifies the complexity of the experiment, and can complete the recording of virtual object holograms. It has the characteristics of high repeatability, low noise, and excellent operability, which makes CGH simpler and more flexible than optical holography. Compared with traditional image encryption, CGH image encryption solves the problem of difficult key distribution in traditional image encryption technology. It is more efficient to process images and the encryption performance is improved. With the application of fractional Fourier transform, Fresnel transform, double random phase coding, and other algorithms in image encryption, the efficiency and capacity requirements of image encryption are gradually improved.Based on the above analysis, we mainly carry out in-depth research on the use of computational holography for image encryption. In the process, this article focuses on the research on encryption algorithms in optical images and implements encryption design through fractional Fourier transform and Arnold transform [5, 6].


## 2. Methods

### 2.1. Namias-Type Fractional Fourier Transform

With the application of Fourier, there are new methods and new ideas for image processing. Compared with the traditional Fourier transform method, the fractional Fourier has a wider application of order, which makes the transform order able to be applied to the fractional problem. The study of fractional Fourier makes people enjoy the great achievements that it brings and creates numerous economic and social values. Fractional Fourier has different forms, but the Namias type and Shih type are often used.The following is the one-dimensional Fourier transform method under the traditional method [7]:
(1)Gf=∫−∞∞gxe−j2πfxdx,gx=∫−∞∞Gfej2πfxdf.In formula (1), the integration processing operation process demonstrated is the Fourier integral that we are more familiar with daily. The function Gf is the Fourier transform of the function [8]. If gx is a function expression corresponding to a physical quantity in a certain space domain, then, Gf is a function expression corresponding to gx in a frequency domain. When Gf is a complex function, it can be expressed as follows:
(2)Gf=AfejΦf.After Namias-type fractional Fourier transform, the corresponding function integral form of one-dimensional function [9] is as follows:
(3)Fαfx=∫−∞+∞fxBαx,xαdx,where
(4)Ba=expjpf′/4−f/2sinfexpjpx2cotf−2xxa+xa2cotfIn the formula,ϕ=απ/2,ϕ′=sgnsinϕ, α is the transformation order of the fractional Fourier transform.It is worth explaining that whenα=1 or −1, formula (4) is traditional Fourier transform or inverse transform; when α=0 or 2, formula (4) has no meaning, so when α=0 or 2, formula (4) can be redefined as follows:
(5)F0fx=fx,F2fx=f−x.


### 2.2. Shih-Type Fractional Fourier Transform

The whole process mainly revolves around one-dimensional processing, and the related mathematical transformation forms are as follows:(6)Gf=∫−∞∞gxe−j2πfxdx,gx=∫−∞∞Gfej2πfxdf.The integrals involved in formula (6) are usually called Fourier integrals. The function Gf is the Fourier transform of the function or called the frequency spectrum. If gxis a function expression corresponding to a physical quantity in a certain space domain, then G(x) is a function expression corresponding to a frequency domain.When Gf is a complex function, it can be expressed as follows:
(7)Gf=AfejΦf.The frequency spectrum of aperiodic functions is a continuous or piecewise continuous function of frequency, not a discrete function. Generally speaking, the inverse Fourier transform is the frequency complex index obtained after a certain weighting process and the components are superimposed to obtain the required original functiongx. The functions gx and Gf are combined into a pair of Fourier transform operations.After combined with shih-type transformation processing, the corresponding function integral form of one-dimensional functionfx is as follows:
(8)Fαfx=∑n=03cosα−nπ4cos2α−nπ4×exp−j3α−nπ4fηx.


### 2.3. Properties of Fractional Fourier Transform

Generally speaking, the two types of fractional Fourier transform methods have the following corresponding characteristics:(1)
Obvious boundary. The fractional Fourier transform is essentially the same as the traditional transform; especially if the order of the fractional Fourier transform is an integer value, it can be easily converted to the traditional Fourier form without any difference(2)
The function shows continuity. This point means that fractional Fourier can perform continuous function transformation in two-dimensional space(3)
Additivity of functional expressions. For the fractional Fourier transform of any order ofp1 and p2, its expression is as follows:(9)Fp1Fp2fx=Fp2Fp1fx=Fp1+p2fx(4)
Convolution. These two functions satisfy in the fractional convolution(10)Fpfx∗gx=Fpfx×FpgxIn special cases, Namias-type fractional Fourier transform also has the following properties [9]:
(11)Fp=Fp+4fx,Fpfx+t=Fpfx+tcostexpjtsintx+tcost2,Fpfxexpjbx=Fpfx−bsinϕexpjbcosϕx−ϕsinϕ4.


### 2.4. Optical Realization of Fractional Fourier Transform

Regarding the optical application under the fractional Fourier transform algorithm, related scholars have used the optical properties of the lens a long time ago to achieve fractional Fourier transformation of the image [9]. This idea has been well confirmed and the related principle [10] method is shown in Figure 1 as follows:Figure 1
Fractional Fourier transform light path diagram.The optical path propagation mode shown in Figure1 is a combination method of a lens, which is also called a single-lens method here. It can be seen that the entire system is divided into two parts: input and output [10, 11]. There is a plane L1 as a single input plane, which is then transferred to the lens L and then transferred from the lens L to the plane L2 and output via L2. The focal length of the lens L here is f, and the distance between the lens distance fractional Fourier L1 plane and the L2 plane is d. The quantitative relationship between the entire related parameters satisfies the following:
(12)d=1−cosαπ2f.According to the meaning of the abovementioned formula, if the focal lengthf of the lens is a certain value, then, if the distance parameter d is changed appropriately, the first-order fractional Fourier transform operation can be realized here.


### 2.5. Scrambling Technique of Arnold Transform

The processing principle of this type of method is to use a certain conversion method to change the different pixel points or gray values in a picture, so as to convert the original image display information content into the content that others cannot understand, thereby realizing the effect that people who want to obtain information cannot really recognize. Under normal circumstances, the transformation process can be marked and the specific description can be seen in formulas (13) and (14), where N is the order of unprocessed information, that is, the digital image matrix that needs to be encrypted. The gray scale of the smallest unit in the image to be processed can be combined with (x,y) and marked as Ux.
(13)Uxy=u11u12⋯u1Nu21u22⋯u2N⋮⋮⋱⋮uN1uN2⋯uNN,(14)x′y′=1112xymodN,x,y∈0,1,⋯,N−1.In the abovementioned formula, (x,y) represents the coordinates of the smallest unit that needs to be transformed on the original image and x′,y′ is the coordinate of the processed smallest unit on the encrypted image, where N indicates the order of the matrix, which is also the size of the image to be processed. When the image to be processed is a square, it needs to be modulo when performing calculations, so it can be ensured that the smallest unit coordinate after processing can be within the range of the matrix subscript [12].When using this method to transform the position of digital image pixels, the main principle is to replace the position of the smallest unit in Figure1 with formula (14), that is, to transform the position of each smallest unit x,y. In this process, due to the changes in the parameters of the smallest unit in the graph, the grayscale curve also shows different distribution states, blurring the information of the original digital image, and then completing the encryption [13, 14]. Under normal circumstances, an image encryption target executes the transformation algorithm once and can only complete one-to-one position exchange. However, to complete the encryption processing of the target, it is often necessary to repeat the cat face transformation, gaining better encryption effect by iterative execution.The information in the image processed by the algorithm will become blurred, and the image presented is similar to white noise. At this time, the first encryption process of the original image is completed and the secret key can be expressed by the number of iterations performed in the process. In the process of repeatedly performing the conversion operation for a certain number of times, a special situation will occur, that is, the processed image is restored to the original image. It can be seen that the processing in this way has periodicity and the recovery operation of the encrypted digital image can be completed through this characteristic, so that it can complete the decryption in the reverse scrambling.


### 2.6. Computational Holography

Computer-type holograms need to be calculated according to data and also need to use modern optical principles. However, it can only draw the figure through computer control after the mathematical process of the object wave is processed by a computer without the aid of physical entities. It can also record it to the corresponding device, so as to achieve the drawing effect of the simulated interferogram and copy it to the film. The computer-generated hologram can not only record the amplitude and phase of the light wave relatively comprehensively but also record some complex comprehensive information and the object information that must be recorded in the hologram. Therefore, it has relatively unique advantages and great flexibility.The flow of the hologram is shown in Figure2.Figure 2
Flow chart of the computational hologram.


### 2.7. Picture Evaluation Index System

Due to the characteristics of encrypted and decrypted images, specific performance analysis can be done according to the picture evaluation system indicators [15]. The image evaluation system indicators include four major aspects: robustness analysis, adjacent pixel correlation analysis, sensitivity analysis, and others. The specific indicators are as follows (Figure 3):Figure 3
Picture evaluation index system.This chapter mainly introduces the theoretical basis of optical image encryption. Firstly, the concept and properties of Namias-type and Shih-type fractional Fourier transform are introduced and the optical implementation of fractional Fourier transform is analyzed. Then, the concept and principle of the scrambling technique of Arnold transform are expounded. Finally, the concept and characteristics of CGH are summarized and the image evaluation index system is established, which lays a theoretical foundation for the research of optical encryption in this paper.


## 2.1. Namias-Type Fractional Fourier Transform

With the application of Fourier, there are new methods and new ideas for image processing. Compared with the traditional Fourier transform method, the fractional Fourier has a wider application of order, which makes the transform order able to be applied to the fractional problem. The study of fractional Fourier makes people enjoy the great achievements that it brings and creates numerous economic and social values. Fractional Fourier has different forms, but the Namias type and Shih type are often used.The following is the one-dimensional Fourier transform method under the traditional method [7]:
(1)Gf=∫−∞∞gxe−j2πfxdx,gx=∫−∞∞Gfej2πfxdf.In formula (1), the integration processing operation process demonstrated is the Fourier integral that we are more familiar with daily. The function Gf is the Fourier transform of the function [8]. If gx is a function expression corresponding to a physical quantity in a certain space domain, then, Gf is a function expression corresponding to gx in a frequency domain. When Gf is a complex function, it can be expressed as follows:
(2)Gf=AfejΦf.After Namias-type fractional Fourier transform, the corresponding function integral form of one-dimensional function [9] is as follows:
(3)Fαfx=∫−∞+∞fxBαx,xαdx,where
(4)Ba=expjpf′/4−f/2sinfexpjpx2cotf−2xxa+xa2cotfIn the formula,ϕ=απ/2,ϕ′=sgnsinϕ, α is the transformation order of the fractional Fourier transform.It is worth explaining that whenα=1 or −1, formula (4) is traditional Fourier transform or inverse transform; when α=0 or 2, formula (4) has no meaning, so when α=0 or 2, formula (4) can be redefined as follows:
(5)F0fx=fx,F2fx=f−x.


## 2.2. Shih-Type Fractional Fourier Transform

The whole process mainly revolves around one-dimensional processing, and the related mathematical transformation forms are as follows:(6)Gf=∫−∞∞gxe−j2πfxdx,gx=∫−∞∞Gfej2πfxdf.The integrals involved in formula (6) are usually called Fourier integrals. The function Gf is the Fourier transform of the function or called the frequency spectrum. If gxis a function expression corresponding to a physical quantity in a certain space domain, then G(x) is a function expression corresponding to a frequency domain.When Gf is a complex function, it can be expressed as follows:
(7)Gf=AfejΦf.The frequency spectrum of aperiodic functions is a continuous or piecewise continuous function of frequency, not a discrete function. Generally speaking, the inverse Fourier transform is the frequency complex index obtained after a certain weighting process and the components are superimposed to obtain the required original functiongx. The functions gx and Gf are combined into a pair of Fourier transform operations.After combined with shih-type transformation processing, the corresponding function integral form of one-dimensional functionfx is as follows:
(8)Fαfx=∑n=03cosα−nπ4cos2α−nπ4×exp−j3α−nπ4fηx.


## 2.3. Properties of Fractional Fourier Transform

Generally speaking, the two types of fractional Fourier transform methods have the following corresponding characteristics:(1)
Obvious boundary. The fractional Fourier transform is essentially the same as the traditional transform; especially if the order of the fractional Fourier transform is an integer value, it can be easily converted to the traditional Fourier form without any difference(2)
The function shows continuity. This point means that fractional Fourier can perform continuous function transformation in two-dimensional space(3)
Additivity of functional expressions. For the fractional Fourier transform of any order ofp1 and p2, its expression is as follows:(9)Fp1Fp2fx=Fp2Fp1fx=Fp1+p2fx(4)
Convolution. These two functions satisfy in the fractional convolution(10)Fpfx∗gx=Fpfx×FpgxIn special cases, Namias-type fractional Fourier transform also has the following properties [9]:
(11)Fp=Fp+4fx,Fpfx+t=Fpfx+tcostexpjtsintx+tcost2,Fpfxexpjbx=Fpfx−bsinϕexpjbcosϕx−ϕsinϕ4.


## 2.4. Optical Realization of Fractional Fourier Transform

Regarding the optical application under the fractional Fourier transform algorithm, related scholars have used the optical properties of the lens a long time ago to achieve fractional Fourier transformation of the image [9]. This idea has been well confirmed and the related principle [10] method is shown in Figure 1 as follows:Figure 1
Fractional Fourier transform light path diagram.The optical path propagation mode shown in Figure1 is a combination method of a lens, which is also called a single-lens method here. It can be seen that the entire system is divided into two parts: input and output [10, 11]. There is a plane L1 as a single input plane, which is then transferred to the lens L and then transferred from the lens L to the plane L2 and output via L2. The focal length of the lens L here is f, and the distance between the lens distance fractional Fourier L1 plane and the L2 plane is d. The quantitative relationship between the entire related parameters satisfies the following:
(12)d=1−cosαπ2f.According to the meaning of the abovementioned formula, if the focal lengthf of the lens is a certain value, then, if the distance parameter d is changed appropriately, the first-order fractional Fourier transform operation can be realized here.


## 2.5. Scrambling Technique of Arnold Transform

The processing principle of this type of method is to use a certain conversion method to change the different pixel points or gray values in a picture, so as to convert the original image display information content into the content that others cannot understand, thereby realizing the effect that people who want to obtain information cannot really recognize. Under normal circumstances, the transformation process can be marked and the specific description can be seen in formulas (13) and (14), where N is the order of unprocessed information, that is, the digital image matrix that needs to be encrypted. The gray scale of the smallest unit in the image to be processed can be combined with (x,y) and marked as Ux.
(13)Uxy=u11u12⋯u1Nu21u22⋯u2N⋮⋮⋱⋮uN1uN2⋯uNN,(14)x′y′=1112xymodN,x,y∈0,1,⋯,N−1.In the abovementioned formula, (x,y) represents the coordinates of the smallest unit that needs to be transformed on the original image and x′,y′ is the coordinate of the processed smallest unit on the encrypted image, where N indicates the order of the matrix, which is also the size of the image to be processed. When the image to be processed is a square, it needs to be modulo when performing calculations, so it can be ensured that the smallest unit coordinate after processing can be within the range of the matrix subscript [12].When using this method to transform the position of digital image pixels, the main principle is to replace the position of the smallest unit in Figure1 with formula (14), that is, to transform the position of each smallest unit x,y. In this process, due to the changes in the parameters of the smallest unit in the graph, the grayscale curve also shows different distribution states, blurring the information of the original digital image, and then completing the encryption [13, 14]. Under normal circumstances, an image encryption target executes the transformation algorithm once and can only complete one-to-one position exchange. However, to complete the encryption processing of the target, it is often necessary to repeat the cat face transformation, gaining better encryption effect by iterative execution.The information in the image processed by the algorithm will become blurred, and the image presented is similar to white noise. At this time, the first encryption process of the original image is completed and the secret key can be expressed by the number of iterations performed in the process. In the process of repeatedly performing the conversion operation for a certain number of times, a special situation will occur, that is, the processed image is restored to the original image. It can be seen that the processing in this way has periodicity and the recovery operation of the encrypted digital image can be completed through this characteristic, so that it can complete the decryption in the reverse scrambling.


## 2.6. Computational Holography

Computer-type holograms need to be calculated according to data and also need to use modern optical principles. However, it can only draw the figure through computer control after the mathematical process of the object wave is processed by a computer without the aid of physical entities. It can also record it to the corresponding device, so as to achieve the drawing effect of the simulated interferogram and copy it to the film. The computer-generated hologram can not only record the amplitude and phase of the light wave relatively comprehensively but also record some complex comprehensive information and the object information that must be recorded in the hologram. Therefore, it has relatively unique advantages and great flexibility.The flow of the hologram is shown in Figure2.Figure 2
Flow chart of the computational hologram.


## 2.7. Picture Evaluation Index System

Due to the characteristics of encrypted and decrypted images, specific performance analysis can be done according to the picture evaluation system indicators [15]. The image evaluation system indicators include four major aspects: robustness analysis, adjacent pixel correlation analysis, sensitivity analysis, and others. The specific indicators are as follows (Figure 3):Figure 3
Picture evaluation index system.This chapter mainly introduces the theoretical basis of optical image encryption. Firstly, the concept and properties of Namias-type and Shih-type fractional Fourier transform are introduced and the optical implementation of fractional Fourier transform is analyzed. Then, the concept and principle of the scrambling technique of Arnold transform are expounded. Finally, the concept and characteristics of CGH are summarized and the image evaluation index system is established, which lays a theoretical foundation for the research of optical encryption in this paper.


## 3. Results and Analysis

### 3.1. Image Encryption Simulation and Performance Analysis of Arnold Transform

#### 3.1.1. Simulation of Image Encryption Based on Arnold Transform

For Arnold’s optical image encryption algorithm, MATLAB simulation is used to decode with the correct key. Figures4(a) and 4(f) show the original image and the decrypted image, respectively, and Figures 4(b)–4(e) describe the Arnold transformation image that has undergone once, twice, eight, and fifteen times, respectively.Figure 4
The image processing.
(a)
The original image before Arnold transform encryption(b)
The image after Arnold transform once(c)
The image after Arnold transform twice(d)
The image after Arnold transform eight times(e)
The image after Arnold transform fifteen times(f)
Decrypted image


#### 3.1.2. Performance Analysis of Image Encryption Based on Arnold Transform

Figures5 and 6 show the histograms of the original image and encrypted image of the Arnold transform encryption algorithm.Figure 5
The histogram of the original image of the Arnold transform image encryption algorithm.Figure 6
Encryption graph histogram of the Arnold transform image encryption algorithm.As can be seen in Figures5 and 6, the graphics of the original image and the coded image are completely different, so the Arnold conversion encryption algorithm has a better coding effect [16, 17]. In addition, by comparing the PSNR and CC values of the original image and the decrypted image, the results can be seen in Table 1.Table 1
Peak signal-to-noise ratio and correlation coefficient of the Arnold transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption9.3214−0.0071Decrypt25.95740.8473The calculation results in Table1 can show that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high, and the analysis itself can obtain high decryption quality [18].


### 3.2. Image Encryption Simulation and Performance Analysis Based on Fractional Fourier Transform

#### 3.2.1. Image Encryption Simulation of Fractional Fourier Transform

The principle of the complete encryption algorithm described in this document is based on the Mach-Zed interference structure outside the axis.x,y is the space coordinate, ξ,n is the holographic plane coordinate, and the real value function fx,y represents the encrypted 2D image. The initial image fx,y is phase encrypted, the value is expressed as expifx,y, the light from the phase mask px,n is used for interference, and the CCD records the encrypted image information. At the same time, the computed hologram of the encrypted image is recorded and digitally reconstructed [19]. The intensity IHξ,n of this computed hologram has two light interferences expressed in the Fourier domain as follows:
(15)IHξ,η=Fξ,η+pξ,η2=Fξ,η2+pξ,η2+F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.Fξ,η represents the Fourier transform of expifx,y. px,n is selected as the phase function expiφξ,η; here, ξ,η is uniformly distributed on 0,2π. It can be obtained by encrypting the power spectrum of the image and the reference light. IH′ξ,η can be obtained using the following data:
(16)IH′ξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.In the formula, by multiplying the random phase maskR′ξ,η, the mathematical expression is a phase function, that is, R′ξ,η=expiφ′ξ,η, where (ξ,m) is a function of 0,2π uniform distribution; IH′ξ,η×R′ξ,η is the result of transforming Fourier into a numerical value, which is called the encrypted image.The cryptographic hologram is recorded by removing the original physical and transformation lens and single-band planar illumination as follows:(17)kξ,η=1+pξ,η2=12+pξ,η2+p∗ξ,η+pξ,η.Referring to formula (16), k′ξ,η can be obtained by using the following password hologram:
(18)k′ξ,η=p∗ξ,η+pξ,η.For the decryption process, we first perform Fourier transform on the encrypted image, then multiply it by the total of the random phase maskR′ξ,η, and multiply it with the conjugate function; we get formula (16). By multiplying formulas (16) and (18), we can get the following formula:
(19)IH′ξ,η×kξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η×p∗ξ,η+pξ,η=F∗ξ,η+Fξ,η+F∗ξ,η×pξ,η2+Fξ,η×p∗ξ,η2.Formula (19) is a numerical transformation of Fourier, where the first and second terms refer to the enhancement of two conjugate images on different optical axes [20]. The third and fourth items are Fourier transform into a random phase mask to amplify the background noise. The decoded image is a phase image, and it still needs to be converted into an amplitude image.
(20)RD=ARexpi2πλkxmΔx+kynΔy.AR represents the amplitude, and Δx,Δy is the pixel size of the CCD camera. The parameter kx,ky is a band vector element and must be adjusted to ensure that the propagation direction is as close as possible to the experimental reference wave. Amplitude AR can usually be set to 1.In order to analyze the performance of the encryption algorithm based on fractional Fourier transform, this paper uses MATLAB software to carry out numerical simulation. According to the algorithm described in the previous section, the original image used in the Fourier-based holographic encryption simulation is selected as Barbara’s grayscale image with a pixel distribution of512×512 and the pixel size of the camera is 44μm×44μm. The Fourier wavelength is 600 nm. We use random phase mask (RPMI) to encrypt the optical path of the object and use random phase mask (RPM) to encrypt the reference optical path [21]. The random phase mask can be seen in Figure 7.Figure 7
Random phase mask (RPM1 and RPM2).By using the holographic optical image encryption algorithm used for Fourier decomposition transformation and the MATLAB simulation technology, we use the correct key to decrypt and the original image and encryption and decryption diagrams are shown in Figures8–10.Figure 8
Original image before encryption by fractional Fourier transform.Figure 9
Fractional Fourier transform encrypted image.Figure 10
Decrypted image of fractional Fourier transform.


#### 3.2.2. Performance Analysis of Image Encryption Based on Fractional Fourier Transform

In order to have a deeper understanding of the performance of the encryption algorithm, this paper introduces three parameters: histogram, correlation coefficient CC, and peak signal-to-noise ratio PSNR to analyze the encryption performance of optical images. Among them, the peak signal-to-noise ratio (PSNR) is defined as follows:(21)PSNRdB=10lgP2MSE,MSE=1M×N∑i=1M∑j=1Nfx,y−fDx,y2.The histogram of the image can show the gray distribution of the value and spatial frequency of the image. If there is a big difference between the two images, there is a difference between the two images. The smaller the CC and the value, the greater the difference between the two images. Therefore, the above three parameters are mainly used to indicate the similarity of two images. Figures11 and 12 are the histograms of the original image and encrypted image of the fractional Fourier transform encryption algorithm.Figure 11
The original image of the Fourier transform image encryption algorithm histogram.Figure 12
Encryption diagram of Fourier transform image encryption algorithm histogram.As can be seen in Figures11 and 12, the graphics of the original image and the encoded image are completely different, so the encryption algorithm of the fractional Fourier transform image is more effective. We compare the PSNR and CC values of the original image and the decrypted image, and the results are shown in Table 2.Table 2
Peak signal-to-noise ratio and correlation coefficient of Fourier transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption11.3254−0.0001Decrypt25.54720.8745From the calculation results in Table2, it can be shown that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high. The same analysis may indicate that the decryption quality is very high.


## 3.1. Image Encryption Simulation and Performance Analysis of Arnold Transform

### 3.1.1. Simulation of Image Encryption Based on Arnold Transform

For Arnold’s optical image encryption algorithm, MATLAB simulation is used to decode with the correct key. Figures4(a) and 4(f) show the original image and the decrypted image, respectively, and Figures 4(b)–4(e) describe the Arnold transformation image that has undergone once, twice, eight, and fifteen times, respectively.Figure 4
The image processing.
(a)
The original image before Arnold transform encryption(b)
The image after Arnold transform once(c)
The image after Arnold transform twice(d)
The image after Arnold transform eight times(e)
The image after Arnold transform fifteen times(f)
Decrypted image


### 3.1.2. Performance Analysis of Image Encryption Based on Arnold Transform

Figures5 and 6 show the histograms of the original image and encrypted image of the Arnold transform encryption algorithm.Figure 5
The histogram of the original image of the Arnold transform image encryption algorithm.Figure 6
Encryption graph histogram of the Arnold transform image encryption algorithm.As can be seen in Figures5 and 6, the graphics of the original image and the coded image are completely different, so the Arnold conversion encryption algorithm has a better coding effect [16, 17]. In addition, by comparing the PSNR and CC values of the original image and the decrypted image, the results can be seen in Table 1.Table 1
Peak signal-to-noise ratio and correlation coefficient of the Arnold transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption9.3214−0.0071Decrypt25.95740.8473The calculation results in Table1 can show that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high, and the analysis itself can obtain high decryption quality [18].


## 3.1.1. Simulation of Image Encryption Based on Arnold Transform

For Arnold’s optical image encryption algorithm, MATLAB simulation is used to decode with the correct key. Figures4(a) and 4(f) show the original image and the decrypted image, respectively, and Figures 4(b)–4(e) describe the Arnold transformation image that has undergone once, twice, eight, and fifteen times, respectively.Figure 4
The image processing.
(a)
The original image before Arnold transform encryption(b)
The image after Arnold transform once(c)
The image after Arnold transform twice(d)
The image after Arnold transform eight times(e)
The image after Arnold transform fifteen times(f)
Decrypted image


## 3.1.2. Performance Analysis of Image Encryption Based on Arnold Transform

Figures5 and 6 show the histograms of the original image and encrypted image of the Arnold transform encryption algorithm.Figure 5
The histogram of the original image of the Arnold transform image encryption algorithm.Figure 6
Encryption graph histogram of the Arnold transform image encryption algorithm.As can be seen in Figures5 and 6, the graphics of the original image and the coded image are completely different, so the Arnold conversion encryption algorithm has a better coding effect [16, 17]. In addition, by comparing the PSNR and CC values of the original image and the decrypted image, the results can be seen in Table 1.Table 1
Peak signal-to-noise ratio and correlation coefficient of the Arnold transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption9.3214−0.0071Decrypt25.95740.8473The calculation results in Table1 can show that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high, and the analysis itself can obtain high decryption quality [18].


## 3.2. Image Encryption Simulation and Performance Analysis Based on Fractional Fourier Transform

### 3.2.1. Image Encryption Simulation of Fractional Fourier Transform

The principle of the complete encryption algorithm described in this document is based on the Mach-Zed interference structure outside the axis.x,y is the space coordinate, ξ,n is the holographic plane coordinate, and the real value function fx,y represents the encrypted 2D image. The initial image fx,y is phase encrypted, the value is expressed as expifx,y, the light from the phase mask px,n is used for interference, and the CCD records the encrypted image information. At the same time, the computed hologram of the encrypted image is recorded and digitally reconstructed [19]. The intensity IHξ,n of this computed hologram has two light interferences expressed in the Fourier domain as follows:
(15)IHξ,η=Fξ,η+pξ,η2=Fξ,η2+pξ,η2+F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.Fξ,η represents the Fourier transform of expifx,y. px,n is selected as the phase function expiφξ,η; here, ξ,η is uniformly distributed on 0,2π. It can be obtained by encrypting the power spectrum of the image and the reference light. IH′ξ,η can be obtained using the following data:
(16)IH′ξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.In the formula, by multiplying the random phase maskR′ξ,η, the mathematical expression is a phase function, that is, R′ξ,η=expiφ′ξ,η, where (ξ,m) is a function of 0,2π uniform distribution; IH′ξ,η×R′ξ,η is the result of transforming Fourier into a numerical value, which is called the encrypted image.The cryptographic hologram is recorded by removing the original physical and transformation lens and single-band planar illumination as follows:(17)kξ,η=1+pξ,η2=12+pξ,η2+p∗ξ,η+pξ,η.Referring to formula (16), k′ξ,η can be obtained by using the following password hologram:
(18)k′ξ,η=p∗ξ,η+pξ,η.For the decryption process, we first perform Fourier transform on the encrypted image, then multiply it by the total of the random phase maskR′ξ,η, and multiply it with the conjugate function; we get formula (16). By multiplying formulas (16) and (18), we can get the following formula:
(19)IH′ξ,η×kξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η×p∗ξ,η+pξ,η=F∗ξ,η+Fξ,η+F∗ξ,η×pξ,η2+Fξ,η×p∗ξ,η2.Formula (19) is a numerical transformation of Fourier, where the first and second terms refer to the enhancement of two conjugate images on different optical axes [20]. The third and fourth items are Fourier transform into a random phase mask to amplify the background noise. The decoded image is a phase image, and it still needs to be converted into an amplitude image.
(20)RD=ARexpi2πλkxmΔx+kynΔy.AR represents the amplitude, and Δx,Δy is the pixel size of the CCD camera. The parameter kx,ky is a band vector element and must be adjusted to ensure that the propagation direction is as close as possible to the experimental reference wave. Amplitude AR can usually be set to 1.In order to analyze the performance of the encryption algorithm based on fractional Fourier transform, this paper uses MATLAB software to carry out numerical simulation. According to the algorithm described in the previous section, the original image used in the Fourier-based holographic encryption simulation is selected as Barbara’s grayscale image with a pixel distribution of512×512 and the pixel size of the camera is 44μm×44μm. The Fourier wavelength is 600 nm. We use random phase mask (RPMI) to encrypt the optical path of the object and use random phase mask (RPM) to encrypt the reference optical path [21]. The random phase mask can be seen in Figure 7.Figure 7
Random phase mask (RPM1 and RPM2).By using the holographic optical image encryption algorithm used for Fourier decomposition transformation and the MATLAB simulation technology, we use the correct key to decrypt and the original image and encryption and decryption diagrams are shown in Figures8–10.Figure 8
Original image before encryption by fractional Fourier transform.Figure 9
Fractional Fourier transform encrypted image.Figure 10
Decrypted image of fractional Fourier transform.


### 3.2.2. Performance Analysis of Image Encryption Based on Fractional Fourier Transform

In order to have a deeper understanding of the performance of the encryption algorithm, this paper introduces three parameters: histogram, correlation coefficient CC, and peak signal-to-noise ratio PSNR to analyze the encryption performance of optical images. Among them, the peak signal-to-noise ratio (PSNR) is defined as follows:(21)PSNRdB=10lgP2MSE,MSE=1M×N∑i=1M∑j=1Nfx,y−fDx,y2.The histogram of the image can show the gray distribution of the value and spatial frequency of the image. If there is a big difference between the two images, there is a difference between the two images. The smaller the CC and the value, the greater the difference between the two images. Therefore, the above three parameters are mainly used to indicate the similarity of two images. Figures11 and 12 are the histograms of the original image and encrypted image of the fractional Fourier transform encryption algorithm.Figure 11
The original image of the Fourier transform image encryption algorithm histogram.Figure 12
Encryption diagram of Fourier transform image encryption algorithm histogram.As can be seen in Figures11 and 12, the graphics of the original image and the encoded image are completely different, so the encryption algorithm of the fractional Fourier transform image is more effective. We compare the PSNR and CC values of the original image and the decrypted image, and the results are shown in Table 2.Table 2
Peak signal-to-noise ratio and correlation coefficient of Fourier transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption11.3254−0.0001Decrypt25.54720.8745From the calculation results in Table2, it can be shown that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high. The same analysis may indicate that the decryption quality is very high.


## 3.2.1. Image Encryption Simulation of Fractional Fourier Transform

The principle of the complete encryption algorithm described in this document is based on the Mach-Zed interference structure outside the axis.x,y is the space coordinate, ξ,n is the holographic plane coordinate, and the real value function fx,y represents the encrypted 2D image. The initial image fx,y is phase encrypted, the value is expressed as expifx,y, the light from the phase mask px,n is used for interference, and the CCD records the encrypted image information. At the same time, the computed hologram of the encrypted image is recorded and digitally reconstructed [19]. The intensity IHξ,n of this computed hologram has two light interferences expressed in the Fourier domain as follows:
(15)IHξ,η=Fξ,η+pξ,η2=Fξ,η2+pξ,η2+F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.Fξ,η represents the Fourier transform of expifx,y. px,n is selected as the phase function expiφξ,η; here, ξ,η is uniformly distributed on 0,2π. It can be obtained by encrypting the power spectrum of the image and the reference light. IH′ξ,η can be obtained using the following data:
(16)IH′ξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η.In the formula, by multiplying the random phase maskR′ξ,η, the mathematical expression is a phase function, that is, R′ξ,η=expiφ′ξ,η, where (ξ,m) is a function of 0,2π uniform distribution; IH′ξ,η×R′ξ,η is the result of transforming Fourier into a numerical value, which is called the encrypted image.The cryptographic hologram is recorded by removing the original physical and transformation lens and single-band planar illumination as follows:(17)kξ,η=1+pξ,η2=12+pξ,η2+p∗ξ,η+pξ,η.Referring to formula (16), k′ξ,η can be obtained by using the following password hologram:
(18)k′ξ,η=p∗ξ,η+pξ,η.For the decryption process, we first perform Fourier transform on the encrypted image, then multiply it by the total of the random phase maskR′ξ,η, and multiply it with the conjugate function; we get formula (16). By multiplying formulas (16) and (18), we can get the following formula:
(19)IH′ξ,η×kξ,η=F∗ξ,ηpξ,η+Fξ,ηp∗ξ,η×p∗ξ,η+pξ,η=F∗ξ,η+Fξ,η+F∗ξ,η×pξ,η2+Fξ,η×p∗ξ,η2.Formula (19) is a numerical transformation of Fourier, where the first and second terms refer to the enhancement of two conjugate images on different optical axes [20]. The third and fourth items are Fourier transform into a random phase mask to amplify the background noise. The decoded image is a phase image, and it still needs to be converted into an amplitude image.
(20)RD=ARexpi2πλkxmΔx+kynΔy.AR represents the amplitude, and Δx,Δy is the pixel size of the CCD camera. The parameter kx,ky is a band vector element and must be adjusted to ensure that the propagation direction is as close as possible to the experimental reference wave. Amplitude AR can usually be set to 1.In order to analyze the performance of the encryption algorithm based on fractional Fourier transform, this paper uses MATLAB software to carry out numerical simulation. According to the algorithm described in the previous section, the original image used in the Fourier-based holographic encryption simulation is selected as Barbara’s grayscale image with a pixel distribution of512×512 and the pixel size of the camera is 44μm×44μm. The Fourier wavelength is 600 nm. We use random phase mask (RPMI) to encrypt the optical path of the object and use random phase mask (RPM) to encrypt the reference optical path [21]. The random phase mask can be seen in Figure 7.Figure 7
Random phase mask (RPM1 and RPM2).By using the holographic optical image encryption algorithm used for Fourier decomposition transformation and the MATLAB simulation technology, we use the correct key to decrypt and the original image and encryption and decryption diagrams are shown in Figures8–10.Figure 8
Original image before encryption by fractional Fourier transform.Figure 9
Fractional Fourier transform encrypted image.Figure 10
Decrypted image of fractional Fourier transform.


## 3.2.2. Performance Analysis of Image Encryption Based on Fractional Fourier Transform

In order to have a deeper understanding of the performance of the encryption algorithm, this paper introduces three parameters: histogram, correlation coefficient CC, and peak signal-to-noise ratio PSNR to analyze the encryption performance of optical images. Among them, the peak signal-to-noise ratio (PSNR) is defined as follows:(21)PSNRdB=10lgP2MSE,MSE=1M×N∑i=1M∑j=1Nfx,y−fDx,y2.The histogram of the image can show the gray distribution of the value and spatial frequency of the image. If there is a big difference between the two images, there is a difference between the two images. The smaller the CC and the value, the greater the difference between the two images. Therefore, the above three parameters are mainly used to indicate the similarity of two images. Figures11 and 12 are the histograms of the original image and encrypted image of the fractional Fourier transform encryption algorithm.Figure 11
The original image of the Fourier transform image encryption algorithm histogram.Figure 12
Encryption diagram of Fourier transform image encryption algorithm histogram.As can be seen in Figures11 and 12, the graphics of the original image and the encoded image are completely different, so the encryption algorithm of the fractional Fourier transform image is more effective. We compare the PSNR and CC values of the original image and the decrypted image, and the results are shown in Table 2.Table 2
Peak signal-to-noise ratio and correlation coefficient of Fourier transform encrypted image and decrypted image.
ProcessParameterPeak signal-to-noise ratio (PSNR)Correlation coefficient (CC)Encryption11.3254−0.0001Decrypt25.54720.8745From the calculation results in Table2, it can be shown that the PSNR of the very low encryption process is very low, indicating that the encryption quality is very high. The same analysis may indicate that the decryption quality is very high.


## 4. Conclusions

In recent years, research on image encryption based on optical information processing technology is becoming more and more favored by researchers. In this regard, this study will focus on the research of encryption algorithms in optical images and realize encryption through fractional Fourier transform and Arnold transform:(1)
The theoretical basis of optical image encryption is introduced, and the scrambling technology of fractional Fourier transform, Arnold transform, computational holography, and picture evaluation system indicators are introduced. First, the concept and properties of the Namias-type and shih-type fractional Fourier transform are introduced and the optical realization of the fractional Fourier transform is analyzed. Then, the concept and principle of the scrambling technique of Arnold transform are explained. Finally, the concept and characteristics of computational holography are summarized and a picture evaluation index system is established at the same time, which lays a theoretical foundation for the optical encryption research in this article(2)
We perform simulation and performance analysis for computational holographic encryption algorithms. First, we use MATLAB software for simulation and performance analysis to compare different algorithms; calculate the histogram, peak signal-to-noise ratio PSNR, and correlation coefficient CC of each image; and analyze the encryption and decryption effects of each algorithm(3)
We improve the encryption algorithm of the computational holographic image based on fractional Fourier. Combined with Arnold transform, we compare the image of the algorithm encryption and decryption process and calculate the histogram, peak signal-to-noise ratio PSNR, and correlation coefficient CC of each image. The result shows that the improved algorithm performs better in the encryption and decryption process



---

*Source: 6873087-2022-09-02.xml*