Optics and Laser Technology 121 (2020) 105777

Contents lists available at ScienceDirect

Optics and Laser Technology

journal homepage: www.elsevier.com/locate/optlastec

Research Note

A novel chaos based optical image encryption using fractional Fourier T

transform and DNA sequence operation
⁎
M.A. Ben Farah , R. Guesmi, A. Kachouri, M. Samet
Laboratory of Electronics and Information Technology, National Engineering School of Sfax, Sfax University, B.P.W. 3038 Sfax, Tunisia

H I GH L IG H T S

• We propose a new method for optical image encryption using fractional Fourier transform.
• Our algorithm is based on Shannon’s property of confusion and diffusion.
• The confusion process is based on DNA encoding and on using DNA XOR to scramble the pixel values of the image.

A R T I C LE I N FO A B S T R A C T

Keywords: In this paper, we propose a new method for optical image encryption using fractional Fourier transform, DNA
Optical image encryption sequence operation and chaos theory. Random phase masks are generated using iterative Lorenz map and the
Fractional Fourier transform plain image is transformed to a DNA matrix. This matrix is combined with the random phase mask and then
Chaos transformed three times using the fractional Fourier transform. An Optical implementation of the encryption
DNA sequence operation
algorithm is proposed in our work. According to the experiment results and security analysis, we find that our
algorithm has good encryption effect, larger secret key space and high sensitivity to the secret key. It can resist to
most known attacks, such as statistical analysis and exhaustive attacks. All these features show that our en-
cryption algorithm is very suitable for digital image encryption.

1. Introduction cryptosystem. Combining the two technics, mentioned above, was a

1.1. Research background
Information security has become an important topic in the processes
of storage and transmission. The information security technique is to
protect secret data for private benefit. Some algorithms have been
proposed based on optical system and mathematical transforms, such as
random phase encoding and fractional transform. Since Refregier and
Javidi proposed the optical image encryption based on input plane and
Fourier plane random encoding [1], lots of schemes on optical image
encryption have been put forward in other domains such as fractional
Fourier transform (FRFT) [2–8], gyrator transform (GT) [9–12] and
Fresnel transform (FrT) [13–15]. In the last decade, many cryptosys-
tems based on chaos was proposed [16–22]. The main reason for using
chaos is to take advantage of its ergodicity, pseudo-randomness and
sensitivity to initial conditions and control parameters. These inherent
properties make chaotic maps a potential choice for designing
good idea to improve the security of information in the optical image
encryption field [23–30,12,31]. In [23], Singh and Sinha proposed a
new method for image encryption using FRFT and chaos. The image to
be encrypted is FRFT two times and the random phase masks generated
using chaos functions are placed in the intermediate planes. Three
chaos functions (logistic map, tent map and Kaplan–Yorke map) have
been used to generate the chaotic random phase masks. They propose
another crptosystem based on Gyrator transform and two chaotic
random phase masks [24]. Li and Wang [25] proposed a double-image
encryption algorithm based on discrete fractional random transform
(DFrRT) and two chaotic maps. The logistic map is employed for pixel
scrambling of the image to be encrypted. The tent map is utilized to
generate the random matrix P used to define a 1D-DFrRT. Liu et al.
designed a double image encryption by using Arnold transform and
discrete fractional angular transform. Two original images are regarded
as the amplitude and phase of a complex function. Arnold transform is
introduced to scrambling the pixels [30].

⁎
Corresponding author.
E-mail addresses: med.farah@yahoo.fr (M.A.B. Farah), ramzi.guesmi@gmail.com (R. Guesmi), abdennaceur.kachouri@enis.rnu.tn (A. Kachouri),
mounir.samet@enis.rnu.tn (M. Samet).

https://doi.org/10.1016/j.optlastec.2019.105777
Received 10 April 2019; Accepted 16 August 2019
0030-3992/ © 2019 Elsevier Ltd. All rights reserved.
M.A.B. Farah, et al. Optics and Laser Technology 121 (2020) 105777

1.2. Our contribution Table 2

One type of XOR operation for DNA sequences.
In this paper a novel chaos-based image encryption algorithm using XOR A G C T
DNA sequence operation and fractional Fourier transform is proposed.
Our algorithm is based on Shannon’s property of confusion and diffu- A A G C T
G G A T C
sion. The confusion process is based on DNA encoding and on using
C C T A G
DNA XOR to scramble the pixel values of the image. We note that using T T C G A
the DNA operation was very interesting. It improves the security of the
image and it’s very simple and easy to code in matlab. The algorithm of
our image encryption process includes three parts. In the first part, we This coding technique is used in our paper, our plain image can be
encode the image according to the DNA encoding technique. seen as three matrix: red, green and blue: each pixel can be expressed as
Afterwards, we XOR the encoded matrix with another chaotic matrix a DNA sequence whose length is 4, for example if we take a pixel value
generated by the Lorenz system and the hash value of the plain image. in the red matrix is 173, converting it into a binary sequence is
We get the first encrypted image. The second part is devoted to generate [10101101], by using rule 1 we get the binary sequence [10101101], if
three chaotic sequences which will be used in the diffusion phase. The we use rule 2 we get [01011110]. [34]. In order to scramble the pixel
fractional Fourier transform will be applied three times in the third part values of our plain image, we used XOR operation according to Table 2
of our algorithm. Experimental results indicate that the encryption key between original image and keys matrix.
cannot be recovered if the cryptanalyst only possesses some portion of
the plaintext but not the secret hash keys. Therefore, the proposed al- 4. Color image encryption algorithm
gorithm is secure and efficient.
The algorithm mainly uses the fractional Fourier transform (FRFT),
2. The fractional Fourier transform DNA computing, the chaotic Lorenz system and the Secure Hash
Algorithm (SHA-2) to implement our cryptosystem.
The fractional Fourier transform (FRFT) is a time – frequency dis-
tribution and an extension classical Fourier transform. The FRFT of 4.1. The encryption algorithm
order p is defined in the following formula [32]:
The algorithm is shown in detail in Fig. 1. Our proposed algorithm is
+∞
fp (x p) = Fp {f (x )}(x p) = ∫−∞ f (x ) Kp (x , x p) dx , (1) based on the FRFT and chaos. The FRFT is used three times. Three
random phase masks generated by the Lorenz system are introduced at
The kernel is given by: the intermediate planes. The algorithm is divided into three parts. The
first part is to produce a first substituted image by using DNA encoding
exp[−i (πϕ ̂ / 4 − ϕ / 2)]
Kp (x , x p)= exp[iπ (x 2cotϕ − 2xx p cscϕ + x p2cotϕ)], 0 < |p and decoding. In the second part, we generate three chaotic sequences
|sinφ|
by using the Lorenz system. In the last part, we use the three sequences
| < 2,
with the fractional Fourier transform to obtain the final ciphered image.
=δ (x − x p), p = 0,
=δ (x + x p), p ± 2. 4.1.1. Part 1
(2) In the part one, we generate a first substituted image P0 by Xoring
the DNA encoded image Pdna with a key matrix Mke . The DNA encoded
where ϕ = p (π /2), ϕ ̂ = sgn (sinϕ) . p is the order of the FRFT. Fp ex-
image is generated by encoding the plain image P in accordance with
presses the FRFT of order ‘p’. x and x p are the coordinates in the input
the chosen DNA encoding rule. The matrix Mke is obtained from the
domain and output pth fractional domain, respectively. For p = 1, the
hash value of the plain image using SHA-2: We divide the 256-bit secret
FRFT is equivalent to the ordinary Fourier transform. The fourth order
key into 8-bit blocks (ki ) , so K can also be expressed as follows.
of the FRFT is equivalent to the original function. The FRFT is a linear
transform. The FRFT is additive in indices, i.e. K = k1, k2, k3, …, k32. (3)
Fp1 {Fp2 {f (x )}} = Fp1 + p2 {f (x )} . The initial values can be derived as follows.
(k1 ⊕ k2 ⊕ k3 ⊕…⊕ k11)
3. The DNA sequence operations x 0 = x 0′ +
256 (4)

3.1. DNA encoding and decoding for image (k12 ⊕ k13 ⊕ k14 ⊕…⊕ k22)
y0 = y0′ +
256 (5)
We present in this section the coding method based on DNA. We
(k23 ⊕ k24 ⊕ k25 ⊕…⊕ k32)
know that DNA sequence contains four nucleic acid bases A(adenine), z 0 = z 0′ +
256 (6)
C(cytosine), G(guanine), T(thymine): (A and T) and(G and C) are
complementary. If we apply this idea in binary base, so 00 and 11 are Where x 0′, y0′ and z 0′ are the initial given values.
complementary, 01 and 10 are also complementary. Table 1 show the The process of this first part is given as follows in detail:
24 kinds of coding schemes, there are only 8 kinds of coding schemes
satisfy the Watson–Crick complement rule [33]. Step 1: Input the plain image P(m,n), where m and n are the image
dimensions of rows and columns, respectively.
Table 1 Step 2: Generate the key sequence K and the initial values ( x 0′, y0′ , z 0′) of
8 kinds of DNA map rules. the Lorenz system.
1 2 3 4 5 6 7 8
Step 3: Transform the matrix of P to a binary matrix Pbin (m , n × 8) ,
then encode it in accordance with the chosen DNA encoding
A 00 00 01 01 10 10 11 11 rule ruleenc and get a DNA sequence matrix Pdna (m , n × 4) .
T 11 11 10 10 01 01 00 00 Step 4: Transform K to binary sequence Kb , then generate the matrix
G 01 10 00 11 00 11 01 10 m×n×8
Mk (m , n × 8) by repeating Kb , t times, where t = .
C 10 01 11 00 11 00 10 01 32
Encode Mk with the same encoding rule and get Mke .

2
M.A.B. Farah, et al. Optics and Laser Technology 121 (2020) 105777

4.1.3. Part 3
In this part, we will use the FRFT three times and the chaotic ma-
trices X,Y and Z (step 3, part 2) to produce the ciphered image.

Step 1: The first FRFT operation of order q1 is applied over the obtained
matrix P1 (step 6, part 1) to get a first transformed image I1:
I 1 = Fq1 {P1} (10)

Step 2: Do: P 2 = XOR (I 1, X ) to get a second substituted image.

Step 3: Apply the second FRFT operation of order q2 over P2 to get the
second transformed image I2 :
I 2 = Fq2 {P 2} (11)

Step 4: Do: P 3 = XOR (I 2, Y ) to get a third substituted image.

Step 5: Apply the third FRFT operation of order q3 over P3 to get the
third transformed image I3:
I 3 = Fq3 {P 3} (12)

Step 6: Finally, do: C = XOR (I 3, Z ) to get the ciphered image.

The distribution at the output plane is given by:

C = XOR (Fq3 {XOR (Fq2 {XOR (Fq1 {P1}, X )}, Y )}, Z ) (13)

4.2. Optical implementation of the encryption algorithm

The input image is Xored by the first chaotic sequence (x n ) re-

Fig. 1. Flowchart of the encryption algorithm.
Step 5: According to DNA XOR operation [Table 2], do:
P0 = Pdna XOR Mke .
Step 6: Decode P0 using a chosen rule Ruledec and get the matrix P1.
4.1.2. Part 2
Having the initial values ( x 0 , y0 , z 0) of the Lorenz system obtained
from step 2 of the first part, we generate three chaotic sequences x n , yn
and z n as follows:
Step 1: Iterate Lorenz equations for 100 times to get rid of the transient
effect.
Step 2: Continue to iterate it n times to generate three sequences, x i , yi
and z i , i = 1, 2, …, n . Then, apply:
x i = mod (floor (x i ·1014), 256) (7)
presented by the phase function (exp(i. π . C1(x ))) , where C1(x ) is the
random sequence generated by lorenz map. The first FRT operation of
order p1 is presented by equation:
Fp1 (Im _in (x )) = exp(i. π . C1(x ))) (14)
where Im _in (x ) is the input image, p1 is the fractal order of the first
FRT.
The result is encoded by the second sequence of lorenz map (yn )
which is expressed as the phase function of the second chaotic sequence
(exp(i. π . C 2(x ))) , where C 2(x ) represent the yn . Finally, the obtained
sequence is encoded by the third sequence of Lorenz map (z n ) . The
expression of the output plane is given by:
Im _out (x )
= Fp3 (Fp2 (Fp1 (Im _in. exp(i. π . C1(x ))exp(i. π . C 2(x ))exp(i. π . C 3(x )))
)) (15)
where p1 , p2 , p3 are respectively the fractional order of the first, the
second and the third FRT. The proposed encryption algorithm can be
implemented by using the single-lens Lohmann’s configuration for op-
tical implementation of FRT [35]. The optical implementation of our
encryption algorithm is presented in Fig. 2. Spacial light modulators
(SLM1, SLM2 and SLM3) are placed in the input plane of the fractional
Fourier transformer. After DNA operation, the first chaotic random
phase masks ( x n of Lorenz map) (CRPM) is displayed using SLM 1, the
second ( yn ) is displayed using SLM 2 and the third (z n ) using SLM 2. To
record the encrypted image, we used CCD camera.

yi = mod (floor (yi ·1014), 256) 5. Simulation result and security analysis
(8)

We use the standard 256 × 256 × 3 color image of “Lena” shown in

z i = mod (floor (z i ·1014), 256) Fig. 3(a) as the plain image. We set parameters:
(9)
x 0′ = 10.00000000000015,
Step 3: Convert the three sequences to three matrices X,Y and Z. y0′ = 6.00000000000021,
z 0′ = 20.00000000000038.

3
M.A.B. Farah, et al. Optics and Laser Technology 121 (2020) 105777

Fig. 2. Proposed optical implementation of the encryption algorithm.

Table 3
Entropy values of ciphered images after each step.
Entropy DNA step First FRFT step Second FRFT step Third FRFT step

Lena 7.9484 7.9990 7.9992 7.9991

Jasmin 7.2043 7.9990 7.9991 7.9991
Baboon 7.9343 7.9991 7.9990 7.9992

Fig. 4. jasmin and baboon images.

Fig. 5. Encrypted jasmin and baboon images.

Table 4
The mean NPCR and UACI of ciphered images when changing one pixel.
Images NPCR (%) UACI (%)

R G B R G B

Lena Fig. 99.5697 99.5544 99.5789 33.4100 33.4549 33.4409

Fig. 3. Encrypted images of Lena. Jasmin Fig. 99.6429 99.6429 99.5636 33.4844 33.5292 33.6095
Baboon Fig. 99.6338 99.5483 99.5972 33.3756 33.5518 33.5145

4
M.A.B. Farah, et al. Optics and Laser Technology 121 (2020) 105777

Table 5
Comparative study of NPCR, UACI and Entropy of the proposed algorithm to some existing algorithms.
Images NPCR (%) UACI (%) Entropy

R G B R G B

Ref. [17] 99.6086 99.6086 99.6086 33.4273 33.4273 33.4273 –

Ref. [19] 99.6000 99.6000 99.6000 33.5000 33.4000 33.5000 –
Ref. [21] 99.6100 99.6100 99.6100 33.4400 33.4400 33.4400 7.9997
Ref. [36] 99.5983 99.6022 99.5392 33.6883 33.1105 33.5039 7.9852
Ref. [37] – – – – – – 7.9970
Ref. [38] – – – – – – 7.9978
Ref. [39] – – – – – – 7.9885
Ref. [40] 99.61 99.61 99.61 33.38 33.38 33.38 7.9980
Ref. [34] 99.5865 99.2172 98.8479 33.4834 33.4639 33.2689 7.9968
Ref. [22] 99.5926 99.6216 99.6323 33.3386 33.3595 33.1250 7.9992
Ref. [41] 99.6216 99.6307 99.6017 34.2633 34.0188 34.1718 7.9993
Our algorithm 99.5697 99.5544 99.5789 33.4100 33.4549 33.4409 7.9991

Fig. 6. Histograms of the color plain-image in the red, green and blue components. (For interpretation of the references to colour in this figure legend, the reader is
referred to the web version of this article.)

5
M.A.B. Farah, et al. Optics and Laser Technology 121 (2020) 105777

Fig. 7. Correlation of two adjacent pixels: Frames (a) and (b) respectively, show the distribution of two horizontally adjacent pixels in the plain and encrypted images
of Lena. Frames (c) and (d) respectively, show the distribution of two vertically adjacent pixels in the plain and encrypted images of Lena. Frames (e) and (f)
respectively, show the distribution of two diagonally adjacent pixels in the plain and encrypted images of Lena.

Table 6 summarized in Table 5. This comparison shows that we obtained results

Correlation coefficients of two adjacent pixels in the plain image and ciphered are very interesting compared to other algorithms.
one.
Correlation Original image Ciphered image
5.1. Information entropy
Horizontal 0.9964 0.0693
Vertical 0.9988 0.0610
Information entropy is the most important criterium of randomness.
Diagonal 0.9950 −0.0242
The following formula calculate the entropy of cyphred image:

2n − 1
The encrypted images after each step are shown in Fig. 3. It can be seen 1
H (m) = ∑ p (mi )log 2
p (mi )
.
from the images that there are no relation between the original image i=0 (16)
and the encrypted images. Table 3 shows that cryptographic properties
increase after each step. Therefore, our algorithm can get good en- where p (m) represents the probability of symbol m. The closer it gets to
cryption effect.The encryption algorithm should be sensitive to the se- 8, the less possible for the cryptosystem to divulge information. We
cret keys. In this section, we will discuss the security analysis on the calculate the information entropy of the ciphered images of Figs. 3(a),
proposed encryption scheme. A comparative study of NPCR, UACI and 4(a) and (b). Table 3 shows that the values of entropy are all very close
entropy of our proposed algorithm to some existing algorithms is to the ideal value 8 (see Fig. 5).

6
M.A.B. Farah, et al.
5.2. Differential attack
The difference between original image and ciphered image can be
measured by means of two criteria namely, the NPCR (Number of Pixel
Change Rate) and the UACI (Unified Average Changing Intensity).
Attackers often make a tiny change in the original image, then use the
proposed algorithm to encrypt the original image before and after
changing, to find out the relation between the original image and the
ciphered image, that is the differential attack. The criterions of NPCR
and UACI are usually applied to examine the performance of resisting
differential attack. the formulas to calculate NPCRR, G, B and UACIR, G, B :
∑i, j DR, G, B (i, j )
NPCRR, G, B = × 100%
L (17)
1⎡ |CR, G, B (i, j ) − CR′ , G, B (i, j )| ⎤
UACIR, G, B = ∑ ⎥ × 100%
L ⎢ i, j 255
⎣ ⎦
where L is the total number of pixels in the image. CR, G, B and CR′ , G, B are
respectively the ciphered images before and after one pixel of the plain
image is changed. DR, G, B (i, j ) can be defined by:
1, if CR, G, B (i, j ) ≠ CR′ , G, B (i, j )
DR, G, B (i, j ) = ⎧
⎨ 0, if CR, G, B (i, j ) = CR′ , G, B (i, j )
⎩
Table 4 shows the results according to the proposed algorithm of
NPCRR, G, B and UACIR, G, B . We have found that the NPCR is over 99% and
the UACI is over 33%,These results show that encryption scheme is
sensitive with small change in the original image, even if there is only
one difference bit between them, the proposed cryptosystem can give
two ciphered images different.
5.3. Statistical attack
5.3.1. The histogram analysis
The most significant characteristic of an image is histogram: we can
see the frequency of each gray level, which can exposure image in-
formation. Fig. 6 displays the histograms of RGB colors for the original
image in Fig. 3(a) and the encrypted one in Fig. 3, respectively. It is
clear from these figures that the histograms of the encrypted image are
uniform and different from those of the original image (see Fig. 7).
5.3.2. Correlation coefficient analysis
We selected randomly 2000 adjacent pixel (in vertical, horizontal
and diagonal directions) from the plain image and encrypted image.
The following formula calculate the correlation coefficients of two ad-
jacent pixels:
cov (x , y )
rxy = ,
D (x ) D (y )
where
N [17] Kwok-Wo Wong, Bernie Sin-Hung Kwok, Wing-Shing Law, A fast image encryption
1
cov (x , y ) =
N
∑ (x i − E (x ))(yi − E (y )),
i=1
N 615–621.
1
E (x ) =
N
∑ xi ,
i=1
N [20] Omid Mirzaei, Mahdi Yaghoobi, Hassan Irani, A new image encryption method:
1
D (x ) =
N
∑ (x i − E (x ))2.
i=1
where x and y are gray level values of two adjacent pixels in the image,
N is the total number of pixels selected from the image, E (x ) and E (y )
are the mean values of x i and yi , respectively. The detailed results of
correlation coefficients for two horizontally (vertically and diagonally)
adjacent pixels in the red, green and blue components of the original
plain-image and the encrypted one are given in Table 6. These results
Optics and Laser Technology 121 (2020) 105777
show that the correlation coefficients of the plain image are close to 1
while those of the cipher-image are nearly 0.
6. Conclusions
We have proposed a new approach to encrypt the image using FRFT,
chaos and DNA sequence operation. This is the first time, DNA sequence
operation has been used with an optical transform for image encryp-
tion. In our algorithm, the positions of pixels are permuted by Lorenz
system and the pixel values of the original image are scrambled by DNA
sequence XOR operation with the key matrix. The FRFT was applied
three times. Hence, the fractional order serve as a robust key in terms of
blind decryption. Through the experiment result and security analysis,
we find that our algorithm has good encryption effect, larger secret key
space and high sensitive to the secret key. Furthermore, the proposed
algorithm also can resist most known attacks, such as statistical analysis
(18) and exhaustive attacks. All these features show that our algorithm is
very suitable for digital image encryption.
References
[1] Philippe Refregier, Bahram Javidi, Optical image encryption based on input plane
and fourier plane random encoding, Opt. Lett. 20 (7) (1995) 767–769.
(19) [2] G. Unnikrishnan, J. Joseph, Kehar Singh, Optical encryption by double-random
phase encoding in the fractional fourier domain, Opt. Lett. 25 (12) (2000) 887–889.
[3] Banghe Zhu, Shutian Liu, Qiwen Ran, Optical image encryption based on multi-
fractional fourier transforms, Opt. Lett. 25 (16) (2000) 1159–1161.
[4] Shutian Liu, Yu. Li, Banghe Zhu, Optical image encryption by cascaded fractional
fourier transforms with random phase filtering, Opt. Commun. 187 (1) (2001)
57–63.
[5] B. Hennelly, John T. Sheridan, Optical image encryption by random shifting in
fractional fourier domains, Opt. Lett. 28 (4) (2003) 269–271.
[6] Liansheng Sui, Meiting Xin, Ailing Tian, Haiyan Jin, Single-channel color image
encryption using phase retrieve algorithm in fractional fourier domain, Opt. Lasers
Eng. 51 (12) (2013) 1297–1309.
[7] Zhengjun Liu, She Li, Wei Liu, Shutian Liu, Opto-digital image encryption by using
baker mapping and 1-d fractional fourier transform, Opt. Lasers Eng. 51 (3) (2013)
224–229.
[8] Zhengjun Liu, She Li, Wei Liu, Yanhua Wang, Shutian Liu, Image encryption al-
gorithm by using fractional fourier transform and pixel scrambling operation based
on double random phase encoding, Opt. Lasers Eng. 51 (1) (2013) 8–14.
[9] Huijuan Li, Yurong Wang, Information security system based on iterative multiple-
phase retrieval in gyrator domain, Opt. Laser Technol. 40 (7) (2008) 962–966.
[10] Muhammad Rafiq Abuturab, Color information security system using discrete co-
sine transform in gyrator transform domain radial-hilbert phase encoding, Opt.
Lasers Eng. 50 (9) (2012) 1209–1216.
[11] Muhammad Rafiq Abuturab, Securing color image using discrete cosine transform
in gyrator transform domain structured-phase encoding, Opt. Lasers Eng. 50 (10)
(2012) 1383–1390.
[12] Muhammad Rafiq Abuturab, Securing color information using arnold transform in
gyrator transform domain, Opt. Lasers Eng. 50 (5) (2012) 772–779.
[13] Wen Chen, Xudong Chen, Colin JR Sheppard, Optical image encryption based on
diffractive imaging, Opt. Lett. 35 (22) (2010) 3817–3819.
[14] Wen Chen, Xudong Chen, Space-based optical image encryption, Opt. Express 18
(26) (2010) 27095–27104.
[15] Wen Chen, Xudong Chen, Colin J.R. Sheppard, Optical color-image encryption and
(20) synthesis using coherent diffractive imaging in the fresnel domain, Opt. Express 20
(4) (2012) 3853–3865.
[16] Narendra K. Pareek, Vinod Patidar, Krishan K. Sud, Image encryption using chaotic
logistic map, Image Vis. Comput. 24 (9) (2006) 926–934.
scheme based on chaotic standard map, Phys. Lett. A 372 (15) (2008) 2645–2652.
(21) [18] Xing-Yuan Wang, Lei Yang, Rong Liu, Abdurahman Kadir, A chaotic image en-
cryption algorithm based on perceptron model, Nonlinear Dyn. 62 (3) (2010)
[19] Yang Tang, Zidong Wang, Jian-an Fang, Image encryption using chaotic coupled
(22) map lattices with time-varying delays, Commun. Nonlinear Sci. Numer. Simul. 15
(9) (2010) 2456–2468.
parallel sub-image encryption with hyper chaos, Nonlinear Dyn. 67 (1) (2012)
(23) 557–566.
[21] A. Kanso, M. Ghebleh, A novel image encryption algorithm based on a 3d chaotic
map, Commun. Nonlinear Sci. Numer. Simul. 17 (7) (2012) 2943–2959.
[22] Ramzi Guesmi, Mohamed Amine Ben Farah, Abdennaceur Kachouri, Mounir Samet,
Hash key-based image encryption using crossover operator and chaos, Multimedia
Tools Appl. (2015) 1–17.
[23] Narendra Singh, Aloka Sinha, Optical image encryption using fractional fourier
transform and chaos, Opt. Lasers Eng. 46 (2) (2008) 117–123.
[24] Narendra Singh, Aloka Sinha, Gyrator transform-based optical image encryption,
7
M.A.B. Farah, et al.
using chaos, Opt. Lasers Eng. 47 (5) (2009) 539–546.
[25] Huijuan Li, Yurong Wang, Double-image encryption based on discrete fractional
random transform and chaotic maps, Opt. Lasers Eng. 49 (7) (2011) 753–757.
[26] Jun Lang, Ran Tao, Yue Wang, Image encryption based on the multiple-parameter
discrete fractional fourier transform and chaos function, Opt. Commun. 283 (10)
(2010) 2092–2096.
[27] Nanrun Zhou, Yixian Wang, Lihua Gong, Hong He, Wu. Jianhua, Novel single-
channel color image encryption algorithm based on chaos and fractional fourier
transform, Opt. Commun. 284 (12) (2011) 2789–2796.
[28] Jun Lang, Image encryption based on the reality-preserving multiple-parameter
fractional fourier transform and chaos permutation, Opt. Lasers Eng. 50 (7) (2012)
929–937.
[29] Zhengjun Liu, Xu. Lie, Ting Liu, Hang Chen, Pengfei Li, Chuang Lin, Shutian Liu,
Color image encryption by using arnold transform and color-blend operation in
discrete cosine transform domains, Opt. Commun. 284 (1) (2011) 123–128.
[30] Zhengjun Liu, Min Gong, Yongkang Dou, Feng Liu, Shen Lin, Muhammad
Ashfaq Ahmad, Jingmin Dai, Shutian Liu, Double image encryption by using arnold
transform and discrete fractional angular transform, Opt. Lasers Eng. 50 (2) (2012)
248–255.
[31] W. Chen, C. Quan, C.J. Tay, Optical color image encryption based on arnold
transform and interference method, Opt. Commun. 282 (18) (2009) 3680–3685.
[32] Haldun M. Ozaktas, Zeev Zalevsky, M. Alper Kutay, The fractional fourier transform
with applications in optics and signal processing, 2001.
Optics and Laser Technology 121 (2020) 105777
[33] J.D. Watson, F.H.C. Crick, A structure for deoxyribose nucleic acid, Nature 421
(6921) (1953) 397–3988.
[34] Xiaopeng Wei, Ling Guo, Qiang Zhang, Jianxin Zhang, Shiguo Lian, A novel color
image encryption algorithm based on dna sequence operation and hyper-chaotic
system, J. Syst. Softw. 85 (2) (2012) 290–299.
[35] Adolf W. Lohmann, Image rotation, wigner rotation, and the fractional fourier
transform, JOSA A 10 (10) (1993) 2181–2186.
[36] Hongjun Liu, Xingyuan Wang, Color image encryption based on one-time keys and
robust chaotic maps, Comput. Math. Appl. 59 (10) (2010) 3320–3327.
[37] Qiang Zhang, Xiaopeng Wei, A novel couple images encryption algorithm based on
dna subsequence operation and chaotic system, Optik-Int. J. Light Electron Opt. 124
(23) (2013) 6276–6281.
[38] Qiang Zhang, Lili Liu, Xiaopeng Wei, Improved algorithm for image encryption
based on dna encoding and multi-chaotic maps, AEU-Int. J. Electron. Commun. 68
(3) (2014) 186–192.
[39] Lili Liu, Qiang Zhang, Xiaopeng Wei, A rgb image encryption algorithm based on
dna encoding and chaos map, Comput. Electric. Eng. 38 (5) (2012) 1240–1248.
[40] Qiang Zhang, Ling Guo, Xiaopeng Wei, Image encryption using dna addition
combining with chaotic maps, Math. Comput. Modell. 52 (11) (2010) 2028–2035.
[41] R. Guesmi, M.A.B. Farah, A. Kachouri, M. Samet, A novel chaos-based image en-
cryption using dna sequence operation and secure hash algorithm sha-2, Nonlinear
Dyn. (2015) 1–14.