An Optimized Image Encryption Technique For

ISBN: 978-15-08772460-24
Date: 8.3.2015
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON RECENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
signature. The resultant vector is normalized such that each

element of the vector denotes the standard deviation between
query feature and the reference feature. In USVM, feature
vector derived from the reference and random forgery
signature for each user is used for training.
Table 2: Performance Evaluation of WSVM and

Adaboost classifier
Pseudo-dynamic
features
Classifier
EER(%)
Rotation-invariant
LBP,
GLCM & R-HOG
WSVM
9.94%
Global Real
Adaboost
7.66%
IV. PERFORMANCE ANALYSIS

Performance of a Static/Offline signature verification
system is analyzed in terms of error rates. The common error
rates used are False Rejection Ratio (FRR), False Acceptance
Ratio (FAR), Average Error Rate (AER) and Equal error rate
(EER).
FRR and FAR are also known as Type I and Type II
error rates. The False Rejection Ratio (FRR) relates to the
genuine signatures that are rejected by the system whereas
False Acceptance Ratio (FAR) is related to the forgeries that
are classified as genuine signatures by the system.
Another error rate is Average Error Rate (AER)
which relates to the total error of the system that is the
occurrence of type 1 and type 2 error rates together. If the
system is set to have percentage of false acceptances and false
rejections to be approximately equal, then equal error rate
(EER) is calculated. The formulae to calculate the error rates
are:
1. FAR=Number of forgeries accepted x100
Number of forgeries tested
2.
FRR=Number of genuines rejected

Number of genuines tested
3.
AER=FAR + FRR
x100
In an automatic signature verification system if the

error rate obtained is lesser than the system provides better
recognition. While comparing the performance analysis of
methods discussed in [2] and [3], the lesser error rate was
provided by WSVM and Adaboost, thus providing more
accurateness than that of GSVM and USVM.
V. CONCLUSION
The working of three pseudo-dynamic feature
extraction techniques namely LBP, GLCM and HOG was
studied. The different classification approaches used for
classifying signature images were also studied.
After
analyzing the performance of these two systems using pseudodynamic features , it can be concluded that, WSVM and Real
Adaboost classifiers provides is the better recognition ratio
when tested using GPDS dataset.
VI. REFERENCES
The GSVM and USVM were tested in two phases. In

first phase, both classifiers are trained using 12 reference
signatures whereas in second phase training was done using 5
reference signatures. Analysis of these testing shows that more
performance is provided by USVM than that of GSVM since
it is modeled for each user. But when both classifiers and
features are combined, it provides better performance. The
performance analysis was done using GPDS dataset and the
result obtained is shown in the table 1.
Table 1: Performance Evaluation of combined
GSVM and USVM classifier
Pseudo-dynamic
features
EER(%)
(12 references)
EER(%)
(5 references)
HOG and LBP
15.41%
17.65%
[1]
[2]
[3]
[4]
[5]
Vitthal K. Bhosale, Dr. Anil R. Karwankar, Automatic Static Signature

Verification Systems: A Review International Journal of
Computational Engineering Research (ijceronline.com) Vol. 3 Issue. 2,
ISSN 2250-3005, February 2013
Yilmaz, M.B. and Yanikoglu, B. and Tirkaz, C. and Kholmatov, A,
Offline signature verification using classifier combination of HOG and
LBP features, IJCB 2011, pg. 1-7.
Juan Hu, Youbin Chen, Offline Signature Verification Using Real
Adaboost Classifier Combination of Pseudo-dynamic Features 12th
International Conference on Document Analysis and Recognition,2013
Juan Hu, Youbin Chen, Fusion of Features and Classifiers for Off-line
Handwritten Signature Verification, IEEE 2011
N. Dalal and B. Triggs. Histograms of oriented gradients for human
detection. CVPR'05, Volume 1, p.p. 886-893, Washington DC, 2005.
The WSVM and Real Adaboost method is tested

using GPDS dataset and the performance evaluation is shown
in table 2. In WSVM, training was done using 10 reference
signatures and testing was performed using genuine and
skilled forgery. Whereas in Real Adaboost method, training
set was selected with 10 reference and genuine signatures of
each user and dissimilarity vectors of 100 writers is computed
for training the Real Adaboost classifier.
IAETSD 2015: ALL RIGHTS RESERVED
www.iaetsd.in
15
ISBN: 978-15-08772460-24
Date: 8.3.2015
SENSOR DEPLOYMENT ALGORITHM FOR HOLE

DETECTION AND HEALING BY USING LOCAL HEALING
DR V VENKATESA KUMAR M.E., Ph.D
Assistant Professor
Department of Computer Science and Engineering
Anna University Regional Centre
Coimbatore
Mail2venkatesa@gmail.com
S ARIFKHAN
PG Scholar
Department of Computer Science and Engineering
Anna University, Regional Centre
Coimbatore
arifkhansarvar@gmail.com
ABSTRACT: Monitoring the desired Region of interest (RoI) is one amongst the most services provided by Wireless
Sensor Network. In Region of interest (RoI) the emergence of holes is inevitable because of random preparation and
environmental factors. Due to these factors the nodes in the network get affected and hence the holes are formed. In this
work various types of holes their characteristic and major cause for the hole formation are discussed. Distributed Hole
Detection (DHD) algorithm is proposed for the detection and identification of holes. HEAL algorithm is introduced for
the local healing area. It is a localized algorithm which identifies the boundary and treats the hole healing. Through
extensive simulation it can be shown that it is a cost effective and provides accurate solutions for the hole healing.
Indes terms : Hole Detection, Hole Healing, Coverage, HEAL Algorithm
I.
INTRODUCTION
A wireless sensor network is composed of small detector nodes each capable of sensing some
development, doing a little restricted processing and communicating with each other. These tiny sensor nodes are
deployed in the target field in large numbers and they collaborate to form an ADHOC network capable of reporting
the phenomenon to a data collection point called sink or base station. These networked sensors have several
potential applications i.e., they can be used for tracking of object, intrusion detection, surroundings and different
hazard and structural observation, traffic control, inventory management in manufacturing plant environment and
health related applications etc. Some of the challenges that needed to be overcome by WSN are connectivity,
coverage, Energy Consumption and limited battery life. In WSN, gathered information can be shared from one
mobile node to another. Sensing and Communicating are the two tasks that a node can perform simultaneously.
These tasks can be accomplished only if the node is able to communicate with neighbors for onward transmission of
the sensed data to sink. But these tasks cannot be implemented in real world scenarios
Several anomalies can occur in wireless sensor network that impact their functionality resulting in different
kinds of holes namely: Coverage holes, Routing holes, Jamming holes, Worm holes [1]. Coverage holes arise due to
random deployment, presence of obstructions and node failures. So, the target field which is said to be 100%
covered may have coverage holes. If nodes may not be able to communicate with other node correctly then routing
holes arises. Malicious nodes can jam the communication to arise jamming holes. Worm holes arises by denial of
service attacks in overwhelms regions.
Monitoring the specified region of interest is one of the main services provided by wireless sensor network
[2]. Also the main duty is to sense the environment and communicate the information. Region of interest must be
completely covered at all time. Due to their inner nature of wireless sensor network and external attacks the
emergence of holes is unavoidable. Therefore the holes occurred are neither detected nor reported so the task is not
completed.
www.iaetsd.in
16
ISBN: 978-15-08772460-24
Date: 8.3.2015
In this work such exceptional circumstance is discussed with special attention to the phenomenon that
occurs in region of interest. The holes related problems are grouped together in four categories namely: Coverage
holes, Routing holes, Jamming holes, Worm holes. Also, the process such as identification of hole, Discovery of
hole and border detection is discussed.
The work is organized as follows. The hole related problems and reasons for hole formations are discussed
in Section II and Section III. Section IV V VI VII elaborate about identification of hole, discovery of hole, border
detection and Hole Healing. Section VIII shows the evaluation analysis and .simulation results .Section IX
concludes the paper.
II.
PROBLEM DEFINITION:
Various types of holes that occur in wireless sensor networks and their characteristic are discussed.
A. COVERAGE HOLES:
Coverage holes will not exist if the target point is covered by atleast required degree of coverage. Coverage
holes are formed due to the following reasons:
1.
2.
3.
4.
5.
6.
Design of the sensor node fails

Unsystematically arrangement of sensor nodes in the area
Poor installment
Power depletion
Topology failure
Presence of obstacles
B. ROUTING HOLES:
If the nodes are not available (or) if the available nodes cannot participate in the routing data then routing
hole exists in the sensor network. Routing holes occur due to following reasons
1.
2.
3.
4.
Failure of sensor nodes

Battery depletion
Structural collapse physically destroying the nodes
Local minimum phenomenon faced in geographic greedy forwarding
C.JAMMING HOLES:
Jamming holes are caused due to high frequency signal. In wireless network when the high frequency
signal comes in, the network breaks the signal and connects with the new signal. The other reasons for the causes of
jamming holes are given as
1.
2.
Installing jammers in nearby areas

Presence of obstacles
D.WORM/SINK HOLES:
Worm holes are caused when the data is lost in between the traffic. Therefore both the sender and the
receiver couldnt know whether the data is received or sent. Worm Holes can be formed due to the following
reasons:
www.iaetsd.in
17
ISBN: 978-15-08772460-24
Date: 8.3.2015
1.
2.
3.
Denial of services
Low computational power
Limited memory
III. CAUSES FOR HOLE FORMATION:

There are many causes for hole formation. The main causes for the hole formation are the destruction of
nodes by environmental disaster or the node doesnt involve in working of network.
In sensor networks there is a node known as faulty node. A node is said to faulty if it does not produce the
same result as the other neighbor node produces. So a faulty node can be said as destroyed node which stops from
working and do not involve in network activities.
In this topic we highlight the main reasons for the sensor node destruction that causes holes in network.
Some of the major reasons for the destruction of nodes and the creation of holes are given in this section.
A. POWER DEPLETION:
Every node in the network is equipped with some amount of battery power which provides energy for the
nodes. The energy inside the node would carry out the task and perform communication with other nodes. Energy
is consumed when they perform operations in network. So the power gradually decreases and at one stage the
energy finishes and the node is dead. It is difficult to recharge when the energy is deployed in hostile region or
forest where human interaction is not possible [6].
PHYSICAL DESTRUCTION:
Physical destruction is another major cause for holes in the network. Wireless sensor networks are
deployed in hostile region. In those regions the nodes could also be destroyed by means of natural disasters like
earthquake, volcanic eruption and tsunami. Similarly the outburst of fire would destroy all the nodes that are
deployed in the forest region
C. PRESENCE OF OBSTACLES:
Wireless sensor networks are deployed in hostile regions .There are some areas where the nodes will find
difficult to operate. For example if we assume that nodes are deployed in dense forest then a pond of water or a
mountain or presence of animals in between the nodes would act as an obstacles and it causes an hole in the
network.
D. LOWER DENSITY REGIONS:
The holes are formed due to non-uniform deployment. In those regions the density of nodes becomes lower
than other regions. In such cases the nodes become static. So it forms lack of communication from one node to
another and it forms a hole.
E. TOPOLOGY FAILURE:
In wireless sensor networks topology plays an important role. On designing the network the topology
should be chosen properly else it leads to the coverage hole in the network. So the topology failures also lead to
hole in the network.
PROPOSED SOLUTION:
In this section the way to detect a hole within the node of the network is discussed. A mechanism called
Distributed hole detection (DHD) is proposed to identify the boundary nodes and discover holes.
www.iaetsd.in
18
ISBN: 978-15-08772460-24
Date: 8.3.2015
HOLE DETECTION:
To detect a hole Fang et al. [7] proposed a rule named TENT rule. This rule is used to check the node in the
network whether it is a stuck node. A stuck node is a node where packets can possibly get stuck in greedy multi
hop forwarding. For example we can assume that p and q are nodes .A node p is said to be stuck node if the
location of the q is outside ps transmission range so there is no 1-hop neighbors of p is closer to q. The TENT
rule states if the angle is not spanned by a pair of its angularity adjacent neighbors greater than 2/3 then it is not a
stuck node. To identify holes in the network we must precede three steps
Fig. 3: p is a strongly stuck node [11]
IV. IDENTIFICATION OF HOLE:

To identify stuck nodes we must assess the existence of a hole. By executing TENT rule [8] we can
check whether the node p is a stuck node by following these steps.
1. Let u and v be the pair of angularity adjacent nodes.
2. Divide the plan into 4 quadrants and draw a perpendicular bisector of up and vp, l1, l2.
3. l1 and l2 intersect at a point o (see fig.3)
Finally, if communication range of o is outside p, then the angle
is a stuck angle and p is a stuck
node.
V. DISCOVERY OF HOLE:
Every node that marked as stuck node would trigger the discovery of holes by TENT rule. By using this
process the hole boundary is found.
A stuck node with an ID (same ID for hole and node) creates a new discovery packet. The mission of
this node is to collect location information and forward to next boundary node
by Right hand rule. Node
inserts its location information and forwards to another node
. This Process is repeated until the packets travel
around the hole. Next node extracts and select 2 nodes
and . So the distance between them is the longest
between any two nodes and also the hole center is calculated.
There is no coordination between the stuck nodes which sends the HD packet. Without coordination there
will be redundancy in the discovery process that causes unnecessary traffic and collision. To avoid these collision
the prevent redundancy mechanism is introduced. This mechanism is used to remove HD packets as soon as
possible. If a HD packet arrives and finds that the packet has a hole-ID greater than hole-ID that has already
passed it will considered redundant and it will be deleted. Finally the node which has the smallest Hole-ID
removes the HD packet and it is known as Hole Manager (HM). Hole Manager is responsible for the hole healing
announcement.
www.iaetsd.in
19
ISBN: 978-15-08772460-24
Date: 8.3.2015
VI. BORDER DETECTION:

The nodes on the limit of region of interest (ROI) execute the TENT rule. As a result it detects stuck nodes
and starts the process even if the nodes are not stuck nodes (they are the borders of the network). To avoid the
hole discovery process launched on non-stuck nodes network boundary nodes are identified.
To find the network boundary the following steps are followed:
1. DHD is launched by stuck nodes to identify the nodes that surround the hole.
2. To identify the network boundary four Boolean variable
,
,
defined in the packets.
,
3. If the packets find that it has a higher or lower value it sets the corresponding Boolean variable to 1.
4. At the end, the largest hole which defines the network boundary will be defined by the
coordinates
,
,
and it cancels the healing process launched by Hole Manager.
,
TABLE 1: Comparison of proposed solution to hole and border detection problem
PROPOSED
SOLUTION
[9]
[10][11]
[12]
[13]
ALGORITHM
USED
DISTRIBUTED
SCHEME
ALGORITHM
CENTRAL
CONTROL
ALGORITHM
LINEAR TIME
ALGORITHM
COORODINATE
FREE METHOD
[14]
DISTRIBUTED
ALGORITHM
[7]
BOUND HOLE
ALGORITHM
HOLE
BOUNDARY
DETECTION
ALGORITHM
[15]
DRAWBACKS
For a large
WSN with a
few holes this
method is not
efficient
High
complexity
Requires a high
node density
Assumes a
uniform node
distribution and
also requires
high node
density
Repetitive
network
flooding
High message
complexity
Requires
synchronization
among nodes
VII. HOLE HEALING

After the hole has been detected then healing phase is executed. The discovered hole is healed by
introducing attractive forces at the hole center and attracts the node towards the center. Hole Healing algorithm
allows the local healing in which the node located at large distance also involved in healing process. Also the Hole
Manager (HM) determines the HHA and informs the nodes based on their movement. The healing process are
detailed in the following
www.iaetsd.in
20
ISBN: 978-15-08772460-24
Date: 8.3.2015
HHA DETERMINATION:
This process is used to determine the nodes that must be relocated to ensure the repair of hole. The holes
are identified and Hole Manager calculates the center and the size of the hole. Therefore to determine the Hole
Healing Area the radius of the circle must be determined. To find the radius
R=
( 1 + ),
Where R is the hole radius, is the constant which depends on the node destiny. The number of nodes
necessary for the area to be covered is given as
=
Hole Manager calculates the number of nodes in the Hole Healing Area (HHA). It sends the node for the
area to determine the packet containing information. The communication is done for reducing the number of
exchanged messages. If the nodes found by Hole Manager is less than the required number of hole the movement
will create the new holes. To avoid HM node starts a new round by increasing the values and repeats the process till
it finds a sufficient number for the holes to be recovered. Then HM node sends to the concerned nodes a movement
packet containing information to heal.
NODE RELOCATION:
The healing process is also used to heal the multiple holes which are discovered. Also a node in the
overlapping area can cause trouble. For this purpose two strategies are adopted.
DISTANCE BASED:
In this process the distance travelled by nodes is minimized in the healing process to preserve the nodes
energy. Also the node considers the first movement packet it receives.
HOLE BASED:
In this process the large holes are healed because it causes more trouble. A node receives a movement
packet and it waits for certain amount of time and then it compares the received movement packets and moves
towards the biggest hole.
VIII. PERFORMANCE EVALUVATION:
In this paper, the network simulator NS-2 is used as a tool for simulation process. HEAL is implemented in NS-2
with the latest version 2.33 on Linux platform of Fedora version 9. It is carried out in two stage simulation. The first
scenario points out the effectiveness of HEAL in terms of hole detection and healing. In second scenario the
proposed algorithm is compared with DSSA and SMART present in [10]. More detail simulation parameters are
shown in table 2. HEAL outperforms DSSA in terms of accuracy ratio especially when node degree is low, and has
less control packet overhead and simulation time when lots of holes are within the network. Note that, the HEAL is
a fully distributed algorithm
VALIDATION OF HEAL:
This scenario contains two sub-scenarios. In the first one, we vary the radius of the hole created within the
RoI. We use a deterministic deployment strategy with holes of different radii. The purpose of this sub-scenario is the
evaluation of HEAL in terms of hole detection and healing. In the second sub-scenario, we analyze the behavior of
HEAL in the presence of several holes in the network. We vary the number and the size of holes and we analyze the
www.iaetsd.in
21
ISBN: 978-15-08772460-24
Date: 8.3.2015
rate of detection and healing provided by HEAL. Tests will be conducted on deterministic and random scenes.
Parameters of the first scenario are described in Table 2
.
Fig.4. Total travel distance versus Hole Radius
Fig.5. Number of Movements

The metrics for comparing performance are list below:
Accuracy ratio: It is the value of total number of correct BNs selected by the proposed algorithms divided by the
value of total number of BNs should be selected.
Control packet overhead: It is concerned with the total number of packets exchanged.
Simulation time: It is concerned with the total execution time of finding all BNs.
TABLE 2: The simulation parameters in NS-2
SIMULATION
PARAMETERS
Number of nodes
Deployment
Size of Sensing Field
Simulation Time
Max Speed (m/s)
Routing Protocols
INITIAL VALUES
50
Uniform
500m 500m
5000
10
AODV
The number of nodes, size of sensing field, Simulation time, and their speed are deployed. The graph for
accurate ratio control packets and simulation time for different number of holes are shown below
COMPARING HEAL TO SMART AND DSSA :
www.iaetsd.in
22
ISBN: 978-15-08772460-24
Date: 8.3.2015
In this scenario, we vary the network density and we compare the performances of HEAL to those of DSSA
[10] and SMART [10]. On one hand, DSSA [10] is a centralized movement- assisted virtual forces-based algorithm,
this allow us to compare HEAL to a competitive approach based on the same concept, i.e., virtual forces. On the
other hand, SMART [10] is a grid-quorum based movement-assisted localized algorithm, this allow us to compare
HEAL to a competitive approach based on a different principle. The performances of the three algorithms are
evaluated in terms of traveled distance, number of movements and rate of improvement in network coverage. The
three algorithms will operate directly on the holes resulting from the initial random deployment. The presented
results are the average of 20 runs. We note that SMART and DSSA are movement assisted deployment protocols
that try to improve the network coverage by exploiting nodes mobility, which is not the case of our protocol. The
purpose of this comparison is to see the performance of HEAL when it is used to improve the network coverage of
the initial deployment.
Fig.6. Comparison in terms of total distance traveled by nodes.
Fig.7. Comparison in terms of coverage improvement.
Fig.8. Comparison in terms of number of movements.

IX. CONCLUSION:
www.iaetsd.in
23
ISBN: 978-15-08772460-24
Date: 8.3.2015
Wireless Sensor Networks application can be found in every part of life. One of the existing problems
occurring in such environment is the formation of network holes. Distributed Hole Detection Algorithm has
proposed to find the boundary nodes enclosing the holes by utilizing connectivity information and not any local
information. By exploiting the virtual forces concept, our approach relocates only the adequate nodes within the
shortest time and at the lowest cost. Through the performance evaluation, we validated HEAL, using different
criteria and showed that it detects and heals the holes despite their number or size with less mobility in various
situations. The evaluation results demonstrate that HEAL provides a cost-effective and an accurate solution for hole
detection and healing in mobile WSNs.
REFERENCES:
[1] N. Ahmed, S.S. Kanhere, and S. Jha, The Holes Problem in Wireless Sensor Networks: A Survey,
SIGMOBILE Mobile Computing Comm. Rev., vol. 9, n. 2, pp. 4-18, 2005.
[2] B. Wang, Coverage Control in Sensor Networks. Springer, 2010.
[3] D. Nicules and B. Nath, Ad-hoc positioning system (APS) using AoA, In Proceedings of the IEEE
INFOCOM, 2003.
[4] Chris Karlof and David Wagner, Secure routing in wireless sensor networks: Attacks and
countermeasures, In 1st IEEE International Workshop SNPA'03, May 2003
[5] Anthony D. Wood and John A. Stankovic, Denial of service in sensor networks, IEEE Computer, Oct 2002.
[6] J. Staddon, D. Balfanz, G. Durfe. Efficient tracing of failed nodes in sensor networks, in
proc. of 1st ACM
international workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, Georgia, September 2002.
[7] Q. Fang, J. Gao, and L.J. Guibas, Locating and Bypassing Holes in Sensor Networks,
and Applications, vol. 11, no. 2, pp. 187-200, 2006
Mobile Networks
[8] Abdelhamid Mellouk Khalid Assnoune, Mustapha Reda Senouci, Localized MovementDeployment Algorithm for Hole Detection and Healing, VOL. 25, NO. 5, MAY 2014
Assisted
Sensor
[9] B. Kun, T. Kun, G. Naijie, L.D. Wan, and L. Xiaohu, Topological Hole Detection in Sensor Networks with
Cooperative Neighbors,Proc. Intl Conf. Systems and Networks Comm. (ICSN 06), p. 31, 2006.
[10] R. Ghrist and A. Muhammad, Coverage and Hole-Detection in Sensor Networks via Homology, Proc. Fourth
Intl Symp. Information Processing in Sensor Networks (IPSN 05), pp. 254-260, Apr. 2005
[11] V. De Silva, R. Ghrist, and A. Muhammad, Blind Swarms for Coverage in 2-D, Proc. Robotics: Science and
Systems, pp. 335-342, June 2005.
[12] F. Stefan and K. Christian, Hole Detection or: How Much Geometry Hides In Connectivity Proc. 22nd Ann.
Symp. Computational Geometry (SCG 06), pp. 377-385, 2006.
www.iaetsd.in
24
ISBN: 978-15-08772460-24
Date: 8.3.2015
An Optimized Image Encryption Technique for

Multikey conservative chaotic system
1
P.T.Bhuvana, 2L.Thirumal, 3T.Marthandan,

PG scholar VaruvanVadivelan College of Engineering &Technology, Dharmapuri,
2
Assistant Professor VaruvanVadivelan College of Engineering, Dharmapuri,
3
Assistant Professor Bharathiyar College of Engineering, Karaikal,
bhuvanaraj91@gmail.com thirumal09@gmail.com vasanthamarthandan@gmail.com
1
Cryptography is also used in complicated protocols that

help to achieve different security services, thus called as
security protocols. Hence a cryptographically-based
mechanism becomes the building blocks of computer
security. One of the mechanisms is encryption technique.
Many different encryption algorithms have been projected
in recent years as possible solutions for the protection of
digital images. But some of these methods became week
against certain type of attacks and criteria. At hand, there
are many image encryption techniques such as Tangram
algorithm [1], Arnold map [2], Bakers transformation [3],
affine transformation [4]. In some of this technique, the
secret key and the algorithm cannot be efficiently
separated. Hence, this does not satisfy the necessity of
modern cryptographic mechanism and prone to various
attacks. In present years, the image encryption based on
the chaotic dynamics system has been proliferated to
overcome above disadvantages. Zhu et al [5] proposed a
digital encryption technique using chaotic system based
on third order level, the elevated level of security is the
Keywords Encryption, Lorentz, Rossler attractor, quality of higher order chaotic system. But they confused
the encrypted image with the original image by shuffling
Multi-key, Confusion, Diffusion.
the pixel position and changing the RGB levels of every
I. INTRODUCTION
pixel content. Kwok and Tang introduce a speedy chaotic
Today, the internet is a decentralized network of based image encryption system with the structure of
networks. Anyone can connect to the internet and can stream-cipher [6]. On the other hand, the inadequate key
share any type of information in the form of data, image, spaces are the foremost limitation of this technique with
videos, etc, even if it is potentially detrimental to the chaotic system.
unsuspecting recipient. This places a large burden on each In Marco Gortz had shown some conventional steam
and every organization that has internet connectivity to be ciphers which could exhibit chaotic behaviors [7]. But due
responsible to ensure security. Thus Cryptography is the to the conventional cryptology, chaotic cryptography was
strongest tool for implementing security services. made a better candidate than many traditional ciphers for
multimedia data encryption [8]. The dissipative chaotic
Abstract
In recent years of wireless access

communication, the internet and other
computer
communication technologies are radically changing the
ways of communication and information exchanging
source. However, along with speed, efficiency and costsaving benefits of the digital revolution, there exists a new
challenge for the security and privacy of communication
of information. Hence cryptographic algorithms are
efficient tool for encryption. In this paper a new color
image encryption algorithm is proposed by combining
Lorentz and Rossler attractor with multi-key concept for
conservative chaotic system. Also, the pixel values of the
plain image are modified randomly using confusion and
diffusion process to strengthen the image security. The
resultant encrypted image is compared with various
results obtained using single and multi key algorithms.
The proposed algorithms is also analyzed under different
critical attacks and the results show that the proposed
system has a better efficiency, image confidentiality, high
encryption and decryption speed.
www.iaetsd.in
25
ISBN: 978-15-08772460-24
Date: 8.3.2015
systems are most widely used for chaotic encryption.
the encryption based on the dissipative chaotic system [9]
and conventional encryption technique has a security
problem. A fractal structure which can help to predict the
dynamic behavior of the chaotic carrier wave, thereby we
can get a useful signal which concealed [10, 11].AS far as
we attentive, there are two ideas in the literature review
using the Lorentzs attractor on the basis of cryptography
method. The primary one was proposed, but it is very
effortless and breakable [12, 13]. In second one, Lorentzs
attractor is used to efficiently generate pseudo random
numbers on the basis of logistic map based ciphers [14,
15]. Thus the techniques used in this proposed system
have its characteristics like sensitivity, integrity and high
security. The rest of this paper is organized as follows:
Section 2 the analysis of the domain is made. Section 3
deals with the system features. Section 4 gives the
working principles of the system and finally in section 5
the experimental results are given.
II. O VE RVIE W OF CHA OS CRYPT O GRAP H Y
Over the past decade, there has been a tremendous interest

are shown in studying the behavior and characteristics of
chaotic system. Chaotic systems are characterized by
sensitive dependence on initial conditions and similarity
to random behavior.
Chaotic System
Cryptographic
Algorithms
Phase space: Set of real

numbers
Phase space: Finite set of

integers numbers
Iteration
Rounds
Parameters
Key
Sensitivity to a change in
initial conditions
Confusion and Diffusion
Weak security and

Performance
High security and

Performance
Table 1: Similarities and Difference between Chaotic Systems and

Cryptographic syste m
Chaos has a very potential application on numerous

practical blocks of a digital communication system such
as compression, encryption and modulation. There are
some similarities and differences between chaotic system
and cryptographic algorithms which are shown in table 1.
Thus the two major principles which make the
cryptographic system strong is the confusion and
diffusion process. Diffusion emphasis spreading out of
single plaintext digits over ciphers text digits. So the
original statistical structure is hided. In confusion process
transformation is used to complicate the statistical
structure of plain text. Hence chaos system uses
cryptography to enhance the security.
III. PROPO SED E NCR YPTION SCHE ME BASED ON L ORE NTZ,
CHE N AND ROSSL ER ATTRA CTO R
The proposed image encryption technique based on

Lorentz, Chen and Rossler chaotic attractors.
But
A. Lorentz Chaotic System
Lorentz chaotic system is a classical high dimensional
chaotic system. This system is taken since its chaotic state
is indubitable. The encrypted sequence produced by this
system has three main advantages. First the structure of
the system is more complex, hence it is difficult to
forecast the chaotic sequences. Secondly, the real value
terms of three system variables can be used separately or
can be put together [16, 17]. Thirdly all the three initial
conditions and control parameters can make secret key
thereby allowing the secret key space of the algorithm
greater than the low dimensional chaotic system. The
dynamic equations of Lorentz system is given by
dx/dt = (y-x)
dy/dt= rx-zx-y
dz/dt = xy bz
(1)
B. Rossler System
Otto Rossler came up with a series of prototype system of
ordinary differential equation in three dimensional spaces
[18]. The Rossler equation is given in equation (2). This
system is minimal for continuous chaos system.
dx/dt = - y - z
dy/dt= x + ay
dz/dt = bx cz + xz
(2)
C. Chen System
Chen found alternate traditional chaotic attractor in a easy
three-dimensional independent system. Chen's systems not
fit in to this general Lorenz system.
dx / dt= a(y x)
dy / dt = (c a)x xz + cy
dz / dt = xy bz
(3)
D. Pre-Processing Method
The pretreatment or pre-processing is done by getting the
rid of the integral part as real values, so that the value
domain of x, y, z became as the real unified sequence
value. By this way, the decimal point is moved backward
for strengthening the system parameter and initial value.
(4)
E. Encryption and Decryption Module
First the secrete key for the image frame is generated
chaotically. Fig. 1, the initial condition and the control
parameter also serve to generate secrete key for the
chaotic sequence. Since the chaotic sequence is
unpredictable in the long run, the sequence obtained can
be very well utilized to create unique key for the input
image frame, thereby raising the level of security.
The value generated is added to anyone of the
parameters of Lorentz, Rossler, or swig on variables and
on parameter values. Finally confusion and diffusion
process is done to increase the level of security. Chen
chaotic system. This procedure did have a large Thus an
encrypted image is obtained. Similarly the decryption fig.
www.iaetsd.in
26
ISBN: 978-15-08772460-24
Date: 8.3.2015
2 process is also done by reversing the process of multikey process. Single key encryption process
also encryption. Thus the original image is encrypted and
produces complex cipher image but it is easily
breakable. decrypted in a high secure fashion.
Similarlily multikey image encryption proves to be secure
The multiple stages of combined confusion and diffusion for real time communications. The two stages of
process produces a complex cipher image which is confusion and diffusion process are more attractable
unpredictable and unbreakable. The confusion process can features of the proposed work. Many chaotic systems are
be done either by pixel by pixel approach or block by available and each having its own desirable features. In
the proposed work Lorentz, Rossler and Chen chaotic
block approach.
attractor are used for encryption and decryption phases. A
16 byte external key is used.
Fig 1: Encryption Process
Fig 3 Original Images and its RGB Hist ogram
Fig 4 Encrypt ed Color i mage and its histogram using single key chaotic
syst em
Fig 2: Decryption Process
The encryption and decryption process are carried out

with single key and multi key chaotic system. In order to
produce complex cipher image it is necessary to encrypt
with multikey concept. The resultant image is unbreakable
to any attacks.
IV. SIM UL ATION RE SULT S A ND DISCUSSION
In this paper, an empirical color image of size (256x256)

is taken and shown that the proposed method has the
efficient encryption performance and results in high
security. Fig. 3 shows the original image and its RBG
level histograms. The chaotic encryption system is well
suited for grayscale and colour images. The encryption
process can be done in two ways, using single key and
Fig 5 Encrypted Color image and its histogram using Multi-Key Chaotic
systems
Now compare the characteristics of fig. 3 with fig. 4 and

fig. 5, we can observe that the encrypted color image
observed to be meaningful when compared to original
image. The decryption steps are the opposite of the
encryption process, therefore the decrypted image is
observed with a clear and absolute without any distortion
www.iaetsd.in
2303
27
ISBN: 978-15-08772460-24
Date: 8.3.2015
or loss. Fig. 6 shows the decrypted color image along with individually and concatenated to produce the
original is RBG histogram images.
decrypted image. The proposed work proves to be more
secure for real time applications. The confusion process
In encryption phase, the colour image is split into red, blu can also be done by block by block approach in order to
and green frames. Each frames are separately encrypted reduce the encryption time.
with two phases, confusion and diffusion. Finally the
encrypted red, blue and green frames are decrypted
Fig 6 Decrypt ed Color i mage and its RGB frame

V. SECU RIT Y ANA LYSIS
A good encryption system needs to own outstanding

sensitivity and sufficiently large key space in order to
resist intruders to decrypt the original information even
after large amount of time and resources. The chaotic
system obtained by using Lorentz, Chen and Rossler
attractor is highly sensitive to the initial values and for the
parameters. It also increases the security against bruteforce attack. An optimized image encryption should be
sensitive for both the secret generated key. The transform
of a single bit in the key should produce a completely
different encryption image. Efficient key sensitivity is
needed for secure image cryptosystem, which means that
the encrypted image cannot be decrypted correctly even
there is a small difference between the encryption and
decryption keys.
VI. CONCLUSION
In this paper, a new approach for image encryption using

Lorentz, Chen and Rossler attractor is proposed and its
security and performance are examined in detail. The
experimental outcome shows that the proposed algorithm
yields high security better efficiency, image
confidentiality, high encryption and decryption speed. The
concept of multi-key is also proposed where the frame is
encrypted by a unique key in place of changing the key
for the particular frame. The key management is also
inbuilt in the way the key generate. In addition it is found
that the Key Space and Key Sensitivity are very high.
This adopted demonstrate a very good potential in the real
time application of digital color image encryption.
REFERE N CE S
[1]
[2]
[3]
[4]
Wei Ding, Wei-qi Yan, and Don g-xu Qi, A Novel Digital Hiding
Technol ogy Based on Tangram and Conways Game, Proceeding
of 2000 Internati onal Conference on Image Processing, Vol 1, pp.
601-604, Sept. 2000.
Li Chang-Gang, Han Zheng-Zhi, and Zhang Hao-Ran, Imag e
Encryption Techniques: A Survey, Journal of Co mputer
Research And Develop ment, Vol 39, No. 10, pp. 1317-1324, Oct.
2002.
Zhao Xue-feng, Digit al Image Scrambling Based on the Bakers
Transformation, Journal of Nort hwest Normal University
(Natural Science), Vol 39, No. 2, pp. 26-29, Feb. 2003.
Zhu Guibin, Cao Changxiu, H u Zhongyu, et al., An Image
Scrambling and Encryption Algorith m Based on Affine
Transformation, Journal of Co mput er-Aid ed Design & Computer

Graphics, Vol15, No. 6, pp. 711 -715, June. 2003.
[5]
C. X. Zhu, Z. G. Chen, W. W. Ouyang, A new i mage encryption
algorit hm based on general Chens chaoti c syste m, Journal of
Central South University (Sci ence and Technol ogy) 37 (2006)
1142.
[6]
H.S.K wok, W. K. S. Tang, "A fast encryption system based on
chaotic maps," Chaos Solitons Fractals 32 (2007) 1518.
[7]
G. Marco, K. Kristina, and S. Wolfgang. Discrete-ti me chaoti c
encryption syst ems-part I: Statistical design approach.
IE EE.Trans.Circuits and Systems-I, 44(10):963970, 1997.
[8]
H.Y. Ma, F. Gao and X.H. Li, Computer Engineering, 34(8),
April 2008, pp.190-192.
[9]
H.Dedieu, M.J. Ogorzal ek, Identifiability and identification of
chaotic syste ms based on adaptive synchroni zation, IEEETrnas
Circuits & Syst I, 44(10), 1997, pp.948-962.
[10] R. He, P. G. Vaidya, Impl ement ation of chaotic cryptograph y
with chaotic synchronization,Phys. Rev. E 57, 1532 (1998).
[11] A. Ali-Pacha, N. Hadj-Said, A. MHamed, A. Belgoraf, Lorentzs
attractor appliedto the stream cipher (ali-pacha generator), Chaos
Soliton Fractals 33, 1762(2007).
[12] C. Fu, Z. Zhang and Y. Cao, An Improved Image Encryptio n
Algorithm Based on Chaotic Maps, Third Int ernational
Conference on Natural Co mputation, Vol. 3, Washington, 2007,
pp. 24-27.
[13] Hazem Mohammad Al-Najj ar, "Digital Image Encryption
Algorithm Based on Multi-Di mensional Chaoti c System and
Pixels Location", International Journal of Co mputer Theory and
Engineering, Vol. 4, No. 3, June 2012.
[14] Hazem Mohammad Al-Najj ar, Asem Moham mad Al-Najj ar,
"Multi- Chaotic Image Encryption Algorith m Based on one Ti me
Pads Scheme" , International Journal of Co mput er Theory and
Engineering, Vol.4, No. 3, June 2012
[15] Y. Cao and C. Fu." An image encryption scheme based on high
dimensi on chaos syste m," Int. Cof.Intelligent comput ation
technology and auto mation, 2008, pp. 104-108
[16] Fengjian Wang, Yon gping Zhang and Tianjie Cao Research of
chaotic block cipher algorithm based on Logistic map, 2009
Second International Conferen ce on Intelligent Comput ation
Technology and Automation, 20 09: 678 681.
[17] Wang Y, Wong K W, Liao XF, et al, A Chaos-based Image
Encryption Algorithm wit h Variable Control Parameters, Chaos
Solitons & Fract als, vol. 41, no. 4, pp.1773-1783, 2009.
[18] Kezia. H, Sudha.G.F. Encryption of Digital Video Based on
Lorenz Chaotic System, 1 6th International Conference on
Advanced Co mputing and Co mmunications . ADCOM.2 008.
Page(s): 40 - 45 IEEE Conference Publi cations, 2008
www.iaetsd.in
28

An Optimized Image Encryption Technique For

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

An Optimized Image Encryption Technique For

Uploaded by

Copyright:

Available Formats

ISBN: 978-15-08772460-24

signature. The resultant vector is normalized such that each

Table 2: Performance Evaluation of WSVM and

IV. PERFORMANCE ANALYSIS

FRR=Number of genuines rejected

In an automatic signature verification system if the

The GSVM and USVM were tested in two phases. In

HOG and LBP

Vitthal K. Bhosale, Dr. Anil R. Karwankar, Automatic Static Signature

The WSVM and Real Adaboost method is tested

IAETSD 2015: ALL RIGHTS RESERVED

SENSOR DEPLOYMENT ALGORITHM FOR HOLE

IAETSD 2015: ALL RIGHTS RESERVED

Design of the sensor node fails

Failure of sensor nodes

Installing jammers in nearby areas

IAETSD 2015: ALL RIGHTS RESERVED

III. CAUSES FOR HOLE FORMATION:

IAETSD 2015: ALL RIGHTS RESERVED

Fig. 3: p is a strongly stuck node [11]

IV. IDENTIFICATION OF HOLE:

IAETSD 2015: ALL RIGHTS RESERVED

VI. BORDER DETECTION:

VII. HOLE HEALING

IAETSD 2015: ALL RIGHTS RESERVED

IAETSD 2015: ALL RIGHTS RESERVED

Fig.5. Number of Movements

IAETSD 2015: ALL RIGHTS RESERVED

Fig.6. Comparison in terms of total distance traveled by nodes.

Fig.7. Comparison in terms of coverage improvement.

Fig.8. Comparison in terms of number of movements.

IAETSD 2015: ALL RIGHTS RESERVED

IAETSD 2015: ALL RIGHTS RESERVED