38
Vol. 2, No. 8, August 2010
A New Approach to Measure Quality of Image
Encryption
Alireza Jolfaei1 and Abdolrasoul Mirghadri2
1
Faculty and Research Center of Communication and Information Technology, IHU, Tehran, Iran
Jolfaei@yahoo.com
2
Faculty and Research Center of Communication and Information Technology, IHU, Tehran, Iran
Amrghdri@ihu.ac.ir
Abstract: Image encryption techniques are applied widely in
the digital world today to assure information security. Although
more and more encryption algorithms appear, they lack a
method to evaluate the encryption quality. Visual inspection is
not enough on judging the quality of encrypted images. So, we
propose three classes of measurements based on the pixel’s
position changing, value changing and both value-position
changing. In order to evaluate the efficiency of methods,
measurements were applied on three different chaotic image
encryption algorithms based on the baker’s map, Arnold cat
map and standard map. Experimental results indicate the
performance of the measurement techniques in terms of
producing results that are consistent with the judgment by visual
inspection.
Keywords: encryption quality, chaotic image encryption,
baker’s map, Arnold cat map, standard map
1. Introduction
Nowadays, along with the development of digital
technologies and telecommunication networks, there is a
substantial increase in the demand for private and secure
movement of highly confidential imagery data over public
channels. The concern for protection of information is
increasing at an alarming rate. It is important to protect the
confidentiality of imagery data from unauthorized access.
Security breaches may affect user’s privacy and reputation.
So, data encryption is widely used to confirm security in
open networks such as the internet.
Digital image is a massive two-dimensional data. The
smallest unit of an image is a pixel. In a digital image, each
pixel represents a different level of color intensity.
According to the capacity of human visual perception in
distinguishing different levels of intensity, the entire range
of intensity is divided into 256 levels. Thus, the level of
intensity in each pixel has a value between 0 and 255. This
range is demonstrated by a byte (8 bits). Therefore, each
pixel is equal to one byte. For example, a gray scale image
with size of 256×256 pixels is approximately 65 KB. So, an
image with a small size has a large data volume. However,
due to large data size and real time requirement, it is not
reasonable to use conventional encryption methods. Thus, a
major recent trend is to minimize the computational
requirements for secure multimedia distribution.
(IJCNS) International Journal of Computer and Network Security,
During last two decades, chaotic dynamical systems have
attracted the attention of cryptographers due to their
definable and pseudo-random behavior. In consequence of
increased interest in this field, a large number of chaos
based image encryption schemes have been proposed [1, 2,
3]. Designing good image encryption schemes has become a
focal research topic since the early 1990s. So far a number
of image encryption quality measures have been proposed
[4, 5, 6]. However, Most of the previous studies on image
encryption were based on visual inspection to judge the
effectiveness of the encryption techniques. Unfortunately,
there are no classified measures to justify and compare the
effectiveness of proposed schemes. However, in [7],
Elkamchouchi and Makar presented quantitative measures
of the encryption quality based on maximum deviation and
correlation. Afterwards, they proposed an improved version
of maximum deviation measure and named it as irregular
deviation measurement. In this paper, we present new
classified tests for encryption quality measurement and
implement these tests on three common encryption schemes
based on baker’s map, Arnold cat map and standard map
and compare the results.
This paper is organized as follows. In the next section
three image encryption schemes based on chaotic maps are
briefly overviewed. In Section 3, the new classified measures
of encryption quality are introduced. Experimental results
for presented encryption schemes are reported in section 4.
Finally, some conclusions are given in Section 5.
2. Chaotic Image Encryption Algorithm
The increasing interests in utilizing chaotic dynamics in
various cryptographic applications have ignited tremendous
demands for chaos generators with complex dynamics but
simple designs. The mixing property of chaotic maps is of
particular interests for cryptographic designs. Due to the
differences in formulations, the nature of the generated
chaotic maps may not be the same and hence their
characteristics are different. Among chaotic maps, 2D
baker’s map, Arnold cat map and standard map attract
much attention. These prevalent maps are described as
follows.
2.1 Baker’s Map
The baker’s map, invented by Eberhard Hopf in 1937, is an
intuitively accessible, two-dimensional chaos-generating
 (IJCNS) International Journal of Computer and Network Security, 39
Vol. 2, No. 8, August 2010

discrete dynamical system [8]. This is a simple example of a discovered the ACM in the 1960s and he used the image of
map similar to a horseshoe, although it is a discontinuous a cat while working on it [11]. Assume that the dimension
map [9]. Consider the map F for the half-open square of the original grey scale image is N×N. Arnold cat map is
[0,1) ×[0,1) onto itself where described as follows:

 x n +1  x n  1 p  x n 
F (x , y ) = (σ (x ), g (a , x , y )) (1)   = A   mod N =     mod N , (5)
 y n +1  yn  q pq + 1  y n 

where p and q are positive integers and det (A) = 1, which

σ ( x) = 2 x mod 1 , 0 ≤ σ ( x) < 1 (2)
makes the map area-preserving. The (xn+1, yn+1) is the new
position of the original pixel position (xn, yn) when Arnold
1 1 
cat map is performed once. The period T of the Arnold cat
 2 ay 0≤x <
2  map depends on the parameters p, q and the size N of the
g (a , x , y ) =   mod 1, 0 ≤ g < 1. (3) original image. After iterating this map m times, we have
1
 (ay + 1) 1 
≤ x <1 
 2 2  x n +m  m x n 
  = A   mod N . (6)
We show F(S) in Fig. 1, where S is the unit square. The  n +m 
y yn 
geometrical nature of the map is equivalent to a horizontal
stretching and vertical contraction, followed by a vertical An interesting property of the ACM is the Poincaré
cutting and stacking. This resembles the preparation of Recurrence Theorem [12]. The Poincaré Recurrence
dough, so F is often called the baker’s transformation. Theorem states that certain systems will, after a sufficiently
long time, return to a state very close to the initial state.
Since an image is defined as a 2D matrix with finite
This means that after a certain number of iterations the
pixels, a correspondingly discretized form of the baker’s
ACM will return to its original state.
map needs to be derived. In fact, a discretized map is
required to assign a pixel to another pixel in bijective 2.3 Standard Map
manner. In [10], Pichler and Scharinger suggested an The 2D standard map illustrates the motion of a simple
approach for the discretized generalized baker’s map as mechanical system called the kicked rotator [13]. This map
follows: is an area-preserving chaotic map from [0, 2π)×[0, 2π) onto
itself and is described by
N N n N
B( n ,...,n k ) (x , y ) =( (x − N i ) + y mod , i ( y − y mod ) + N i ). (4)
1 ni ni N ni x n +1 = (x n + y n ) mod 2π
 (7)
Considering a N×N square image, B(n1,...,nk ) denotes the  y n +1 = ( y n + k sin x n +1 ) mod 2π ,
discretized generalized baker’s map with where (x n , y n ) ∈ [0,2π ) , and the constant k > 0 is the
N i ≤ x < N i + ni +1 and 0 ≤ y < N . The sequence of k control parameter. In order to map image pixels to another
integers, n1,…, nk, is chosen such that each integer ni in a bijective manner, the discretized version of standard
divides N and n1+…+ni = Ni. map is required. In [14], Fridrich stated the criterion for
continuous map discretization. So, the discretized standard
map is attained by substituting
N N N
X =x , Y =y , K =k , which maps from [0,
2π 2π 2π
2π)×[0, 2π) to N×N. The discretized map is as follows

x n +1 = (x n + y n )mod N ,

 2π x n +1 (8)
 y n +1 = ( y n + k sin( N ))mod N .
(a)
This map reduces the computational complexity by
operating in integer domain. So, it is more suitable for real-
time data encryption.

3. Measurement of Encryption Quality

(b)
Image encryption quality measures are figures of merit used
Figure 1. Baker’s map: (a) geometrical nature of the baker’s map, (b) for the evaluation of image encryption techniques. We
area contraction by the map F.
classify these measures into three categories: methods based
on the pixel’s position changing, methods based on the
2.2 Arnold Cat Map pixel’s value changing and methods based on both pixel’s
The Arnold cat map is a discrete system that stretches and value and position changing. We present these measures as
folds its trajectories in phase space. Vladimir Arnold follows.
40 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 8, August 2010

3.1 Measurement Based on the Position Changing H −1 W −1

| P (i , j ) − C (i , j ) |
∑∑
1
Here, we propose a method to justify the confusion property ARE = , (13)
HW | P (i , j ) |
of a chaotic map. That is to test the average distance change i =0 j =0
(ADC) among indices of closed pixels in plain-image and
which gives the average relative error of a pixel.
indices of relocated pixels in cipher-image. If an H×W
image is permuted by chaotic map, then for the four
3.3 Measurement Based on the Value and Position
neighbor pixels in the plain-image {(i–1, j), (i+1, j), (i, j–1),
Changing
(i, j+1): (i = 1, 2,…, H–2), (j = 1, 2 ,…, W–2)}, the average
distance change is defined as In [6], Yu et al. presented a new method of evaluating
scrambling degree through judging the relativity of closed
1 pixels. Their method for evaluating scrambling degree for
ADC (i , j ) = [ D ((i ′ − 1, j ′),(i − 1, j )) + D ((i ′ + 1, j ′), (i + 1, j )) (9)
4 an image of H×W is as follows:
+ D ((i ′, j ′ − 1),(i , j − 1)) + D ((i ′, j ′ + 1), (i , j + 1))],
H −1 W −1

D ((i ′, j ′), (i , j )) = (i ′ − i ) 2 + ( j ′ − j ) 2 , (10) ∑ ∑ Rij

i =0 j =0
S= , (14)
where (i', j') is the location of the pixel permuted from the 2552 × H ×W
one (i, j). Thus, the average distance change in the whole
image is Rij = F1 (i , j ) + F2 (i , j ) + F3 (i , j ) + F4 (i , j ), (15)

H −2 W −2
F1 (i , j ) =| [C (i − 1, j ) − C (i , j )]2 − [P (i − 1, j ) − P (i , j )]2 |
∑ ∑ ADC (i , j ). (11)
1
ADC = 
(H − 2)(W − 2) F2 (i , j ) =| [C (i + 1, j ) − C (i , j )]2 − [P (i + 1, j ) − P (i , j )]2 |
i =1 j =1 (16)

F3 (i , j ) =| [C (i , j − 1) − C (i , j )] − [P (i , j −1) − P (i , j )] |
2 2
Seen from Eq. (11), the average distance change is always

F4 (i , j ) =| [C (i , j + 1) − C (i , j )] − [P (i , j + 1) − P (i , j )] |,
bigger than 0, unless the permuted image is the same as the 2 2

original one. The bigger ADC, the more confused the

original image. The ADC is in relation with iteration time.
3.2 Measurement Based on the Value Changing
Plain-image pixels values change after image encryption as
compared to their original values before encryption. Such
change may be irregular. This means that the higher the
change in pixels values, the more effective will be the image
encryption and hence the encryption quality. So the
encryption quality may be expressed in terms of the total
changes in pixels values between the plain-image and the
cipher-image. Ahmed et al. proposed a measure for
encryption quality that is expressed as the deviation between
the original and encrypted image [4]. This method is
determined as follows:
Let P, C denote the original image (plain-image) and the
encrypted image (cipher-image) respectively, each of size
W×H pixels with L grey levels.
P (x , y ),C (x , y ) ∈ {0,..., L − 1} are the grey levels of the
images P, C at position (x, y), 0 <x < W–1, 0 <y < H–1. We
will define HL(P) as the number of occurrence for each grey
level L in the original image (plain-image), and HL(C) as
the number of occurrence for each grey level L in the
encrypted image (cipher-image). The encryption quality
represents the average number of changes to each grey level
L and it can be expressed mathematically as:
255
∑ | H L (C ) − H L (P ) |
L =0
EQ = . (12)
256
Another measurement is proposed by Luo et al. by
computing the relative error [5], which for an image of
H×W is defined as
where S is scrambling degree, S ∈ (0,1) , Rij is the relativity
of each pixel and its closed pixels. Fk (i , j ) : k ∈ {1, 2,3, 4} ,
is the relativity of each pixel and 4 pixels around it, C(i, j) is
the pixel of the cipher-image and P(i, j) is the pixel of the
plain-image. A problem exists in Yu et al.'s measurement
method that occurs at the edge of the image. The pixels that
fall off the image matrix are not defined. So, there is a
problem in computing Fk (i , j ) for {(i , j ) : i = 0, H + 1 &
j = 0,W + 1} . Yu et al. probably performed zero padding
for the pixels that fall off the image to calculate Fk (i , j ) .
We redefine the space of scrambling degree function to
(H–2)×(W–2) to omit zero padding and improve scrambling
degree measurement as follows:
H − 2 W −2
∑ ∑ Rij
i =1 j =1
S= . (17)
255 × (H − 2) × (W − 2)
2
Not only this method can evaluate the change of each
pixel’s position, but also evaluate the change of adjacent
pixel’s value.
4. The Analysis of Simulation Experiment
In order to further confirm the feasibility and validity of the
presented measures, we select the classical image of
256×256 Lena with 256 gray levels as the original image
and adopt the discretized generalized baker’s map, Arnold
cat map and discretized standard map to be the encryption
algorithm.
 (IJCNS) International Journal of Computer and Network Security, 41
Fig. 2 shows the original image. Fig. 3 shows the results
of applying the generalized discretized baker map with the
sequence of 9 divisors of 256: (8, 8, 8, 64, 128, 16, 16, 4, 4),
once, 9 and 20 times, respectively. By comparing the
original and the encrypted images in Figs. 2 and 3, there is
no visual information observed in the encrypted images, and
the encrypted images are visually indistinguishable. The
cipher-images of Figs. 3(b) and 3(c) are almost the same
and seem to have uniform pixel distribution. Uniformity
caused by an encryption function is justified by the chi-
square test. For more information about uniform
distribution, we recommend taking a look at [15]. Fig. 4
demonstrates the results of applying the ACM once, 9 and
20 times, respectively. The fluctuations in the cipher image
are visually inspected along with the iteration times. The
cipher-image of iterated 9 times is almost distinguishable
from the 20 times. Fig. 5 depicts the results of applying the
discretized standard map with k = 2010 as the control
parameter once, 9 and 20 times, respectively. The cipher-
images of Fig. 5 are visually more uniform than cipher-
images of Fig. 4. Figs. 3, 4 and 5 draw a conclusion that
there is a small fluctuation in cipher-image along with the
iteration times. However, there are some differences in
cipher-images and it is difficult to judge the quality by
visual inspection. Also, it is observed that discretized
generalized baker’s map and discretized standard map
generate more uniform cipher-images in comparison with
ACM.
Figure 2. Original image.
(a) (b) (c)
Figure 3. The test image after applying the discretized
generalized baker’s map: (a) once, (b) 9 times and (c) 20
times.
(a) (b) (c)
Figure 4. The test image after applying the ACM: (a)
once, (b) 9 times and (c) 20 times.
Vol. 2, No. 8, August 2010
(a) (b) (c)
Figure 5. The test image after applying the discretized standard map: (a)
once, (b) 9 times and (c) 20 times.
According to the property of chaotic map, the confusion
property is in relation with iteration time. We tested the
confusion property of baker’s map, Arnold cat map and
standard map by computing the average distance change.
Table 1 shows the average distance change of chaotic maps
for one, 9 and 20 iterations. The resulting curves are shown
in Fig.6, which show the relationship between the ADC and
number of iteration. The chaotic algorithms are iterated 192
times for this test. Seen from the figure, curves are
fluctuating as the number of iteration increases. However,
the curve of the baker’s map oscillates much more than the
one of ACM and the one of standard map. Moreover, by
comparing Figs. 6(a), 6(b) and 6(c), it is seen that ACM
permutation period is smaller than the discretized
generalized baker’s map and the discretized standard map.
The ADC curve of ACM is symmetric for 192 iterations. By
contrast, there is no symmetry in baker and standard map’s
ADC curve within 192 iterations. After 192 times of
iterating ACM, the pixels of test image return to their
original locations. This return to the original image makes it
proportionately easier for the attackers to decipher the
message through a simple brute force attack.
(a)
(b)
42 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 8, August 2010

(c) (a)

Figure 6. Test Result of average distance change (ADC)

for the discretized generalized baker’s map, Arnold cat map
and discretized standard map. Here, Figs. (a), (b) and (c)
correspond to baker, Arnold and standard map, respectively.
In each figure, the curves show the relationship between
ADC and iteration time.

Table 1: ADC measurement

Chaotic Map
Discretized generalized baker’s map
ACM
Discretized standard map
Number of iteration
1 9 20
100.5775 131.4606 126.9832
138.5058 132.9395 132.9348 (b)
136.5355 132.5094 132.8694

Test results based on the image Value Changing for one,

9 and 20 iterations are listed in table 2. Table 2 illustrates
that Ahmed et al.’s proposed method is not efficient for
computing encryption quality of permutation algorithms
realized by chaotic maps. This method is based on
computing the average changes in the number of occurrence
for each grey level. The chaotic maps under study do not
change the number of occurrence for each grey level. So,
result of Ahmed et al.’s method of encryption quality is
zero. From the listed data in table 2 we can see that the
average relative error between pixels of plain-image and
cipher-image changes as the number of iteration increases.
It is not easy to compare the results by simply observing
them in the table. So, for a better comparison, we computed
the average relative error of chaotic maps for 192 iterations
and depicted the results in Fig. 7. By comparing Figs. 7(a),
7(b) and 7(c), it is seen that baker’s and standard’s curve
contain large sharp rises followed by sharp declines, as
opposed to ACM’s curve that is steadier. Also, baker’s
oscillation range is larger than standard map’s oscillation
range. Along with iteration time increment, the change in
pixel values realized by the discretized standard map varies
less than the changes caused by the discretized generalized
baker’s map realization.
(c)
Figure 7. Test Result of average relative error between
pixels of plain-image and cipher-image for the discretized
generalized baker’s map, Arnold cat map and the
discretized standard map. Here, Figs. (a), (b) and (c)
correspond to baker, Arnold and standard map, respectively.
In each figure, the curves show the relationship between
average relative error and iteration time.
The improved scrambling degree was computed By
Applying equation (17) on the test image and its
corresponding cipher-images. The measurement of
scrambling degree for one, 9 and 20 iterations is shown in
table 3. Table 3 illustrates that there is a fluctuation between
scrambling degree of the chaotic maps under study. It is not
easy to compare the results by simply observing them in the
table. So, for a better comparison, we have computed the
scrambling degree of each chaotic map for 192 iterations
and depicted the results in Fig. 8. The highest and the
 (IJCNS) International Journal of Computer and Network Security, 43
lowest degree are distinguished from the figure. Fig. 8
indicates that baker’s scrambling degree resultant curve has
the least deviation among curves. Also, the resultant curve
of scrambling degree of standard map is smoother than
ACM’s. The higher the scrambling degree, the better the
encryption security.
(a)
(b)
(c)
Figure 8. Test Result of improved scrambling degree for
the discretized generalized baker’s map, Arnold cat map
and the discretized standard map. Here, Figs. (a), (b) and (c)
correspond to baker, Arnold and standard map, respectively.
In each figure, the curves show the relationship between
scrambling degree and iteration time.
Vol. 2, No. 8, August 2010
Table 2: Measurement based on the value changing
Luo et al.
Chaotic Map Ahmed et al. Number of iteration
1 9 20
Discretized generalized baker map 0 0.1456 0.1471 0.1437
ACM 0 0.1382 0.1469 0.1469
Discretized standard map 0 0.1526 0.1458 0.1456
Table 3: Measurement based on scrambling degree
Number of iteration
Chaotic Map
1 9 20
Discretized generalized baker’s map 0.0535 0.2731 0.2770
ACM 0.0508 0.2845 0.2794
Discretized standard map 0.2476 0.2786 0.2773
5. Conclusion
A new classification in the field of image encryption’s
quality measurement is introduced in this paper. The new
approach is based on the pixel’s position changing, value
changing and both value and position changing. We applied
these measures on the ciphers based on discretized
generalized baker’s map, ACM and discretized standard
map. Experimental simulations showed the performance of
the developed quality measurement techniques in terms of
producing results that are consistent with the judgment by
visual inspection. We showed that Ahmed et al.’s method of
quality measurement is inefficient for the permutation only
image ciphers. According to the test results of ADC, relative
error and improved scrambling degree, encryption schemes
based on discretized generalized baker’s map and
discretized standard map generate more uniform cipher-
images compared to ACM. Besides, resulting curves
demonstrate that ACM permutation period is smaller than
discretized baker and standard map. Moreover, by
comparing these curves, we can find the iteration time that
maximum encryption quality occurs. Finally, we suggest
using a combination of the three classified quality
measurement techniques when judging a certain encryption
algorithm.
Acknowledgments
This research was supported by the Iran Telecommunication
Research Center (ITRC) under Grant no. 18885/500.
References
[1] A. Akhshani, S. Behnia, A. Akhavan, H. Abu Hassan, and Z.
Hassan, “A Novel Scheme for Image Encryption Based on 2D
Piecewise Chaotic Maps,” Optics Communications 283, pp.
3259–3266, 2010.
[2] A. Jolfaei and A. Mirghadri, “An Applied Imagery Encryption
Algorithm Based on Shuffling and Baker's Map,” Proceedings
of the 2010 International Conference on Artificial Intelligence
and Pattern Recognition (AIPR-10), Florida, USA, pp. 279–
285, 2010.
44 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 8, August 2010
[3] A. Jolfaei and A. Mirghadri, “A Novel Image Encryption
Scheme Using Pixel Shuffler and A5/1,” Proceedings of The Abdolrasoul Mirghadri received the
2010 International Conference on Artificial Intelligence and B.Sc., M.Sc. and PHD degrees in
Computational Intelligence (AICI10), Sanya, China, 2010. Mathematical Statistics, from the faculty of
[4] H.H. Ahmed, H.M. Kalash, and O.S. Farag Allah, Science, Shiraz University in 1986, 1989
“Encryption Quality Analysis of RC5 Block Cipher Algorithm and 2001, respectively. He is an assistant
for Digital Images,” Journal of Optical Engineering, vol. 45, professor at the faculty and research center
2006. of communication and information
[5] R.C. Luo, L.Y. Chung, and C.H. Lien, “A Novel Symmetric technology, IHU, Tehran, Iran since 1989.
Cryptography Based on the Hybrid Haar Wavelets Encoder His research interest includes: Cryptography, Statistics and
and Chaotic Masking Scheme,” IEEE Transactions on Stochastic Processes. He is a member of ISC, ISS and IMS.
Industrial Electronics, vol. 49, no. 4, 2002.
[6] X.Y. Yu, J. Zhang, H.E. Ren, S. Li, and X.D. Zhang, “A New
Measurement Method of Iimage Encryption,” Journal of
Physics: Conference Series, vol. 48, pp. 408–411, 2006.
[7] H.M. Elkamchouchi and M.A. Makar, “Measuring Encryption
Quality for Bitmap Images Encrypted With Rijndael and
KAMKAR Block Ciphers,” Proceedings of The Twenty
Second National Radio Science Conference (NRSC 2005),
Cairo, Egypt, pp. 111–118, 2005.
[8] F. Han, X. Yu and S. Han, “Improved Baker Map for Image
Encryption,” proceedings of the first International Symposium
on Systems and Control in Aerospace and Astronautics
(ISSCAA), pp. 1276–1279, 2006.
[9] A.J. Lichtenberg and M.A. Lieberman, Regular and Chaotic
Dynamics, New York: Springer, 1992.
[10] F. Pichler and J. Scharinger, “Ciphering by Bernoulli shifts in
finite Abelian groups,” in Contributions to General Algebra,
Proc. Linz-Conference, pp. 465–476, 1994.
[11] G. Peterson, “Arnold’s Cat Map,” Fall 1997, http:
online.redwoods.cc.ca.us/instruct/darnold/maw/catmap.htm
[12] W.H. Steeb, Y. Hardy, and R. Stoop, The Nonlinear
Workbook, 3rd edition, World Scientific Publishing Co. Pte.
Ltd, ISBN: 981-256-278-8, 2005.
[13] E. Ott, Chaos in Dynamical Systems, Cambridge University
Press, New York, 2002.
[14] J. Fridrich, “Symmetric Ciphers Based on Two-Dimensional
Chaotic Maps,” Int J Bifurcat Chaos, vol. 8, no. 6, pp. 1259–
1284, 1998.
[15] P. L'ecuyer and R. Simard, “TestU01: A C Library for
Empirical Testing of Random Number Generators,” ACM
Transactions on Mathematical Software, vol. 33, no. 4,
Article 22, 2007.

Authors Profile

Alireza Jolfaei received the Bachelor’s

degree in Biomedical Engineering in the
field of Bio-electric with the honor degree
from Islamic Azad University, Science and
Research branch, Tehran, Iran in 2007 and
Master’s degree in Telecommunication in
the field of Cryptography with the honor
degree from IHU, Tehran, Iran in 2010. He
was a chosen student in the first meeting of
honor students of Islamic Azad University, Science and Research
Branch in 2005. Currently, he is a teacher assistant at the faculty
and research center of communication and information technology,
IHU, Tehran, Iran. His research interest includes: Cryptography,
Information Systems Security, Network Security, Image Processing
and Electrophysiology.