# A Fingerprint Image Encryption Scheme Based on Hyperchaotic Rössler Map

Authors: F. Abundiz-Pérez; C. Cruz-Hernández; M. A. Murillo-Escobar; R. M. López-Gutiérrez; A. Arellano-Delgado
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

Currently, biometric identifiers have been used to identify or authenticate users in a biometric system to increase the security in access control systems. Nevertheless, there are several attacks on the biometric system to steal and recover the user’s biometric trait. One of the most powerful attacks is extracting the fingerprint pattern when it is transmitted over communication lines between modules. In this paper, we present a novel fingerprint image encryption scheme based on hyperchaotic Rössler map to provide high security and secrecy in user’s biometric trait, avoid identity theft, and increase the robustness of the biometric system. A complete security analysis is presented to justify the secrecy of the biometric trait by using our proposed scheme at statistical level with 100% of NPCR, low correlation, and uniform histograms. Therefore, it can be used in secure biometric access control systems.


---

## Body

## 1. Introduction

Nowadays, the biometric systems are widely used to authenticate and identify an individual, in order to recognize the user identity in a secure way. Nevertheless, these sophisticated recognition systems are prone to be attacked and the biometric identifier could be compromised. Identity fraud is a security problem in secure access systems controls. Therefore, there is an increasing interest in designing high and effective secure access systems based on biometric identifiers.Techniques such as SHA-1, MD5, 3DES, RC5, AES, and IDEA are conventional encryption methods to protect information such as images and documents, when it is transmitted over on insecure communication channel. Nevertheless, they are not suitable for bulk and highly correlated data encryption such as images. On the other hand, there is an increasing research to design nonconventional encryption techniques such as chaotic and hyperchaotic encryption, since chaotic systems are related to cryptographic properties in confusion and diffusion process. In [1–10], chaotic encryption techniques are proposed to protect information such as text, grey images, color images, and fingerprint template. In the next paragraphs, recent chaotic encryption schemes related to biometric data protection by using chaos are discussed.In [11], the authors proposed an encryption scheme by using the affine transform, the fractional wavelet packet transform (FrWPT), chaotic map, and the Hessenberg decomposition. They present a security analysis such as space keys, histogram, and another with good results. In [12], a fingerprint image encryption process is performed by using a chaotic Frequency Amplitude Phase Model (FAPM). Their scheme has high resistance against exhaustive attack with 10,238 combinations and the chaotic sequence presents a uniform distribution. In 2012, Liu presents a fingerprint image protection scheme by using two chaotic logistic maps [13]. Although the key space is enough to resist an exhaustive attack, the histogram distribution is far away from a good chaotic source for encryption process.In [14], the authors proposed a multiple chaos-based biometric image cryptosystem for fingerprint security. The cryptosystem is constructed whit two 1D and two 3D chaotic systems. Although their scheme presents a secret key space of 1
0
154, it encrypts low dimensional grey image in 0.5 seconds. Therefore, high dimensional color images could require a lot of processing time and the scheme could not be practical in real-time applications.In [15], we present our first encryption approach, where the encryption process for biometric image is presented. In contrast, in this paper we have included an enhanced encryption process to provide higher security in the biometric trait and avoid identity theft. In addition, we have included a complete security analysis to verify the robustness of our scheme.In [16], the authors presented an encryption scheme, based on a parallel full shuffling and encryption algorithm. In this paper, the logistic map, the Lorenz system, and the Chen system were used in the encryption algorithm. The encryption procedure is more confusing and complex, when the plain image is first divided into 4 subimages, and then the position of each subimage is changed pseudorandomly by using the logistic map. Furthermore, a full shuffling matrix is used to shuffle the position of pixels in the whole image and the subimages are encrypted simultaneously in a parallel manner. The results presented by the authors show good results in the correlation analysis and great sensitivity at key, but it has a slow speed encryption.In [17], the authors presented an image encryption algorithm based on genetic recombination and hyperchaotic system. First, the plain image is expanded into two compound images, which are composed of selected four bit-plane and diffuse bit-plane levels. Then, the compound bit-planes and key streams are reconstructed based on the principles of genetic recombination. Finally, they perform traditional diffusion to produce the cipher images. Experimental results demonstrate the effectiveness of encryption with good results in the histograms, large space of keys, and high sensitivity at secret key, which are similar to the results obtained by us in this work.In [18], the authors presented an encryption scheme based on image operations with DNA sequences and a chaotic system. First, they perform bitwise operations XOR by using the pseudorandom sequences produced by the chaotic system CML. After that, a DNA matrix is generated by encoding the confused image using a DNA coding rule. Subsequently, they generate new initial conditions of CML according to the DNA array and initial conditions. Then, the rows and columns of DNA matrix are permuted and the DNA matrix is confused again. Finally, after decoding the confused DNA matrix using a kind of DNA decoding rule, the encryption image is obtained. Experimental results demonstrate the effectiveness of encryption, and the authors show good results in the histogram analysis, a large space of keys, and a good sensitivity at key, which are similar to the results obtained by us in this work.Nowadays, in literature there are several approaches of implementation of chaotic systems in cryptography, because chaotic systems present cryptographic properties related to confusion and diffusion such as sensitivity to initial conditions and control parameters, mixing, determinism, and ergodicity [1, 2, 12, 13, 15]. In recent years, researchers have introduced the hyperchaotic systems in the cryptography field [3, 4, 9, 19]. The hyperchaotic systems present higher sensitivity to initial conditions and control parameter, higher space of keys, and more complex dynamic characteristics and have two or more positive Lyapunov exponents, which indicates that their dynamic sequence diverges to a greater extent than a chaotic system. All these advantages are very useful to produce a cryptogram with better statistical properties.In this paper, we present an image encryption scheme by using hyperchaotic Rössler map. We use the high pseudorandom sequences to generate excellent encryption effects and produce a highly secure encryption scheme, which present better results in some aspects compared with [16–18] such as uniform distribution histograms, the large space of key, low correlation of pixels, and speed encryption.The organization of this work is as follows. In Section2, some vulnerabilities of a biometric system are presented. In Section 3, we describe briefly the hyperchaotic system used in the encryption process. The encryption and decryption process details are presented in Section 4. In Section 5, we present a complete security analysis at statistical level to verify the capabilities of our scheme in security terms. In Section 6, we present a comparison of our proposed scheme with recent schemes reported in recent years. Finally, the conclusions are mentioned in Section 7.


## 2. Vulnerabilities in a Biometric System

There are several biometric identification systems, which are composed of two important stages, enrollment and identification. In enrollment stage, the user is registered in the database, while in the identification stage the user’s identity is determined by using a biometric identifier. The biometric identification systems can be divided into five subsystems: data collection, transmission, signal processing, decision, and data storage. In Figure1, these five subsystems and their iteration are shown (the dashed lines showing the enrollment stage) [20–23].Figure 1
General biometrics system [20].Currently, the biometric systems are a topic of high interest in the scientific community, because they provide a practical way for secure access control systems. Nevertheless, these systems have some vulnerable points, which are classified in two categories. One of these vulnerabilities is the attack on the communication lines. A snooper can spy the communication to steal confidential information of the biometric identifier, which can be used to extract the user identity. The second attack is on the modules (sensor, feature extraction, matching, database, etc.). The attacks use malicious programs such as a Trojan horse and it emulates the function of some modules of the biometric system and could reject an authorized user [20].Due to the existence of attacks in the vulnerability points of the biometric systems, the scientific community and engineers have implemented some actions to protect the biometric system against these powerful attacks. Some of the proposed schemes are based on random data, withheld data, on-life detection, biometric multiple, cryptography, digital signature, network clean-up, and physical security [20–23, 27–31].In this paper, we propose an encryption scheme that provides security in the transmission subsystem, with the aim of protecting the communication line, where the image is sent to the storage subsystem and the signal processing subsystem; see Figure2. The proposed encryption scheme is based on hyperchaotic Rössler map.Figure 2
Possible location of the encryption and decryption process on general biometric system.


## 3. Hyperchaotic Rössler Map

Analogous or digital communication schemes need new cryptographic schemes to protect confidential information. Motivated by this fact, in recent years several researchers have reported great variety of advances related to chaotic encryption. These schemes exploit the pseudorandom properties of the states in a chaotic system; see, for example, [4–10]. In addition, some chaotic characteristics that benefit the encryption are as follows:(i)
Simple operation can generate complex dynamics, which provides a pseudorandom sequence where the confidential information can be hidden.
(ii)
Small variation in initial conditions in chaotic system provides great changes in the output dynamic, which benefits the number of keys that could be used for encryption.
(iii)
Encryption statistics preserve the uniform distribution for any chaotic sequence, which benefit the encryption against statistical attacks.In this paper, we use the Rössler map for encryption purposes. This map generates hyperchaotic dynamics; that is, it presents greater complex behavior than a chaotic system. One distinctive characteristic of these systems is the existence of more than one positive Lyapunov exponent [4–6]. The following are the Rössler map equations [5]:(1)
x
1
k
+
1
=
α
x
1
k
1
-
x
1
k
-
β
x
3
k
+
γ
1
-
2
x
2
k
,
x
2
k
+
1
=
δ
x
2
k
1
-
x
2
k
+
ς
x
3
k
,
x
3
k
+
1
=
η
x
3
k
+
γ
1
-
2
x
2
k
-
1
1
-
θ
x
1
k
.The hyperchaotic attractor generated by Rössler map is shown in Figure3 considering the initial conditions x
(
0
)
=
(
0
.
3,0
,
0
.
05
), parameter values α
=
3
.
8, β
=
0
.
05, γ
=
0
.
35, δ
=
3
.
78, ς
=
0
.
2, η
=
0
.
1, and θ
=
1
.
9, and 28,000 iterations by using MATLAB software simulation.Figure 3
Hyperchaotic attractor, generated by the Rössler map.


## 4. Encryption and Decryption Process

The encryption process is based on two important stages, the diffusing and permutation stage. On the other hand, the decryption process is constituted by the inverse permutation and inverse diffusing process (Figure4).Figure 4
Block diagram of the proposed encryption algorithm.


### 4.1. Encryption Process

Hyperchaotic Rössler map is used to generate a sequence of pseudorandom numbers, which are used in permutation and diffusion process.


#### 4.1.1. Diffusion Process

Step 1.
Read the fingerprint plain image to generateI
o
(
i
,
j
), where i
=
1
,
2
,
…
,
n and j
=
1
,
2
,
…
,
m. It represents an array of n
×
m, where n is the number of rows and m is the number of columns.Step 2.
Generate an array ofn
×
m, which contains the output data from the hyperchaotic state x
1
(
k
) from the Rössler map, where k
=
1
,
…
,
N and N
=
n
×
m. This array will be named as hyperchaotic state matrix and it will be represented by M
c
(
i
,
j
).Step 3.
By usingM
c
(
i
,
j
), we generate a new array in the set of {
a
∈
N
:
0
≤
a
<
256
}. This array is used to confuse the image. To perform this step, we transform M
c
(
i
,
j
)
∈
R in the range 0 to 1 to the set {
a
∈
N
:
0
≤
a
<
256
} by using the next expression:(2)
M
c
c
=
M
c
i
,
j
:
M
c
i
,
j
×
100000
∈
N
mod
⁡
256
.Step 4.
Add elements of the arrayM
c
c
(
i
,
j
) to elements of plain image I
o
(
i
,
j
) with module 256. With this process, we will get a new array that will be named as dithered image matrix and will be represented by I
c
(
i
,
j
).


#### 4.1.2. Permutation Process

Step 1.
Generate a vector for the positions of the rows and a vector for the positions of the columns, which will be represented by the variablesV
r
o
w
=
1
2
3
4
⋯
n and V
col
=
1
2
3
4
⋯
m.Step 2.
Generate two vectors that contain the data resulting from chaotic statesx
2 and x
3 from the Rössler map; these will be appointed as chaotic vector of rows and chaotic vector of columns, which will be represented by the variables X
c
k
1
=
x
2
(
0
)
x
2
(
1
)
⋯
x
2
(
N
) and X
r
(
k
1
)
=
x
3
(
0
)
x
3
(
1
)
⋯
x
3
(
N
), where k
1
=
1,2
,
3
,
…
,
N and N
>
(
21
m
).Step 3.
Generate two vectors of pseudorandom sequences for column and row permutation by using the following expression:(3)
S
r
e
n
=
X
r
:
X
r
×
100000
∈
N
mod
⁡
n
+
1
,
S
col
=
X
c
:
X
c
×
100000
∈
N
mod
⁡
m
+
1
.After that, V
r
o
w, V
c
o
l, S
ren, and S
c
o
l are used to calculate two pseudorandom vectors to permute the diffused image. They will be used in Algorithm 1.Algorithm 1:Generation of pseudorandom sequences of positions.
Require: Order variables N
=
21
m, S
c
a
o
k
1
=
S
r
e
n
(
k
1
), V
p
l
=
V
r
o
w
(
i
) and N
2
=
n for generating pseudorandom
sequence from the rows positions orS
c
a
o
(
k
1
)
=
S
c
o
l
(
k
1
), V
p
(
l
)
=
V
c
o
l
(
j
) and N
2
=
m for generating pseudorandom
sequence the columns positions.
Ensure: V
s
a
p Vector pseudorandom sequence of positions.
(1) p
=
1; a
=
1; b
=
N
/
21;
(2) while
a
≠
0
do
(3) if
S
c
a
o
(
b
) is equal to V
p
(
S
c
a
o
(
b
)
)
then
(4)  V
s
a
p
(
p
)
=
S
c
a
o
(
b
)
(5)  V
p
(
S
c
a
o
(
b
)
)
=
0; p
=
p
+
1
(6) end if
(7) b
=
b
+
1
(8) if sum of all elements of V
p is equal to 0
then
(9)  a
=
0
(10) end if
(11) if
b is equal to N
then
(12)  b
=
1
(13)  S
c
a
o
=
(
S
c
a
o
+
1
mod
⁡
N
2
)
+
1
(14) end if
(15) end while
(16) return
V
s
a
pStep 4.
The pixels from the diffused image will be permuted as follows:(4)
I
c
p
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


### 4.2. Decryption Process

The decryption process is based on the inverse steps of the encryption process. The hyperchaotic Rössler map is used with the same initial conditions and control parameters. Basically, the decryption steps are described as follows.


#### 4.2.1. Inverse Permutation Process

In this process,I
c
(
i
,
j
)
=
I
c
p
(
i
,
j
) to perform the reverse permutation. The next expression is calculated:(5)
I
c
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


#### 4.2.2. Inverse Diffusion Process

The steps to perform the inverse blurring process are similar to those presented in the diffusion stage. Performing the reverse blurring equally will use the matricesM
c
c
(
i
,
j
) and I
c
(
i
,
j
), but, in this case, the operation is performed as follows:(6)
I
r
i
,
j
=
I
c
i
,
j
-
M
c
c
i
,
j
mod
⁡
256
.Finally, I
r is the recovered fingerprint plain image.


## 4.1. Encryption Process

Hyperchaotic Rössler map is used to generate a sequence of pseudorandom numbers, which are used in permutation and diffusion process.


### 4.1.1. Diffusion Process

Step 1.
Read the fingerprint plain image to generateI
o
(
i
,
j
), where i
=
1
,
2
,
…
,
n and j
=
1
,
2
,
…
,
m. It represents an array of n
×
m, where n is the number of rows and m is the number of columns.Step 2.
Generate an array ofn
×
m, which contains the output data from the hyperchaotic state x
1
(
k
) from the Rössler map, where k
=
1
,
…
,
N and N
=
n
×
m. This array will be named as hyperchaotic state matrix and it will be represented by M
c
(
i
,
j
).Step 3.
By usingM
c
(
i
,
j
), we generate a new array in the set of {
a
∈
N
:
0
≤
a
<
256
}. This array is used to confuse the image. To perform this step, we transform M
c
(
i
,
j
)
∈
R in the range 0 to 1 to the set {
a
∈
N
:
0
≤
a
<
256
} by using the next expression:(2)
M
c
c
=
M
c
i
,
j
:
M
c
i
,
j
×
100000
∈
N
mod
⁡
256
.Step 4.
Add elements of the arrayM
c
c
(
i
,
j
) to elements of plain image I
o
(
i
,
j
) with module 256. With this process, we will get a new array that will be named as dithered image matrix and will be represented by I
c
(
i
,
j
).


### 4.1.2. Permutation Process

Step 1.
Generate a vector for the positions of the rows and a vector for the positions of the columns, which will be represented by the variablesV
r
o
w
=
1
2
3
4
⋯
n and V
col
=
1
2
3
4
⋯
m.Step 2.
Generate two vectors that contain the data resulting from chaotic statesx
2 and x
3 from the Rössler map; these will be appointed as chaotic vector of rows and chaotic vector of columns, which will be represented by the variables X
c
k
1
=
x
2
(
0
)
x
2
(
1
)
⋯
x
2
(
N
) and X
r
(
k
1
)
=
x
3
(
0
)
x
3
(
1
)
⋯
x
3
(
N
), where k
1
=
1,2
,
3
,
…
,
N and N
>
(
21
m
).Step 3.
Generate two vectors of pseudorandom sequences for column and row permutation by using the following expression:(3)
S
r
e
n
=
X
r
:
X
r
×
100000
∈
N
mod
⁡
n
+
1
,
S
col
=
X
c
:
X
c
×
100000
∈
N
mod
⁡
m
+
1
.After that, V
r
o
w, V
c
o
l, S
ren, and S
c
o
l are used to calculate two pseudorandom vectors to permute the diffused image. They will be used in Algorithm 1.Algorithm 1:Generation of pseudorandom sequences of positions.
Require: Order variables N
=
21
m, S
c
a
o
k
1
=
S
r
e
n
(
k
1
), V
p
l
=
V
r
o
w
(
i
) and N
2
=
n for generating pseudorandom
sequence from the rows positions orS
c
a
o
(
k
1
)
=
S
c
o
l
(
k
1
), V
p
(
l
)
=
V
c
o
l
(
j
) and N
2
=
m for generating pseudorandom
sequence the columns positions.
Ensure: V
s
a
p Vector pseudorandom sequence of positions.
(1) p
=
1; a
=
1; b
=
N
/
21;
(2) while
a
≠
0
do
(3) if
S
c
a
o
(
b
) is equal to V
p
(
S
c
a
o
(
b
)
)
then
(4)  V
s
a
p
(
p
)
=
S
c
a
o
(
b
)
(5)  V
p
(
S
c
a
o
(
b
)
)
=
0; p
=
p
+
1
(6) end if
(7) b
=
b
+
1
(8) if sum of all elements of V
p is equal to 0
then
(9)  a
=
0
(10) end if
(11) if
b is equal to N
then
(12)  b
=
1
(13)  S
c
a
o
=
(
S
c
a
o
+
1
mod
⁡
N
2
)
+
1
(14) end if
(15) end while
(16) return
V
s
a
pStep 4.
The pixels from the diffused image will be permuted as follows:(4)
I
c
p
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


## 4.1.1. Diffusion Process

Step 1.
Read the fingerprint plain image to generateI
o
(
i
,
j
), where i
=
1
,
2
,
…
,
n and j
=
1
,
2
,
…
,
m. It represents an array of n
×
m, where n is the number of rows and m is the number of columns.Step 2.
Generate an array ofn
×
m, which contains the output data from the hyperchaotic state x
1
(
k
) from the Rössler map, where k
=
1
,
…
,
N and N
=
n
×
m. This array will be named as hyperchaotic state matrix and it will be represented by M
c
(
i
,
j
).Step 3.
By usingM
c
(
i
,
j
), we generate a new array in the set of {
a
∈
N
:
0
≤
a
<
256
}. This array is used to confuse the image. To perform this step, we transform M
c
(
i
,
j
)
∈
R in the range 0 to 1 to the set {
a
∈
N
:
0
≤
a
<
256
} by using the next expression:(2)
M
c
c
=
M
c
i
,
j
:
M
c
i
,
j
×
100000
∈
N
mod
⁡
256
.Step 4.
Add elements of the arrayM
c
c
(
i
,
j
) to elements of plain image I
o
(
i
,
j
) with module 256. With this process, we will get a new array that will be named as dithered image matrix and will be represented by I
c
(
i
,
j
).


## 4.1.2. Permutation Process

Step 1.
Generate a vector for the positions of the rows and a vector for the positions of the columns, which will be represented by the variablesV
r
o
w
=
1
2
3
4
⋯
n and V
col
=
1
2
3
4
⋯
m.Step 2.
Generate two vectors that contain the data resulting from chaotic statesx
2 and x
3 from the Rössler map; these will be appointed as chaotic vector of rows and chaotic vector of columns, which will be represented by the variables X
c
k
1
=
x
2
(
0
)
x
2
(
1
)
⋯
x
2
(
N
) and X
r
(
k
1
)
=
x
3
(
0
)
x
3
(
1
)
⋯
x
3
(
N
), where k
1
=
1,2
,
3
,
…
,
N and N
>
(
21
m
).Step 3.
Generate two vectors of pseudorandom sequences for column and row permutation by using the following expression:(3)
S
r
e
n
=
X
r
:
X
r
×
100000
∈
N
mod
⁡
n
+
1
,
S
col
=
X
c
:
X
c
×
100000
∈
N
mod
⁡
m
+
1
.After that, V
r
o
w, V
c
o
l, S
ren, and S
c
o
l are used to calculate two pseudorandom vectors to permute the diffused image. They will be used in Algorithm 1.Algorithm 1:Generation of pseudorandom sequences of positions.
Require: Order variables N
=
21
m, S
c
a
o
k
1
=
S
r
e
n
(
k
1
), V
p
l
=
V
r
o
w
(
i
) and N
2
=
n for generating pseudorandom
sequence from the rows positions orS
c
a
o
(
k
1
)
=
S
c
o
l
(
k
1
), V
p
(
l
)
=
V
c
o
l
(
j
) and N
2
=
m for generating pseudorandom
sequence the columns positions.
Ensure: V
s
a
p Vector pseudorandom sequence of positions.
(1) p
=
1; a
=
1; b
=
N
/
21;
(2) while
a
≠
0
do
(3) if
S
c
a
o
(
b
) is equal to V
p
(
S
c
a
o
(
b
)
)
then
(4)  V
s
a
p
(
p
)
=
S
c
a
o
(
b
)
(5)  V
p
(
S
c
a
o
(
b
)
)
=
0; p
=
p
+
1
(6) end if
(7) b
=
b
+
1
(8) if sum of all elements of V
p is equal to 0
then
(9)  a
=
0
(10) end if
(11) if
b is equal to N
then
(12)  b
=
1
(13)  S
c
a
o
=
(
S
c
a
o
+
1
mod
⁡
N
2
)
+
1
(14) end if
(15) end while
(16) return
V
s
a
pStep 4.
The pixels from the diffused image will be permuted as follows:(4)
I
c
p
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


## 4.2. Decryption Process

The decryption process is based on the inverse steps of the encryption process. The hyperchaotic Rössler map is used with the same initial conditions and control parameters. Basically, the decryption steps are described as follows.


### 4.2.1. Inverse Permutation Process

In this process,I
c
(
i
,
j
)
=
I
c
p
(
i
,
j
) to perform the reverse permutation. The next expression is calculated:(5)
I
c
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


### 4.2.2. Inverse Diffusion Process

The steps to perform the inverse blurring process are similar to those presented in the diffusion stage. Performing the reverse blurring equally will use the matricesM
c
c
(
i
,
j
) and I
c
(
i
,
j
), but, in this case, the operation is performed as follows:(6)
I
r
i
,
j
=
I
c
i
,
j
-
M
c
c
i
,
j
mod
⁡
256
.Finally, I
r is the recovered fingerprint plain image.


## 4.2.1. Inverse Permutation Process

In this process,I
c
(
i
,
j
)
=
I
c
p
(
i
,
j
) to perform the reverse permutation. The next expression is calculated:(5)
I
c
i
,
j
=
I
i
n
V
s
a
p
r
i
,
V
s
a
p
c
j
.


## 4.2.2. Inverse Diffusion Process

The steps to perform the inverse blurring process are similar to those presented in the diffusion stage. Performing the reverse blurring equally will use the matricesM
c
c
(
i
,
j
) and I
c
(
i
,
j
), but, in this case, the operation is performed as follows:(6)
I
r
i
,
j
=
I
c
i
,
j
-
M
c
c
i
,
j
mod
⁡
256
.Finally, I
r is the recovered fingerprint plain image.


## 5. Experimental Results

This section presents the experimental results of the proposed fingerprint encryption algorithm implemented in MATLAB simulation software 2008a (Figure5). The results are divided into two subsections. The first part presents the cipher, decipher, permutation, diffusion, inverse permutation, and inverse diffusion stages at image level. The second subsection presents the security analysis of the proposed encryption algorithm.Figure 5
Program implemented in MATLAB 2008a version.


### 5.1. Encryption and Decryption Processes

In Figure6, we present the permutation and diffusion encryption processes separately. This provides an idea of what performs these steps.Figure 6
Encryption and decryption process in permutation and diffusion process.Figure7 illustrates the results of the hyperchaotic encryption and decryption processes, without omitting any steps that are performed in each process. The encrypted image does not show any information at human eye level. In addition, the recovery image is the same as the plain image, if the same key is used in the hyperchaotic map.Figure 7
Decryption process with correct secret key.If any of the stages is not implemented, that is, diffusion or permutation that is performed in the encryption or decryption process, the image will not retrieve. Figure8 shows this idea, where the plain image is not recovered.Figure 8
Decryption process with an omitted step.


### 5.2. Security Analysis

To evaluate the security at statistical level of the proposed fingerprint hyperchaotic encryption algorithm, we considered different types of attacks. Attacks such as exhaustive attack, statistical attack, and differential attack are analyzed. In some cases, we show the results for both encryptions with and without permutation process.


#### 5.2.1. Statistical Analysis

In this analysis, the distribution and correlation are considered. The histogram of the image can give visual information of the distribution of the intensity levels of red, green, and blue component of a color image. In addition, the numerical correlation is calculated according to a specific expression to determine if the encrypted image presents low correlation, which is desired in a good encryption algorithm.Histogram Analysis. Cryptographic algorithms must provide a uniform distribution of grey values in the histogram in order to provide adequate strength against a statistical attack. In Figure 9, we present the histograms of the image before and after encryption, considering that the encryption is performed with or without the permutation stage. It can be seen that the distribution of grey values from the original image is concentrated in some grey scale values, whereas the histograms of the encrypted images are nearly uniform. Also, it shows that the encrypted image histograms are the same with or without the permutation stage, because the permutation process only changes the positions of the pixels contained in the image and it does not modify the values of the pixels and therefore does not affect the distribution of the intensity levels of the encrypted image.Figure 9
Histogram analysis of encryption process with and without permutation process, by using the key(
0.1,0.1,0.1
).Correlation Analysis. Typically, a plain image presents high correlation between adjacent pixels. In this sense, cryptographic algorithms should reduce the correlation in order to provide adequate strength against statistical attack. In Figure 10, we present the results of the horizontal, vertical, and diagonal correlation from the adjacent pixels of the encrypted image with and without permutation process.Figure 10
Horizontal, vertical, and diagonal correlation distribution of the original image (I
o), encrypted image without permutation (I
c), and encrypted image with permutation (I
c
p), by using the key (0.1, 0.1, 0.1).The correlation analysis is calculated as follows:(7)
E
x
=
1
N
∑
i
=
1
N
x
i
,
E
y
=
1
N
∑
i
=
1
N
y
i
,
(8)
D
x
=
1
N
∑
i
=
1
N
x
i
-
E
x
2
,
D
y
=
1
N
∑
i
=
1
N
y
i
-
E
y
2
,
(9)
cov
⁡
x
,
y
=
1
N
∑
i
=
1
N
x
i
-
E
x
y
i
-
E
y
,
(10)
r
x
y
=
cov
⁡
x
,
y
D
x
×
D
y
,where x and y are the grey values of two adjacent pixels in the image, cov
⁡
x
,
y is the covariance, D is the variance, and E is mean. Table 1 shows the numerical results of the correlations of the encrypted image with and without permutation process.Table 1
Correlation coefficient of encrypted image.
Image
Horizontal correlation
Vertical correlation
Diagonal correlation
Plain image
0.8180
0.8670
0.8184
Encryption without permutation
0.0392
0.0082
0.0392
Encryption with permutation
0.0199
-
0.0045
0.0199By observing the results presented in Figure10, there are concentration points in plain image correlation, which indicates that there is a high correlation between the adjacent pixels. However, the encrypted image with and without permutation and the plot show low correlation. In numerical results, the values close to ±
1 indicate high correlation and values close to 0 indicate low correlation. The results of Table 1 showed low correlation for plain image with approximately 0.8 (close to 1); therefore, this value is an indicator of the high correlation. On the other hand, the encrypted image presents low correlation (close to 0); therefore the encryption process is robust.


#### 5.2.2. Exhaustive Attack

This rudimentary but effective attack is known as brute force attack, in which all possible keys are tried until the correct secret key is found and the original message is decrypted. This type of attack is related to the key. Therefore, we check the efficiency of the key in the cryptographic scheme with a key space analysis and secret key sensitivity analysis.Key Space Analysis. The key space must be greater than 2
100
=
1.2677
×
1
0
30 to resist an exhaustive attack, according to Alvarez and Li reported in [32]. The key used in the encryption scheme is based on the initial condition of the hyperchaotic Rössler map (
x
1
,
x
2
,
x
3
). Therefore, with a precision of 10
12, the encryption scheme provides a key space of 1
0
12
×
1
0
12
×
1
0
12
=
1
0
36. In addition, the key space can be increased by 1
0
150 if we considered the parameter controls α, β, γ, δ, ς, η, and θ of the hyperchaotic Rössler map and a precision of 10
15. Therefore, the key space is suitable to resist an exhaustive attack.Secret Key Sensitivity Analysis. The cryptographic scheme must be highly sensitive to small variations in the key to resist differential attack; that is, similar secret keys must generate totally different encrypted images. Chaotic systems present highly sensitive to initial conditions; that is, they present different chaotic dynamics when the initial conditions are slightly modified. In Figure 11, we present two encrypted images with and without permutation process by using the key (
0.1,0.1,0.1
) and the second column presents the decrypted image by using incorrect secret key (
0.1,0.1,0.100000000001
). Therefore, the decrypted image cannot be recovered if the secret key is not exactly used such as in encryption process.Figure 11
Secret key sensitivity analysis.In order to show the secret key sensitivity in the encryption process, the correlation (see (10)) and MSE (see (12)) are used. In this analysis, two cryptograms are generated by using the same plain image but with two similar secret keys, which are highly similar to each other. Several pairs of cryptograms are produced by using (
0.1,0.1,0.1
) and (
0.1,0.1,0.1
+
Δ
x
3
) as secret keys. In each pair of cryptograms, the mean square error MSE (see Section 5.3) and the correlation coefficient are calculated. In Figure 12(a), the MSE results of several pairs of cryptograms are showed by using increments of Δ
x
3. Since the MSE values are high and uniform, the proposed scheme presents high sensitivity at small variations in secret keys. On the other hand, in Figure 12(b), the correlation of the same pairs of cryptograms is determined. The results of correlation are close to zero in each test, which indicates that both cryptograms are highly different from each other and this is another proof of the high sensitivity of secret key in the proposed scheme.Figure 12
Secret key sensitivity analysis: (a) MSE curves and (b) correlation curves.
(a)
(b)


#### 5.2.3. Differential Analysis

The third analysis presented is against differential attack. If the encryption process is weak, an adversary could implement this attack to find a relation between similar plain images and determine the secret key. The analysis consists in encrypting two similar plain images with a small change in just one pixel. After that, the encryption algorithm is applied to both of them by using the same secret key. Then, a comparison between the encrypted images is performed. There are two parameters used to examine the resistance against differential attack, which areN
P
C
R (Number of Pixels Change Rate) and U
A
C
I (Unified Changing Average Intensity). These values are calculated as follows:(11)
C
i
,
j
=
0
if
T
1
i
,
j
=
T
2
i
,
j
1
if
T
1
i
,
j
≠
T
2
i
,
j
,
N
P
C
R
=
∑
i
M
∑
j
N
C
i
,
j
M
×
N
×
100
%
,
UACI
=
∑
i
M
∑
j
N
T
1
i
,
j
-
T
2
i
,
j
255
×
M
×
N
×
100
%
,where M and N are the height and width of the image and T
1
(
i
,
j
) and T
2
(
i
,
j
) are the pixel value in the location (
i
,
j
) of the encrypted images. In this analysis, we considered the plain fingerprint image showed in Figure 8. The value of the pixel 127 of the original image is changed to the value of 128. Subsequently, the encryption is applied to both images. Therefore, two cryptograms are generated T
1
(
i
,
j
) and T
2
(
i
,
j
). In the encryption process without permutation process, we have N
P
C
R
c
=
100
% and U
A
C
I
c
=
0.7850
%. This indicates that the cryptographic scheme is robust against differential attack.


### 5.3. Mean Square Error Analysis

A method to determine the error between original image and encrypted image is by using the mean square error MSE parameter, which is the existing qualitative squared error between both compared images [33]. The MSE parameter is calculated by the following expression:(12)
M
S
E
=
1
M
×
N
∑
i
=
1
M
∑
j
=
1
N
F
1
i
,
j
-
F
2
i
,
j
2
,where F
1
(
i
,
j
) is the original image, F
2
(
i
,
j
) is the encrypted image, and M
×
N is size of the original image. Higher values of MSE mean higher immunity against attacks. MSE values close to zero mean that both tested images are highly similar. The MSE calculated from original image and encrypted image showed in Figure 7 is M
S
E
=
12324.3893. On the other hand, the MSE between original image and the correct retrieved image is M
S
E
=
0.


### 5.4. Chosen/Known Plain Image Attack

The chosen/known plain image attack is a powerful cryptanalyst attack, which has broken several image encryption algorithms based on chaos. In a chosen plain image attack, the cryptanalyst chose a convenient image, for example, an image with all pixels in black to eliminate the function of the plain image over the algorithm (permutation and diffusion) and try to find the secret key (chaos), since its pixel values are zero.In Figure13, we present the chosen plain image attack by using the black plain image, which is shown in Figure 13(a). The corresponding encrypted black plain image is shown in Figure 13(b), which can be represented by the secret key or the chaotic sequence used in several cryptograms. Then, the cryptanalyst uses this information as a possible secret key and tries to decrypt other cryptograms that probably were encrypted with that secret key. In this case, the cryptanalyst used the cryptogram of the fingerprint used in Figure 7, which is shown in Figure 13(c). Nevertheless, the corresponding decrypted image (Figure 13(d)) cannot be retrieved correctly, if data of Figure 13(b) are used as secret key. Therefore, the proposed encryption algorithm is robust against this kind of attack.Figure 13
Chosen plain image attack: (a) chosen black plain image, (b) cryptogram of black image and possible secret key, (c) cryptogram of fingerprint image, and (d) decryption of encrypted fingerprint with the possible secret key.
(a)
(b)
(c)
(d)


### 5.5. Occlusion Attack Analysis

In an occlusion attack, the transmitted encrypted image could lose blocks of information and not all the cryptograms can arrive to the receptor correctly. In this section, we present the robustness of the proposed encryption algorithm against 12.5%, 25%, and 50% of occlusion in an encrypted image. In Figure14, the decryption image against three cases of occlusion is showed. The corresponding MSE values are 1844.9842 for 12.5%, 3581.8797 for 25%, and 7101.4179 for 50%. Since the decrypted image can be retrieved, the proposed encryption algorithm can resist an occlusion attack.Figure 14
Tolerance against occlusion attacks, considering data loss of 12.5%, 25%, and 50%.


### 5.6. Noise Attack Analysis

This analysis shows the effectiveness of the proposed scheme against noise attack. In contrast to occlusion attack, the encrypted images can lose small portions of data over the encrypted image. In the analysis, encrypted data are distorted by zero-mean white additive Gaussian noise with a standard deviation from 0 to 0.3 with increments of 0.01. Figure15 shows several decrypted images from encrypted image with added noise. In addition, Figure 16 presents the MSE and correlation curves between original image and recovered image. According to the results, the proposed scheme is robust against noise attack.Figure 15
Decrypted image from cryptograms with Gaussian noise added.Figure 16
MSE and correlation curves between original and retrieved image in noise attack.
(a)
(b)


### 5.7. Encryption Time Analysis

The encryption and decryption processes are performed on a Laptop Toshiba Satellite E105-S1402 with operating system Windows Vista, processor speed of 2.26 Ghz, and 4 GB DDR2. The simulation is implemented in MATLAB R2008a software. “.bmp” plain image encryption of greyscale with355
×
390 pixels (139,918 bytes) requires just 0.2340 seconds. The decryption process requires just 0.2105 seconds. Therefore, the proposed encryption algorithm can be implemented in real-time applications.


## 5.1. Encryption and Decryption Processes

In Figure6, we present the permutation and diffusion encryption processes separately. This provides an idea of what performs these steps.Figure 6
Encryption and decryption process in permutation and diffusion process.Figure7 illustrates the results of the hyperchaotic encryption and decryption processes, without omitting any steps that are performed in each process. The encrypted image does not show any information at human eye level. In addition, the recovery image is the same as the plain image, if the same key is used in the hyperchaotic map.Figure 7
Decryption process with correct secret key.If any of the stages is not implemented, that is, diffusion or permutation that is performed in the encryption or decryption process, the image will not retrieve. Figure8 shows this idea, where the plain image is not recovered.Figure 8
Decryption process with an omitted step.


## 5.2. Security Analysis

To evaluate the security at statistical level of the proposed fingerprint hyperchaotic encryption algorithm, we considered different types of attacks. Attacks such as exhaustive attack, statistical attack, and differential attack are analyzed. In some cases, we show the results for both encryptions with and without permutation process.


### 5.2.1. Statistical Analysis

In this analysis, the distribution and correlation are considered. The histogram of the image can give visual information of the distribution of the intensity levels of red, green, and blue component of a color image. In addition, the numerical correlation is calculated according to a specific expression to determine if the encrypted image presents low correlation, which is desired in a good encryption algorithm.Histogram Analysis. Cryptographic algorithms must provide a uniform distribution of grey values in the histogram in order to provide adequate strength against a statistical attack. In Figure 9, we present the histograms of the image before and after encryption, considering that the encryption is performed with or without the permutation stage. It can be seen that the distribution of grey values from the original image is concentrated in some grey scale values, whereas the histograms of the encrypted images are nearly uniform. Also, it shows that the encrypted image histograms are the same with or without the permutation stage, because the permutation process only changes the positions of the pixels contained in the image and it does not modify the values of the pixels and therefore does not affect the distribution of the intensity levels of the encrypted image.Figure 9
Histogram analysis of encryption process with and without permutation process, by using the key(
0.1,0.1,0.1
).Correlation Analysis. Typically, a plain image presents high correlation between adjacent pixels. In this sense, cryptographic algorithms should reduce the correlation in order to provide adequate strength against statistical attack. In Figure 10, we present the results of the horizontal, vertical, and diagonal correlation from the adjacent pixels of the encrypted image with and without permutation process.Figure 10
Horizontal, vertical, and diagonal correlation distribution of the original image (I
o), encrypted image without permutation (I
c), and encrypted image with permutation (I
c
p), by using the key (0.1, 0.1, 0.1).The correlation analysis is calculated as follows:(7)
E
x
=
1
N
∑
i
=
1
N
x
i
,
E
y
=
1
N
∑
i
=
1
N
y
i
,
(8)
D
x
=
1
N
∑
i
=
1
N
x
i
-
E
x
2
,
D
y
=
1
N
∑
i
=
1
N
y
i
-
E
y
2
,
(9)
cov
⁡
x
,
y
=
1
N
∑
i
=
1
N
x
i
-
E
x
y
i
-
E
y
,
(10)
r
x
y
=
cov
⁡
x
,
y
D
x
×
D
y
,where x and y are the grey values of two adjacent pixels in the image, cov
⁡
x
,
y is the covariance, D is the variance, and E is mean. Table 1 shows the numerical results of the correlations of the encrypted image with and without permutation process.Table 1
Correlation coefficient of encrypted image.
Image
Horizontal correlation
Vertical correlation
Diagonal correlation
Plain image
0.8180
0.8670
0.8184
Encryption without permutation
0.0392
0.0082
0.0392
Encryption with permutation
0.0199
-
0.0045
0.0199By observing the results presented in Figure10, there are concentration points in plain image correlation, which indicates that there is a high correlation between the adjacent pixels. However, the encrypted image with and without permutation and the plot show low correlation. In numerical results, the values close to ±
1 indicate high correlation and values close to 0 indicate low correlation. The results of Table 1 showed low correlation for plain image with approximately 0.8 (close to 1); therefore, this value is an indicator of the high correlation. On the other hand, the encrypted image presents low correlation (close to 0); therefore the encryption process is robust.


### 5.2.2. Exhaustive Attack

This rudimentary but effective attack is known as brute force attack, in which all possible keys are tried until the correct secret key is found and the original message is decrypted. This type of attack is related to the key. Therefore, we check the efficiency of the key in the cryptographic scheme with a key space analysis and secret key sensitivity analysis.Key Space Analysis. The key space must be greater than 2
100
=
1.2677
×
1
0
30 to resist an exhaustive attack, according to Alvarez and Li reported in [32]. The key used in the encryption scheme is based on the initial condition of the hyperchaotic Rössler map (
x
1
,
x
2
,
x
3
). Therefore, with a precision of 10
12, the encryption scheme provides a key space of 1
0
12
×
1
0
12
×
1
0
12
=
1
0
36. In addition, the key space can be increased by 1
0
150 if we considered the parameter controls α, β, γ, δ, ς, η, and θ of the hyperchaotic Rössler map and a precision of 10
15. Therefore, the key space is suitable to resist an exhaustive attack.Secret Key Sensitivity Analysis. The cryptographic scheme must be highly sensitive to small variations in the key to resist differential attack; that is, similar secret keys must generate totally different encrypted images. Chaotic systems present highly sensitive to initial conditions; that is, they present different chaotic dynamics when the initial conditions are slightly modified. In Figure 11, we present two encrypted images with and without permutation process by using the key (
0.1,0.1,0.1
) and the second column presents the decrypted image by using incorrect secret key (
0.1,0.1,0.100000000001
). Therefore, the decrypted image cannot be recovered if the secret key is not exactly used such as in encryption process.Figure 11
Secret key sensitivity analysis.In order to show the secret key sensitivity in the encryption process, the correlation (see (10)) and MSE (see (12)) are used. In this analysis, two cryptograms are generated by using the same plain image but with two similar secret keys, which are highly similar to each other. Several pairs of cryptograms are produced by using (
0.1,0.1,0.1
) and (
0.1,0.1,0.1
+
Δ
x
3
) as secret keys. In each pair of cryptograms, the mean square error MSE (see Section 5.3) and the correlation coefficient are calculated. In Figure 12(a), the MSE results of several pairs of cryptograms are showed by using increments of Δ
x
3. Since the MSE values are high and uniform, the proposed scheme presents high sensitivity at small variations in secret keys. On the other hand, in Figure 12(b), the correlation of the same pairs of cryptograms is determined. The results of correlation are close to zero in each test, which indicates that both cryptograms are highly different from each other and this is another proof of the high sensitivity of secret key in the proposed scheme.Figure 12
Secret key sensitivity analysis: (a) MSE curves and (b) correlation curves.
(a)
(b)


### 5.2.3. Differential Analysis

The third analysis presented is against differential attack. If the encryption process is weak, an adversary could implement this attack to find a relation between similar plain images and determine the secret key. The analysis consists in encrypting two similar plain images with a small change in just one pixel. After that, the encryption algorithm is applied to both of them by using the same secret key. Then, a comparison between the encrypted images is performed. There are two parameters used to examine the resistance against differential attack, which areN
P
C
R (Number of Pixels Change Rate) and U
A
C
I (Unified Changing Average Intensity). These values are calculated as follows:(11)
C
i
,
j
=
0
if
T
1
i
,
j
=
T
2
i
,
j
1
if
T
1
i
,
j
≠
T
2
i
,
j
,
N
P
C
R
=
∑
i
M
∑
j
N
C
i
,
j
M
×
N
×
100
%
,
UACI
=
∑
i
M
∑
j
N
T
1
i
,
j
-
T
2
i
,
j
255
×
M
×
N
×
100
%
,where M and N are the height and width of the image and T
1
(
i
,
j
) and T
2
(
i
,
j
) are the pixel value in the location (
i
,
j
) of the encrypted images. In this analysis, we considered the plain fingerprint image showed in Figure 8. The value of the pixel 127 of the original image is changed to the value of 128. Subsequently, the encryption is applied to both images. Therefore, two cryptograms are generated T
1
(
i
,
j
) and T
2
(
i
,
j
). In the encryption process without permutation process, we have N
P
C
R
c
=
100
% and U
A
C
I
c
=
0.7850
%. This indicates that the cryptographic scheme is robust against differential attack.


## 5.2.1. Statistical Analysis

In this analysis, the distribution and correlation are considered. The histogram of the image can give visual information of the distribution of the intensity levels of red, green, and blue component of a color image. In addition, the numerical correlation is calculated according to a specific expression to determine if the encrypted image presents low correlation, which is desired in a good encryption algorithm.Histogram Analysis. Cryptographic algorithms must provide a uniform distribution of grey values in the histogram in order to provide adequate strength against a statistical attack. In Figure 9, we present the histograms of the image before and after encryption, considering that the encryption is performed with or without the permutation stage. It can be seen that the distribution of grey values from the original image is concentrated in some grey scale values, whereas the histograms of the encrypted images are nearly uniform. Also, it shows that the encrypted image histograms are the same with or without the permutation stage, because the permutation process only changes the positions of the pixels contained in the image and it does not modify the values of the pixels and therefore does not affect the distribution of the intensity levels of the encrypted image.Figure 9
Histogram analysis of encryption process with and without permutation process, by using the key(
0.1,0.1,0.1
).Correlation Analysis. Typically, a plain image presents high correlation between adjacent pixels. In this sense, cryptographic algorithms should reduce the correlation in order to provide adequate strength against statistical attack. In Figure 10, we present the results of the horizontal, vertical, and diagonal correlation from the adjacent pixels of the encrypted image with and without permutation process.Figure 10
Horizontal, vertical, and diagonal correlation distribution of the original image (I
o), encrypted image without permutation (I
c), and encrypted image with permutation (I
c
p), by using the key (0.1, 0.1, 0.1).The correlation analysis is calculated as follows:(7)
E
x
=
1
N
∑
i
=
1
N
x
i
,
E
y
=
1
N
∑
i
=
1
N
y
i
,
(8)
D
x
=
1
N
∑
i
=
1
N
x
i
-
E
x
2
,
D
y
=
1
N
∑
i
=
1
N
y
i
-
E
y
2
,
(9)
cov
⁡
x
,
y
=
1
N
∑
i
=
1
N
x
i
-
E
x
y
i
-
E
y
,
(10)
r
x
y
=
cov
⁡
x
,
y
D
x
×
D
y
,where x and y are the grey values of two adjacent pixels in the image, cov
⁡
x
,
y is the covariance, D is the variance, and E is mean. Table 1 shows the numerical results of the correlations of the encrypted image with and without permutation process.Table 1
Correlation coefficient of encrypted image.
Image
Horizontal correlation
Vertical correlation
Diagonal correlation
Plain image
0.8180
0.8670
0.8184
Encryption without permutation
0.0392
0.0082
0.0392
Encryption with permutation
0.0199
-
0.0045
0.0199By observing the results presented in Figure10, there are concentration points in plain image correlation, which indicates that there is a high correlation between the adjacent pixels. However, the encrypted image with and without permutation and the plot show low correlation. In numerical results, the values close to ±
1 indicate high correlation and values close to 0 indicate low correlation. The results of Table 1 showed low correlation for plain image with approximately 0.8 (close to 1); therefore, this value is an indicator of the high correlation. On the other hand, the encrypted image presents low correlation (close to 0); therefore the encryption process is robust.


## 5.2.2. Exhaustive Attack

This rudimentary but effective attack is known as brute force attack, in which all possible keys are tried until the correct secret key is found and the original message is decrypted. This type of attack is related to the key. Therefore, we check the efficiency of the key in the cryptographic scheme with a key space analysis and secret key sensitivity analysis.Key Space Analysis. The key space must be greater than 2
100
=
1.2677
×
1
0
30 to resist an exhaustive attack, according to Alvarez and Li reported in [32]. The key used in the encryption scheme is based on the initial condition of the hyperchaotic Rössler map (
x
1
,
x
2
,
x
3
). Therefore, with a precision of 10
12, the encryption scheme provides a key space of 1
0
12
×
1
0
12
×
1
0
12
=
1
0
36. In addition, the key space can be increased by 1
0
150 if we considered the parameter controls α, β, γ, δ, ς, η, and θ of the hyperchaotic Rössler map and a precision of 10
15. Therefore, the key space is suitable to resist an exhaustive attack.Secret Key Sensitivity Analysis. The cryptographic scheme must be highly sensitive to small variations in the key to resist differential attack; that is, similar secret keys must generate totally different encrypted images. Chaotic systems present highly sensitive to initial conditions; that is, they present different chaotic dynamics when the initial conditions are slightly modified. In Figure 11, we present two encrypted images with and without permutation process by using the key (
0.1,0.1,0.1
) and the second column presents the decrypted image by using incorrect secret key (
0.1,0.1,0.100000000001
). Therefore, the decrypted image cannot be recovered if the secret key is not exactly used such as in encryption process.Figure 11
Secret key sensitivity analysis.In order to show the secret key sensitivity in the encryption process, the correlation (see (10)) and MSE (see (12)) are used. In this analysis, two cryptograms are generated by using the same plain image but with two similar secret keys, which are highly similar to each other. Several pairs of cryptograms are produced by using (
0.1,0.1,0.1
) and (
0.1,0.1,0.1
+
Δ
x
3
) as secret keys. In each pair of cryptograms, the mean square error MSE (see Section 5.3) and the correlation coefficient are calculated. In Figure 12(a), the MSE results of several pairs of cryptograms are showed by using increments of Δ
x
3. Since the MSE values are high and uniform, the proposed scheme presents high sensitivity at small variations in secret keys. On the other hand, in Figure 12(b), the correlation of the same pairs of cryptograms is determined. The results of correlation are close to zero in each test, which indicates that both cryptograms are highly different from each other and this is another proof of the high sensitivity of secret key in the proposed scheme.Figure 12
Secret key sensitivity analysis: (a) MSE curves and (b) correlation curves.
(a)
(b)


## 5.2.3. Differential Analysis

The third analysis presented is against differential attack. If the encryption process is weak, an adversary could implement this attack to find a relation between similar plain images and determine the secret key. The analysis consists in encrypting two similar plain images with a small change in just one pixel. After that, the encryption algorithm is applied to both of them by using the same secret key. Then, a comparison between the encrypted images is performed. There are two parameters used to examine the resistance against differential attack, which areN
P
C
R (Number of Pixels Change Rate) and U
A
C
I (Unified Changing Average Intensity). These values are calculated as follows:(11)
C
i
,
j
=
0
if
T
1
i
,
j
=
T
2
i
,
j
1
if
T
1
i
,
j
≠
T
2
i
,
j
,
N
P
C
R
=
∑
i
M
∑
j
N
C
i
,
j
M
×
N
×
100
%
,
UACI
=
∑
i
M
∑
j
N
T
1
i
,
j
-
T
2
i
,
j
255
×
M
×
N
×
100
%
,where M and N are the height and width of the image and T
1
(
i
,
j
) and T
2
(
i
,
j
) are the pixel value in the location (
i
,
j
) of the encrypted images. In this analysis, we considered the plain fingerprint image showed in Figure 8. The value of the pixel 127 of the original image is changed to the value of 128. Subsequently, the encryption is applied to both images. Therefore, two cryptograms are generated T
1
(
i
,
j
) and T
2
(
i
,
j
). In the encryption process without permutation process, we have N
P
C
R
c
=
100
% and U
A
C
I
c
=
0.7850
%. This indicates that the cryptographic scheme is robust against differential attack.


## 5.3. Mean Square Error Analysis

A method to determine the error between original image and encrypted image is by using the mean square error MSE parameter, which is the existing qualitative squared error between both compared images [33]. The MSE parameter is calculated by the following expression:(12)
M
S
E
=
1
M
×
N
∑
i
=
1
M
∑
j
=
1
N
F
1
i
,
j
-
F
2
i
,
j
2
,where F
1
(
i
,
j
) is the original image, F
2
(
i
,
j
) is the encrypted image, and M
×
N is size of the original image. Higher values of MSE mean higher immunity against attacks. MSE values close to zero mean that both tested images are highly similar. The MSE calculated from original image and encrypted image showed in Figure 7 is M
S
E
=
12324.3893. On the other hand, the MSE between original image and the correct retrieved image is M
S
E
=
0.


## 5.4. Chosen/Known Plain Image Attack

The chosen/known plain image attack is a powerful cryptanalyst attack, which has broken several image encryption algorithms based on chaos. In a chosen plain image attack, the cryptanalyst chose a convenient image, for example, an image with all pixels in black to eliminate the function of the plain image over the algorithm (permutation and diffusion) and try to find the secret key (chaos), since its pixel values are zero.In Figure13, we present the chosen plain image attack by using the black plain image, which is shown in Figure 13(a). The corresponding encrypted black plain image is shown in Figure 13(b), which can be represented by the secret key or the chaotic sequence used in several cryptograms. Then, the cryptanalyst uses this information as a possible secret key and tries to decrypt other cryptograms that probably were encrypted with that secret key. In this case, the cryptanalyst used the cryptogram of the fingerprint used in Figure 7, which is shown in Figure 13(c). Nevertheless, the corresponding decrypted image (Figure 13(d)) cannot be retrieved correctly, if data of Figure 13(b) are used as secret key. Therefore, the proposed encryption algorithm is robust against this kind of attack.Figure 13
Chosen plain image attack: (a) chosen black plain image, (b) cryptogram of black image and possible secret key, (c) cryptogram of fingerprint image, and (d) decryption of encrypted fingerprint with the possible secret key.
(a)
(b)
(c)
(d)


## 5.5. Occlusion Attack Analysis

In an occlusion attack, the transmitted encrypted image could lose blocks of information and not all the cryptograms can arrive to the receptor correctly. In this section, we present the robustness of the proposed encryption algorithm against 12.5%, 25%, and 50% of occlusion in an encrypted image. In Figure14, the decryption image against three cases of occlusion is showed. The corresponding MSE values are 1844.9842 for 12.5%, 3581.8797 for 25%, and 7101.4179 for 50%. Since the decrypted image can be retrieved, the proposed encryption algorithm can resist an occlusion attack.Figure 14
Tolerance against occlusion attacks, considering data loss of 12.5%, 25%, and 50%.


## 5.6. Noise Attack Analysis

This analysis shows the effectiveness of the proposed scheme against noise attack. In contrast to occlusion attack, the encrypted images can lose small portions of data over the encrypted image. In the analysis, encrypted data are distorted by zero-mean white additive Gaussian noise with a standard deviation from 0 to 0.3 with increments of 0.01. Figure15 shows several decrypted images from encrypted image with added noise. In addition, Figure 16 presents the MSE and correlation curves between original image and recovered image. According to the results, the proposed scheme is robust against noise attack.Figure 15
Decrypted image from cryptograms with Gaussian noise added.Figure 16
MSE and correlation curves between original and retrieved image in noise attack.
(a)
(b)


## 5.7. Encryption Time Analysis

The encryption and decryption processes are performed on a Laptop Toshiba Satellite E105-S1402 with operating system Windows Vista, processor speed of 2.26 Ghz, and 4 GB DDR2. The simulation is implemented in MATLAB R2008a software. “.bmp” plain image encryption of greyscale with355
×
390 pixels (139,918 bytes) requires just 0.2340 seconds. The decryption process requires just 0.2105 seconds. Therefore, the proposed encryption algorithm can be implemented in real-time applications.


## 6. Comparison with Similar Schemes in Literature

In this section, we present an important comparison with recent schemes reported in literature to show the effectiveness of the proposed scheme. The histogram generated by our scheme presents a uniform distribution, due to the highly uniform distribution of the values of the hyperchaotic sequences that benefit the encryption process at statistical level.In Table2, we present a space keys comparison with recent encryption schemes. In our scheme, we use just one hyperchaotic system to obtain a big space key. In [14], the authors use two 1D chaotic systems and two 3D chaotic systems to present a similar space key.Table 2
Comparison of space key.
Proposed
Reference [14]
Reference [11]
Reference [24]
Reference [25]
Reference [26]
Space key
1
0
150
1
0
154
1
0
108
1
0
78
1
0
140
1
0
84Table3 presents a comparison of the speed encryption. The proposed scheme is faster than others where hyperchaotic or many chaotic systems are used to encrypt images.Table 3
Speed of encryption/decryption.
Speed of encryption
Speed of decryption
Units
Proposed
0.2340
0.2105
Seconds
Reference [14]
0.52
—
Seconds
Reference [26]
1.5
2
Seconds


## 7. Conclusions

In this paper, we present a robust and fast fingerprint image encryption algorithm scheme by using a hyperchaotic map. The security analysis verifies the security capabilities of the proposed scheme to be used in real applications and enforce the security of the biometric systems. The encryption process presents high security when the permutation stage is omitted. However, the correlation is lower when the proposed permutation presses is applied, which benefits the strength of the encryption scheme against statistical attacks.



---

*Source: 2670494-2016-07-31.xml*