Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
Vol
.
4
,
No
. 3,
J
une
2
0
1
4
,
pp
. 45
6~
46
2
I
S
SN
: 208
8-8
7
0
8
4
56
Jo
urn
a
l
h
o
me
pa
ge
: h
ttp
://iaesjo
u
r
na
l.com/
o
n
lin
e/ind
e
x.ph
p
/
IJECE
A New Cryptographic Stra
te
gy
for Dig
i
ta
l Ima
g
e
s
N
i
dhi
Set
h
i
*
, Sa
ndip V
i
j
ay**
* Departement o
f
Computer Scien
ce
Engine
ering
,
DIT Univ
ers
i
t
y
** Depart
em
ent
of El
ectron
i
cs
ad
Com
m
uni
cation
Engineering, DI
T University
Article Info
A
B
STRAC
T
Article histo
r
y:
Received
Ma
r 1, 2014
Rev
i
sed
Ap
r
22
, 20
14
Accepted
May 15, 2014
In this p
a
per
,
a
new image block ciph
er
encr
ypt
i
on s
t
ra
teg
y
fo
r
gra
y
s
c
a
l
e
im
ages using a
differen
t
set
of s
ecret
key
and si
zes is proposed
.
Initiall
y
,
th
e
swapping and d
i
spersion is done
without
k
e
y
s
an
d in second stag
e th
e imag
e
is mixed with the chirikov map involving firs
t secret k
e
y
.
'
N
' rounds are
taken to com
p
le
te this process. The bl
end
e
d image is divided in
to blocks of
block size 8X8.These blo
c
ks ar
e also
swapped
to ach
iev
e
good
confusion.
For making the encr
y
p
tion s
c
heme more sturd
y
in each
block th
e
transmutation of
pixels is done with
the modified logistic map having three
m
o
re secret
keys. The p
r
oposed
schem
e
is sim
p
le, r
a
pid
and sen
s
itive
to th
e
secret ke
y.
Due
to the high ord
e
r of
substitutio
n, com
m
on atta
cks such as
line
a
r and d
i
ff
erent
i
al
cr
ypt
a
n
a
l
y
s
i
s
are
unat
t
a
inab
le.
The
e
xperim
e
nta
l
results show that the proposed en
cr
y
p
ti
on techniq
u
e is effective
and has high
s
ecurit
y
fe
atures
.
Keyword:
Sy
mm
e
t
r
i
c en
cr
yp
tion
m
odi
fi
ed l
o
gi
st
i
c
m
a
p
ch
irikov
m
a
p
d
i
fferen
tial cryp
tan
a
lysis
im
age encry
p
tion
Copyright ©
201
4 Institut
e
o
f
Ad
vanced
Engin
eer
ing and S
c
i
e
nce.
All rights re
se
rve
d
.
Co
rresp
ond
i
ng
Autho
r
:
Nidh
i Seth
i,
Depa
rt
m
e
nt
of
C
o
m
put
er Sci
e
nce a
n
d
E
ngi
neeri
n
g
,
DIT Un
iv
ersity,
M
a
kka
wal
a
, D
e
hra
d
un
-2
4
8
0
0
1
, I
ndi
a.
Em
a
il: n
i
d
h
i
p
a
n
k
a
j
.
seth
i102@g
m
ail.co
m
1.
INTRODUCTION
T
Recently, with the hi
gh
de
mand in
digita
l signal
tra
n
smission a
n
d bi
g
losses
due t
o
illegal data
access,
data se
curity has bec
o
m
e
a critical
and im
perative
issue. Encrypt
i
on is bei
n
g used to sec
u
re
da
ta a
nd
pre
v
e
n
t them
f
r
om
unaut
hori
zed access.
Due to certain ch
aracteristics of digital im
ag
es- re
dundancy
of data,
strong c
o
rrelation am
ong a
d
jacent
pixel, l
e
ss sensitive a
s
com
p
are to the text data,
especially the bul
k
q
u
a
n
tity o
f
d
a
t
a
and
th
e
req
u
i
rem
e
n
t
o
f
real
-ti
m
e p
r
o
ce
ssi
ng
, trad
ition
a
l cip
h
e
rs su
ch
as
DES, AES, R
S
A etc.
are no
t su
itab
l
e for im
ag
e en
cryp
tion
.
In
o
r
d
e
r t
o
pro
t
ect dig
ital i
m
ag
es fro
m
u
n
a
u
t
h
o
rized
users
do
ing
illeg
a
l
rep
r
o
d
u
ct
i
o
n
a
n
d
m
odi
fi
cat
i
ons,
a
vari
et
y
o
f
im
age enc
r
y
p
t
i
on
schem
e
s ha
ve
been
p
r
op
os
ed.
The va
rious ideas use
d
in the
exis
t
i
ng i
m
age encry
p
t
i
on t
e
c
hni
que
s can
be
classified into
three m
a
jor
t
y
pes:
pi
xel
sh
uf
fl
i
ng
[5
, 1
0
,
18
, 1
9
]
,
pi
xel
t
r
ansm
ut
at
i
on [
1
,
2, 7
,
1
7
]
an
d
t
h
e com
b
i
n
at
i
on
fo
rm
[6, 8,
12
, 1
3
,
1
5
]
. Th
e shu
f
fl
in
g
algo
rith
m
s
in
terch
a
ng
e the p
o
s
ition
o
f
pix
e
ls with
in
the i
m
ag
e i
t
self
an
d
u
s
ually h
a
v
e
lo
w
secu
rity.
Wh
il
e th
e tran
sm
u
t
atio
n
p
r
o
cess tran
sfo
r
m
s
th
e ori
g
inal values
of
im
ag
e in
to tran
sm
u
t
ed
valu
es.
Thi
s
p
r
oces
s h
a
s l
o
w ha
rd
wa
r
e
expe
nse an
d
est
i
m
a
ti
ng co
m
p
l
i
catio
n
s
. In
th
e h
ybrid
form
th
e co
m
b
in
atio
n
of
bot
h transm
utation and shuffling is
used and has
good potential for s
ecurity. In the last decade
m
a
ny
encry
p
t
i
o
n
sc
h
e
m
e
s have
be
en
pr
o
pose
d
t
o
i
m
pro
v
e
ov
er sec
u
ri
t
y
c
o
nst
r
ai
nt
s
i
n
ca
se o
f
i
m
ages. I
n
t
h
e
following
para
gra
p
h s
o
m
e
recent im
age encr
yption
schem
e
s are
disc
usse
d in c
r
isp.
C
h
e
n
g
q
i
n
g Li
et
al
. [3]
,
hav
e
revi
ewe
d
f
o
u
r
cha
o
s ba
sed i
m
age encry
p
t
i
on sc
hem
e
s. He concl
ude
d
t
h
at
al
l
l
i
e
und
er o
n
e
um
brel
l
a
and i
s
c
o
m
pose
d
o
f
t
w
o b
a
si
c t
echni
q
u
e
s
:
perm
ut
at
i
o
n
and c
o
m
b
i
n
at
i
on
of
pixel value. But in gene
ral all
m
e
thods
have security
problem
s
like ins
e
nsitivity to
change of plain-i
m
age
,
in
sen
s
itiv
ity to
ch
ang
e
o
f
secret k
e
y, in
secure d
i
ffu
s
i
o
n
fun
c
tio
n
an
d
the sch
e
m
e
s can
b
e
b
r
o
k
e
n
wit
h
no
m
o
re than [log
l
(M
N)+
3
]
ch
os
en im
ages whe
n
i
t
e
rat
i
on n
u
m
ber i
s
equal
t
o
one
, w
h
ere
M
N
i
s
dim
e
nsi
on
of
im
age. C
h
o
ng
Fu et
.al
[
4
]
ha
ve use
d
, C
h
i
r
i
k
o
v
st
an
da
rd
m
a
p, t
o
dec
o
r
rel
a
t
e
t
h
e st
ro
n
g
rel
a
t
i
o
n
s
hi
p am
ong
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
4, No
. 3,
J
u
ne 2
0
1
4
:
45
6 – 4
6
2
4
57
adjace
nt
pi
xel
s
he
nce em
pl
oy
ed t
o
sh
uf
fl
e t
h
e
pi
xel
p
o
si
t
i
ons
o
f
t
h
e
pl
ai
n i
m
age. Aft
e
r
t
h
e dec
o
r rel
a
t
i
ng t
h
e
pi
xel
s
, t
h
e pi
x
e
l
val
u
es a
r
e m
odi
fi
ed se
qu
en
t
i
a
l
l
y
t
o
con
f
us
e t
h
e rel
a
t
i
o
ns
hi
p
bet
w
ee
n ci
phe
r i
m
age and pl
ai
n
im
age.
J.M. Black
edge et al.
[11
]
h
a
v
e
p
r
op
osed a
m
u
l
tilev
e
l b
l
o
c
k
s
scram
b
lin
g
sch
e
m
e
wh
ich
is em
p
l
o
y
ed
t
o
scram
b
l
e
t
h
e bl
oc
ks
of
c
o
ef
fi
ci
ent
s
w
h
i
c
h re
qui
res
h
i
gh c
o
m
put
at
i
o
n
.
T
h
e c
ont
r
o
l
pa
ram
e
t
e
rs of t
h
e
scram
b
l
i
ng are
ran
dom
l
y
generat
e
d fr
om
the secret
key
depe
n
d
ent
.
Th
e key
st
ream
use
d
t
o
enc
r
y
p
t
t
h
e
scram
b
led im
a
g
e is e
x
tracte
d
from
the chaoti
c m
a
p and
plai
n im
age.
W
Puec
h et
al
. [1
4]
have st
udi
e
d
t
h
e va
ri
ous c
o
m
b
i
n
at
i
on
of c
h
aot
i
c
m
a
ps based sy
m
m
e
t
r
i
c
key
cryp
to
system
s lik
e Log
i
stic,
Henon
, Ten
t
,
Cu
b
i
c an
d Ch
eyshev. He
explained and
rev
i
ewed
th
e secu
rity,
p
e
rform
a
n
ce an
d reliab
ility issu
es, of m
a
p
p
i
n
g
s
].
2.
R
E
SEARC
H M
ETHOD
The
p
r
o
p
o
sed
wo
rk
c
o
m
p
ri
ses o
f
i
m
age en
cry
p
t
i
o
n al
g
o
r
i
t
h
m
whi
c
h i
s
br
oa
dl
y
di
vi
de
d i
n
t
o
t
w
o
pha
ses. The fi
r
s
t
phase o
f
t
h
e al
gori
t
h
m
consi
s
t
s
of swa
ppi
ng a
nd di
s
p
er
s
i
on. T
h
eses t
w
o pr
ocesse
s do
not
involve any ke
y. These proc
e
sses are only integrated
t
o
i
n
crease t
h
e co
n
f
usi
o
n
,
di
f
f
u
s
i
on a
nd
no
n l
i
n
eari
t
y
,
but they them
selves do
not
provi
de an
y sec
u
rity because
of the abse
nce
of
the key. T
h
e s
econd
pha
se consists
of t
h
e s
h
u
ffl
i
n
g by
C
h
i
r
i
k
o
v
St
anda
r
d
m
a
p
and m
i
xi
ng by
m
odi
fi
ed l
o
gi
st
i
c
m
a
p. The cont
rol
pa
ram
e
t
e
rs of
C
h
i
r
i
k
ov m
a
p and m
odi
fi
e
d
l
ogi
st
i
c
m
a
p are t
h
e co
nt
r
o
l
p
a
ram
e
t
e
rs of di
ff
usi
o
n a
nd c
o
nf
usi
o
n
respec
t
i
v
el
y
.
These c
o
ntrol
param
e
ters and num
b
er of
iterations is t
r
eated as
secret
key
s
.
The c
hoice
of
chirikov m
a
p i
s
m
a
de
because after ‘n’ itera
tions the
pi
xel
at the corne
r
most position
or
o
r
i
g
i
n
rem
a
in
unc
ha
nge
d
w
h
ereas
i
n
ot
he
r
m
a
ps t
h
e ori
g
i
n
a
nd
som
e
ot
her
pi
xel
l
i
k
e
(
N
,
N)
o
r
(
N
-
1
,
N-
1
)
also rem
a
ins sa
m
e
. The m
odified logistic map is chos
e
n
because i
n
s
p
ite of its sim
p
le
equation it provi
des
com
p
lex dyna
mic chaos.
2.
1 S
t
eps
o
f
P
r
op
osed
Al
gor
i
t
hm
(I)
Selection of ke
ys :
S.No
Key Desc
ription
Key Value
1
Key
1
-
Chir
ikov
m
a
p iter
a
tion
15
2
Key
2
-
C
hir
i
kov
m
a
p contr
o
l par
a
m
e
ter
(
d
i
m
ensionless)
512
3 Key
3
67
4 Key
4
0.
3628
5 Key
5
3.
9898
(II)
Fi
rst
Ph
ase (
W
i
t
hout
ke
y)
Step
1:
C
o
n
s
i
d
er an
im
ag
e I
(W
x
H) su
ch th
at
W an
d H are th
e wi
d
t
h and
h
e
igh
t
o
f
I. Sp
lit th
e im
ag
e I to a
set
of
N
vect
or
s o
f
l
e
ngt
h L
(
L
=6
4 i
n
t
h
i
s
w
o
r
k
)
[
9
]
.
Step 2:
Calc
ulate the value
of O1 a
n
d O2
O
1
I
i,
j
256L
O
1
I
i,
j
256L
Step 3:
Set x
= O
1
and
y =
O
2
For i =
0…
..N-1, s
e
t the
foll
owin
g inform
ation for each vec
t
or
V
i
f
r
om
t
h
e
set
of
N
vect
or
s .
Swa
ppi
ng
I
n
de
x= x, Swa
p
pi
n
g
It
erat
i
o
n
=V
(
x
)
D
i
sp
er
sing
I
ndex
=
y, D
i
sp
er
si
n
g
I
t
er
ation
=
V(
y)
x
=
x
+ 1, y =
y + 1
Co
nd
itio
n app
lied
:
If (x
o
r
y)
>=
L,
set th
em trea
t th
em
a
s
zero
Step 4:
Set th
e swapp
i
ng
ind
e
x
of th
e Vect
o
r
V
i
as a new st
art
val
u
e f
r
om
0 t
o
L-
1. F
o
r
j
fr
om
0 t
o
swap
pi
n
g
i
t
e
rat
i
on of
ve
ct
or V
i
, sw
ap
th
e
v
a
lu
es fr
om
0
to
L-
1,
dep
e
nd
ing upo
n th
e con
d
itions m
e
n
tio
n
e
d in
t
h
e
m
e
t
hod.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
A New Cryp
t
o
g
r
aph
ic
S
t
ra
teg
y
for
Dig
ita
l Imag
es (Nidh
i
Seth
i)
45
8
Step 5:
Set
D
i
spersi
on i
nde
x o
f
v
ect
or
s V
i
as a new
st
ar
t
val
u
e o
f
ra
n
dom
num
ber g
e
nerat
i
o
n al
g
o
r
i
t
h
m
,
wh
ich
wou
l
d
b
e
treated
as i
n
itial co
nd
itio
n
p
a
ram
e
ter.
Fo
r j fro
m
0
to
d
i
sp
ersion
iteratio
n
of vecto
r
V
i
,
gene
rat
e
ra
n
d
o
m
num
ber N
1
with
th
e
v
a
lues b
e
tween
(0 to
L-1) , t
h
en
p
e
rform
V
i
(N
i
)=
V
i
(N
i
)+
m
od
V
i
(N
i
,1
00
).
(III)
Second P
h
ase
(With key)
Step 5
: App
l
y th
e Ch
irik
ov
Mapp
ing
for ‘n’ iteratio
ns wh
ere n
=
15 o
v
e
r th
e who
l
e i
m
ag
e .The in
itia
l
param
e
t
e
r i
s
K
=
51
2
use
d
i
s
k
e
y
.
Step 6:
Di
vi
de t
h
e w
hol
e
im
age I
1
(x
1
,y
1
) into 8x8 size blocks,
B1, B2, . .
., B
nob
where nob=
I
1
(x
1
,y
1
)/
8
X
8
.
P
e
rf
orm
shu
ffl
i
n
g am
ong
t
h
e
bl
ock
s
.
Step
7
: C
r
eate a m
a
trix LM(x,y) . C
o
nve
r
t
each
decim
a
l
gray
value
to i
t
s bina
ry e
qui
valent of the
s
h
uffled
im
age LM
(x,y
). Al
s
o
creat
e
anot
her m
a
t
r
i
x
DM
j i
s
t
h
e 8
-
bi
t
bi
na
ry
n
u
m
b
er obt
ai
n
e
d fr
om
1D m
odi
fi
ed
Lo
gi
st
i
c
m
a
p.
Step 8:
Pe
rform
exclusive-OR betwee
n
DM
j
and SM
(x,y) t
o
obtain the
encrypted im
age EN(x,y
).
2.
2 Decr
ypti
o
n
:
B
y
usi
n
g
a
l
l
t
h
e p
r
ocess
e
s i
n
re
verse
or
der
,
t
h
e o
r
i
g
in
al
im
ag
e
can
b
e
retrieved
with
sat
i
s
fact
ory
se
curi
t
y
l
e
vel
,
l
e
ss com
put
at
ional
com
p
l
e
xi
t
y
and hence
fast
, whi
c
h pr
o
v
es t
o
be
a go
od
candi
date for real-tim
e s
ecure
im
age transm
ission
3.
R
E
SU
LTS AN
D ANA
LY
SIS
The p
r
o
p
o
sed
encry
p
t
i
on al
g
o
ri
t
h
m
i
s
im
plem
ent
e
d i
n
M
A
TL
AB
7 fo
r
com
put
er sim
u
l
a
t
i
ons. The
standa
rd a gra
y
-scale “Lena”
im
age
of 12
8
x
1
2
8
i
n
si
ze and “B
ab
a” im
age of
12
8 X
1
28 i
n
si
ze i
s
t
a
ken f
o
r
expe
rim
e
ntal p
u
rposes. T
h
e original Le
na image, inte
rm
e
d
iate im
age and its histogram are shown in figure
2
(
a)-(b). Th
e in
itial co
nd
itio
ns and
syst
em
p
a
ram
e
ters are: n
=
15
, K= 512
,
λ
=
0
.
3
989
8, z(0
)
= 0.362
8
(a)
(b
)
Fi
gu
re
1.
(a
) L
e
na i
m
age ori
g
i
n
al
im
age, s
w
appe
d
&
dispe
r
sed im
age, enc
r
yp
ted im
age (b) Baba im
age
ori
g
inal im
age, swa
p
ped &
di
sp
ers
e
d im
age, enc
r
ypted im
a
g
e
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
4, No
. 3,
J
u
ne 2
0
1
4
:
45
6 – 4
6
2
4
59
3.
1.
1
Key
An
al
y
s
i
s
:
i)
Sen
s
itiv
ity o
f
th
e k
e
ys:
Almo
st all ch
ao
tic m
a
p
s
are sensitiv
e to
secret k
e
ys
wh
ich
mean
s th
e i
n
itial
param
e
ter. The
propose
d
e
n
cryption al
gorithm is recep
tive
to any sm
all diffe
ren
ce t
o
init
ial param
e
ter.
A
n
y ch
an
g
e
to
th
e pow
er of
10
-14
in
on
e
o
f
th
ese
p
a
ram
e
ter will resu
lt in
to en
tirely d
i
fferen
t
.
ii)
Key Space: It
is said in security
that
m
o
re is num
ber of locks
be
tter is the safety .In the propose
d
alg
o
rith
m
th
ere are a to
tal fi
v
e
in
itial p
a
rameters: tw
o
of Ch
iri
k
ov
m
a
p
and
three
o
f
m
o
d
i
fied
lo
g
i
st
ics
map
.
3.
1.
2
Statistica
l Ana
l
y
s
is:
Many attacks can be done which are
base
d on the sta
tistical an
alysis .Statistica
l
an
aly
s
is h
a
s b
e
en
per
f
o
r
m
e
d o
n
t
h
e t
e
st
i
m
ages t
o
dem
onst
r
at
e t
h
e
bad
co
rrel
a
t
i
o
n a
m
ong t
h
e
pi
x
e
l
s
of
t
h
e e
n
cry
p
t
e
d
i
m
ag
es.Th
e
resu
lts sh
own
b
e
lo
w
shows th
at th
ere is n
e
g
lig
ib
le co
rrelatio
n b
e
t
w
een
p
i
x
e
ls
o
f
t
h
e en
cryp
ted
im
age in c
o
m
p
arison to origi
n
al im
age.
i)
Correl
ati
o
n Coe
fficient
Analysis
: To
esti
m
a
te
th
e encryp
tion
qu
ality o
f
th
e
p
r
op
o
s
ed
en
cry
p
tion
al
go
ri
t
h
m
,
t
h
e cor
r
el
at
i
on i
s
use
d
.F
or
hi
g
h
l
y
corre
lated i
m
age the corre
lation coe
fficie
n
ts are alm
o
st
1
and for enc
r
ypt
e
d im
ages
the
correlation coe
ffi
cients is alm
o
st
0
.
ii) Entro
p
y
:
Ent
r
opy
i
s
de
f
i
ned as
t
h
e
de
gree
o
f
ra
n
d
o
m
ness i
n
t
h
e s
y
st
em
. It
i
s
kn
ow
n t
h
at
t
h
e e
n
t
r
opy
H
(
m
) of a m
e
ssage s
o
urce
s
ca
n
be calculate
d as:
Here t
h
e
p
(
si)
is th
e prob
ab
ility o
f
si.W
e h
a
v
e
calcu
la
ted an
d fo
und
en
trop
y 7.988
0, whu
c
h is v
e
ry close to
the ideal
value
and he
nce t
h
e
messa
ge l
eaki
n
g i
s
i
m
percept
i
bl
e.
3.
1.
3
Differ
n
ti
al A
t
t
a
ck
Diffe
re
ntial attack /cry
ptanal
ysis
is a co
mmo
n n
a
m
e
o
f
attack
s/cryp
tan
a
l
y
sis wh
ich
is
gen
e
rally don
e
t
o
bl
oc
k ci
p
h
e
r
s w
h
i
c
h a
r
e wo
rki
n
g o
n
bi
nary
se
que
nce
s
. In t
h
i
s
t
y
pe of at
t
ack t
h
e
depe
n
d
ency
of
ci
phe
r
im
age and input im
age is ana
l
yzed.
i)
N
P
CR:
N
P
C
R
i
s
N
u
m
b
er o
f
pi
xel
c
h
a
nge
rat
e
. N
P
C
R
co
ncent
r
at
es o
n
t
h
e a
b
sol
u
t
e
n
u
m
ber of
pi
xel
s
whi
c
h c
h
an
ges
val
u
e i
n
di
ffe
r
e
nt
i
a
l
at
t
acks.
The f
o
rm
ul
a and t
h
e re
spect
i
v
e co
n
d
i
t
i
on i
s
gi
ve
n i
n
e
q
.
(
5
)
& (6
)[2
0
]
;
0
C1
(i,
j
)=C
2
(i,j)
D (i,j) =
1 if
C1
(i,j)=C
2
(i,j)………
…
…………
……
….(5)
NPCR
D
i,
j
T
,
100%
Here sy
m
bol
T
den
o
t
e
s t
h
e t
o
t
a
l
num
ber pi
x
e
l
s
i
n
t
h
e ci
p
h
e
r
i
m
age and C
1
an
d C
2
are t
w
o ci
phe
re
d
im
ages wh
ose
one
pi
xel
val
u
e i
s
chan
ged
.
Tabl
e I s
h
o
w
s t
h
e
val
u
es of NPC
R
d
u
ri
ng expe
ri
m
e
nt
at
i
o
n
.I
f
t
h
e
v
a
lu
e
of
NPCR
is n
e
ar
0
.
9
9
, it is treated
as
go
od
.
Tabl
e
1. R
e
s
u
l
t
s
o
f
E
n
cry
p
t
i
o
n Sc
hem
e
Baba
Lena
Ent
r
opy (
E
ncryption)
7.
9866
7.
9880
Correlation Coef
.
0.
0013
0.
0054
NPCR
0.
9912
0.
9923
UACI
0.
0149
0.
0159
3.
1.
4
Hi
sto
g
r
a
m An
al
ysi
s
Th
e
h
i
stog
r
a
ms o
f
en
ci
p
h
e
r
e
d
im
ag
es w
e
re an
alyzed
and
it w
a
s
f
ound
th
at th
e
h
i
st
o
g
r
a
m
s
ar
e
usu
a
l
l
y
uni
fo
r
m
. Thi
s
pro
p
e
r
t
y
m
a
kes st
at
i
s
t
i
cal
at
t
acks di
ffi
cul
t
i
n
im
ages .The t
e
st
on
l
e
na and ba
ba
im
age
i
s
sh
ow
n
bel
o
w:
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
A New Cryp
t
o
g
r
aph
ic
S
t
ra
teg
y
for
Dig
ita
l Imag
es (Nidh
i
Seth
i)
46
0
Fi
gu
re
2.
Hi
st
o
g
ram
of
o
r
i
g
i
n
al and enc
r
ypte
d im
age (Le
n
a)
Fi
gu
re
3.
Hi
st
o
g
ram
of
o
r
i
g
i
n
al and enc
r
ypte
d im
age (Baba
)
Th
e secur
ity an
alysis of
th
e pr
opo
sed wor
k
is co
m
p
ared wit
h
th
e o
t
h
e
r ex
istin
g
en
cry
p
tio
n sch
e
m
e
s
and
com
p
ari
s
i
o
n i
s
s
h
ow
n i
n
t
a
bl
e 2
bel
o
w:
Table 2.
C
o
m
p
arative Analysi
s
of
t
h
e
p
r
op
os
ed e
n
cry
p
t
i
o
n
s
c
hem
e
I
m
age
Aut
h
or
Year
of
Pub.
Correlation Entropy
NPCR
(
%
)
UACI(
%
)
L
e
na256X256
Shubo
L
i
u
2008
0.
0014
-
-
-
-
-
99.
604%
Debashish
2012
0.
008
99.
56%
33.
40%
Choun
g
2012
0.
008
7.
9902
99.
61%
33.
48
M
d
.
A
li
2008
0.
023
5.
431
-
-
-
-
-
-
-
-
-
-
Soheil
2011
0.
025
-
-
-
-
-
49%
42%
Par
eek
2011
0.
020
-
-
-
-
-
98.
2%
32.
29%
Par
eek
2006
-
-
-
-
-
-
-
-
-
-
Over
99%
-
-
-
-
-
L
i
an
2005
-
-
-
-
-
-
-
-
-
-
0.
017-
99.
6%
1.
04-
33.
4%
Pr
oposed
2013
0.
0054
7.
9880
99.
23%
1.
59%
4
CO
NCL
USI
O
N
In t
h
e
hi
st
ory
t
h
e C
h
aot
i
c
t
h
eory
ha
ve p
r
o
v
en t
o
be a v
e
ry
go
o
d
can
d
i
dat
e
fo
r enc
r
y
p
t
i
on .T
he
sy
mm
e
t
ric en
cryp
tion
sch
e
mes b
a
sed
o
n
chao
s th
eo
ry h
a
ve q
u
a
lities lik
e fast p
r
o
cessing
sp
eed
,
sim
p
l
e
, h
i
gh
sen
s
itiv
ity to
k
e
ys and
secure.
In
t
h
e
p
r
op
o
s
ed
al
g
o
rithm
two
ch
ao
tic m
a
p
s
are u
s
ed
Ch
i
r
iko
v
m
a
p
an
d
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
4, No
. 3,
J
u
ne 2
0
1
4
:
45
6 – 4
6
2
4
61
m
odi
fi
ed l
o
gi
st
i
c
m
a
p. To
m
a
ke t
h
e
al
g
o
ri
t
h
m
rob
u
st
t
h
e
im
age i
s
scra
m
b
l
e
d and
pe
r
m
ut
ed wi
t
h
o
u
t
usi
n
g
key. B
o
th
security analysis and key
analysis shows t
h
at the algorithm
is
resistan
t to m
a
n
y
attack
s like bru
t
e
f
o
r
ce attack
, man
in
m
i
d
d
l
e at
tack
, p
l
ain
tex
t
attack
, en
tr
opy attack
an
d
cho
s
en
cip
h
e
r
attack
. Th
er
e ar
e
tr
ad
e-
offs
betwee
n is
sues s
u
c
h
as
speed, c
o
st, and c
o
m
p
lexity.
REFERE
NC
ES
[1]
Behnia, S., Akhshani, A., Mahmodi, H
., & Akhavan, A. A novel algorithm fo
r image encr
y
p
tion
based onmixtur
e
of chao
tic
m
a
ps
.
C, So
ls and
Fra
2008; 35
: 408-4
19.
[2]
Chen, Dongming, & Chang, Yu
npeng . A novel imag
e encr
y
p
tio
n algorithm based on logistic maps.
A Inf Sci Se
r
S
, 2011;3(7)
: 36
4-372.
[3]
Chengqing Li,
On the secur
i
ty
of a class of Image Encr
y
p
tion S
c
heme,
I
E
EE International S
y
m
posium on Circuit
&
Sys
t
em, Depar
tment of
El
ec
tr
onics
Eng
i
neer
in
g
, University
of
Hong Kong. 200
8; 3290-3293,.
[4]
Chong Fu, Jun-jie Chen
, Hao
Zou, Wei-hong
Meng, Yong
-feng Zhan,
and Ya-wen Yu, A chaos-based digital
im
age en
cr
ypt
i
o
n
s
c
hem
e
wi
th
an improved diffu
sion strateg
y
.
OSA OPT
I
CS
EX
P
RESS
. 2012
; 23
63.
[5]
Gao, T
.
,
&
Chen
, Z
.
.
Im
age
enc
r
ypt
i
on b
a
sed on
a new
total shuff
ling
algorithm.
C, Sol and
Fra
2
008; 38: 213-22
0.
[6]
Indra
k
a
n
ti,
S.
P.
,
& Ava
dha
ni,
P.
S.
Pe
rm
utatio
n based image encr
y
p
tion tech
nique.
Int. J of
Comr App
. 201
1;
28(8):
45-47
.
[7]
Ism
a
il, Am
r Ism
a
il, Moham
m
e
d, Am
in,
&
Diab, Hossam
.
A digit
a
l
im
age en
cr
yption
algorithm
b
a
sed
a
composition of
two chaotic logis
tic map.
In
t
J
N
e
twork S
e
c
. 201
0;11(1),1-10
.
[8]
Jolfaei, Alir
eza, & Mirghadr
i,
Abdolrasoul.
Im
age encr
y
p
tion using
chaos and
block ciph
er.
Com and Inf Sci
.
2011;4(1):172-1
85.
[9]
Sethi N., Krishn
a R., Aror
a R.P.
,
“
Image Encrypt
i
on Using pixel
t
r
ansmutation and Transition in MATLAB
”, In
: 5
th
International Multi-Conference
on Intell
igent S
y
stem
s,
Sustainable, New and R
e
newabl
e Energ
y
T
echnolog
y
&
Nanotechno
log
y
(IISN-2011) at I
S
T , K
a
lawad
,
Har
y
ana from 18 Feb 2011
[10]
Nay
a
k,
C.
K.,
Achary
a,
A.
K.,
& Das,
S
a
t
y
abrat
a
.
Im
age encr
y
p
ti
on us
ing an enhanced blo
c
k bas
e
d trans
f
orm
a
tio
n
algorithm.
Int J
of Res and
Review in Compr Sci
.
2011; 2(2): 275-
279.
[11]
Jonathan M . Blackedg
e
, Musheer Ahmed, Omar Farooq,
“Chaotic image
encr
y
p
tion algorithm based on freq
u
en
cy
domain scrambling”,
S
c
hool of Electrical Engi
n
e
ering systems
Articles
, Dubl
in In
stitute of
Techno
log
y
, 2006
;
[12]
P
a
reek,
N.K.
, P
a
tid
ar, Vinod
,
&
S
ud, K.K.
Im
age en
cr
yption
u
s
ing chao
tic
log
i
s
tic m
a
p
.
Img a
nd V Computin
g
.
2006;24: 926-93
4.
[13]
Patidar
, Vinod
,
Pareek,
N.K.
, &
Sud, K.K. Modif
i
ed subs
titu
tion–
diffusion im
age
cipher
using ch
a
o
tic st
andard
an
d
logistic maps.
C
o
mmunication
in
Nonlin
ear Scien
ce and
Numerical Simulation
, 2
010; 15: 2755-2
765.
[14]
Puech, W.
and
Rodrigues, J
.
M. A Ne
w Cr
y
p
to-
Watermarking
Method for Med
i
ca
l Images Safe Transf
er. In
Th
e
12
th
European
Signal Processing
Conference
, 200
4 ; Vienna , Austria pp
: 1481-148
4,
[15]
Sathishkumar, G.A., & Bagan
,
K. Bhoopath
y
.
A novel imag
e encr
y
p
tion algorith
m
using
pixel shuffling Base 64
encoding
based
chaotic b
l
ock
cipher.
WSEAS
Trans. on Computers
, 2011;10(6): 1
69-178.
[16]
Shannon, C.E.
Communication
th
eor
y
of
secr
ecy
s
y
stems,
Be
ll S
y
s
t
ems
T
echni
ca
l J
.1940; 28: 656
-715.
[17]
Tong, X., Cui,
M. Image encr
yption with com
pound chaotic s
e
quence ciph
er
shifting d
y
namically
,
Img and
V
Computing
2008
; 26: 843-850.
[18]
Yoon, Ji W., Kim, Hy
oungshick
. An image encr
y
p
tion sche
me
with a pseudorandom pe
rmutation based on chaotic
ma
ps.
Comm. in
Nonlinear S
c
i. a
nd Numerical Sim
. 2010;01: 041.
[19]
Younes, M.A.B., & Jantan
, A.
An image encr
yption appr
oach
using a combination
of permutation techniqu
e
followed b
y
en
cr
y
p
tion.
Int J o
f
C
o
mp Sci and
Network Sec
. 2008
;
8: 191-197
[20]
Yue, Wu, Joseph, P. Noonan,
A.Sos. NPCR
and
UACI randomne
ss
tests for i
m
age encr
y
p
tion.
J o
f
Sele
cted Ar
eas
in T
e
l
ecomm
20
11; 31-38.
[21]
S
e
thi N.
, Vij
a
y
S
., “
A
H
y
brid
Cr
y
p
tos
y
s
t
em
F
o
r
Im
age Us
ing C
h
aoti
c M
a
pping
”,
In
t J o
f
Com
Sci and
Busines
s
Informatics (
I
JCSBI)
,
2013; Vol
5, No.1
,2013.
[22]
Sethi N., “A New Image Encr
y
p
tion Method Using Chirikov
Map and Logistic
Mapping”, Int J
of Computer App
s
2012;0975 – 888
7:Vol 59-No. 3
Electronics,
vol. 58, pp. 450-464
, Feb
2011.
BIOGRAP
HI
ES OF
AUTH
ORS
Nidhi Sethi re
c
e
ived B
.
Sc (Co
m
puter Applica
t
ion) from Kurukshetra University
, M
.
Tech (IT
)
from AAI-DU and is pursuing P
h
.d from Uttr
akh
a
nd Technical U
n
iversity
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
A New Cryp
t
o
g
r
aph
ic
S
t
ra
teg
y
for
Dig
ita
l Imag
es (Nidh
i
Seth
i)
46
2
Sandip received
B.Sc. (Engg
.) from PIT
Patna (e
rstwhile Magad
h
University
)
in
2000 M.Tech.
(Ele
ctroni
cs & Com
m
.
Engg.)
in 2005, the m
e
m
b
er of IEEE (USA), NSBE (
U
SA), IANEG
(USA), ISOC (USA), Life Member of ISTE (INDI
A) has published over Fifty
research papers in
nation
a
l and int
e
rnat
ional journ
a
ls/conf
eren
ces and IEEE proc
e
e
ding public
at
io
n in field of
W
i
reless & Digital Com
m
unicati
on Network, and
s
upervised mor
e
than 30 projects/dissertation
of M
.
Te
ch.
&
B.
Tech
. S
t
ud
ents
.
Evaluation Warning : The document was created with Spire.PDF for Python.