Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
V
o
l.
6, N
o
. 4
,
A
ugu
st
2016
, pp
. 17
85
~
1
791
I
S
SN
: 208
8-8
7
0
8
,
D
O
I
:
10.115
91
/ij
ece.v6
i
4.9
674
1
785
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
Two Way Mechanism to Enhance
Confidentiality and Accuracy
of Shared Information
Manas
h
Pr
atim Du
tta,
Su
b
h
asish
Baner
j
ee, Swar
nend
u Kum
a
r
Ch
akrab
o
r
t
y,
Chandan Tilak B
hunia
Department o
f
C
o
mputer Scien
c
e &
E
ngineering
,
National Institute of
Te
chnolog
y
,
Arunach
al Prad
esh, India
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Dec 9, 2015
Rev
i
sed
Feb
18
, 20
16
Accepte
d
Mar 2, 2016
As
such internet and information tec
hnolog
y
hav
e
influen
ced the
human life
significantly
thu
s
the current technolog
y
cannot
solely
assure the security
of
shared information. Hence,
to
fulf
il such r
e
qu
irements mass amount of
research
have b
een under
t
ak
en
b
y
v
a
rious researchers among which one o
f
the m
echanis
m
s
is
the us
e of dynam
i
c
ke
y
r
a
t
h
er than s
t
ati
c
one. In this
regard, we h
a
ve
proposed a method of
key
g
e
ner
a
tion to provid
e
the d
y
n
a
mic
key
s
. The scheme not only
can change
the key
but also provide the erro
r
control m
ech
ani
s
m
.
At the end
of this
paper
,
a
com
p
aris
on with
the exis
t
i
ng
techn
i
ques has also been made to prove the efficiency
of th
e proposed
scheme.
Keyword:
Dy
nam
i
c key
Er
ro
r con
t
ro
l
R
a
nd
om
ness
Security
Copyright ©
201
6 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
:
Manash Pr
atim
D
u
tta,
Depa
rt
m
e
nt
of
C
o
m
put
er Sci
e
nce &
E
ngi
nee
r
i
n
g,
Natio
n
a
l
In
stitu
te of Tech
n
o
l
o
g
y
, Arun
ach
a
l Prad
esh,
Y
u
p
i
a, In
d
i
a 79
111
0.
Em
a
il: man
a
shp
d
u
tta@g
m
a
i
l
.co
m
1.
INTRODUCTION
W
i
t
h
t
h
e
rapi
d de
vel
o
pm
ent
of c
o
m
put
er
net
w
or
ks a
nd
m
i
cro el
ect
ro
m
echani
cal
de
vi
ces (sm
a
rt
phone, pa
d etc.), it becom
e
s f
easible
to access the diffe
rent
services from
di
ffe
re
nt servic
e provider servers at
any
t
im
e and a
n
y
w
here i
n
t
h
e
wo
rl
d
wi
t
h
i
n
a fract
i
o
n
of
se
cond.
Due to t
h
e large nu
m
b
er of users
,
ac
cessing
the services at a tim
e
,
it creates a huge traffi
c and lo
a
d
ove
rhea
d i
n
t
h
e c
o
m
m
uni
cat
i
on n
e
t
w
o
r
ks
. As a r
e
sul
t
,
the cha
n
ces of noises a
r
e growing expone
nt
ially. This
m
a
y occur due to load
overh
ead
or i
n
t
e
rfe
rence
by
t
h
e
un
wa
nt
ed
use
r
s. T
h
ere
f
o
r
e, t
o
im
pro
v
e t
h
e t
h
ro
u
g
h
p
u
t
an
d s
ecuri
t
y
o
f
t
h
e
s
h
are
d
i
n
f
o
rm
ati
on,
m
a
ss am
ount
of
researc
h
in the field of advance
d
err
o
r
co
n
t
r
o
l [1
],
[2
] an
d
secur
ity
in share
d
inform
ation ha
ve been
un
de
rt
ake
n
by
m
a
ny
researc
h
ers. I
n
19
8
1
,
L
a
m
port
[
3
]
p
r
o
pos
ed
fi
rst
co
n
v
ent
i
o
nal
a
u
t
h
ent
i
cat
i
on sy
st
em
t
o
veri
fy
t
h
e l
e
gi
t
i
m
acy
am
ong t
h
e use
r
s i
n
w
h
i
c
h t
h
e rem
o
t
e
serve
r
m
a
i
n
t
a
i
n
ed a pas
s
w
o
r
d
t
a
bl
e. H
o
we
ve
r
,
d
u
e
t
o
t
h
e
sy
st
em
ove
r
h
ead
, sm
art
car
ds
base
d
aut
h
ent
i
cat
i
o
n
schem
e
s [
4
]
-
[
6
]
ha
ve
bee
n
wi
del
y
a
d
o
p
t
e
d.
I
n
ad
d
ition
,
sin
c
e th
e n
u
m
b
e
r of serv
ice pro
v
id
er serv
ers
for u
s
ers are u
s
u
a
lly
m
o
re th
an
on
e, rem
o
te u
s
er
au
th
en
ticatio
n
sch
e
m
e
s u
s
ed
fo
r m
u
lti-serv
er arch
itectu
r
e
rath
er th
an
sin
g
l
e serv
er circum
s
t
an
ce is co
n
s
id
ered
[7]
,
[8]
.
To i
m
pro
v
e t
h
e sec
u
ri
t
y
t
o
ne
xt
hi
g
h
er
l
e
vel
,
a
bi
om
et
ri
c base
d
re
cog
n
i
zat
i
o
n
ha
s al
so
bee
n
i
n
co
rp
orat
e
d
a
s
anot
her
par
a
m
e
t
e
r of aut
h
ent
i
cat
i
o
n [
9
]
,
[1
0]
. B
u
t
,
m
a
i
n
com
m
on
fact
or i
n
al
l
t
hose
mechanism
s
is
key m
u
st
be secure
d
enou
gh
. Meanw
h
ile, assu
r
i
ng
su
ch n
ecessity is n
o
t feasib
le an
y
m
o
re
with
th
e sam
e
k
e
y; do
es
no
t
matter h
o
w lon
g
it is. Hen
c
e, on
e
o
f
th
e solu
tio
n
s
is wh
y
n
o
t
m
a
k
i
n
g
the k
e
ys
dy
nam
i
c i
n
nat
u
re t
h
ose c
h
an
ge i
n
eve
r
y
fra
ct
i
on o
f
t
i
m
e
. Bu
t, to
prov
id
e su
ch
op
tio
n, eith
er bo
th
th
e
p
a
rties
m
u
st
have t
o
agree
u
p
o
n
a
bu
nc
h
of
key
s
o
r
t
h
ey
m
u
st
have
t
o
s
h
are
a ne
w
key
by
enc
r
y
p
t
i
n
g
wi
t
h
t
h
e
p
r
ev
iou
s
o
n
e
. Howev
e
r, in
fi
rst case, th
e cost o
f
n
e
go
tiatin
g
su
ch
b
u
n
c
h
of k
e
ys and
p
r
o
t
ectin
g
th
e same will
be t
o
o
hi
g
h
si
m
i
l
a
rl
y
i
n
t
h
e ot
he
r case, i
f
a
n
y
o
n
e
of t
h
e
keys is com
p
romised then
t
h
e
entire rest of t
h
e
keys
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 4
,
Au
gu
st 2
016
:
17
85
–
1
791
1
786
can easily be
decry
p
ted
by
the attackers
one
after a
n
ot
her
.
T
h
ere
f
o
r
e
,
i
n
20
0
6
, B
h
uni
a et
al
.
[
1
1]
-[
1
3
]
in
trodu
ced
t
h
e id
ea o
f
Au
to
matic Variab
le Key (AVK)
wh
ere
nei
t
h
er
b
u
n
ch
of t
h
e key
s
t
o
be
neg
o
t
i
a
t
e
d n
o
r
even
need t
o
be share
d
ev
e
r
y
t
i
m
e
. In A
V
K
,
a new key
i
s
gene
rat
e
d sy
m
m
e
t
r
i
cal
ly
by
bot
h t
h
e pa
rt
i
e
s ever
y
tim
e
whene
v
er a ne
w
data is exc
h
ange
d.
Afterwa
r
ds,
C
h
a
k
ra
b
o
rty
et al.
[1
4]
,
Go
sw
ami et al.
[
1
5
]-[
19
],
Banerjee et al.
[20]-[24], Sing et al.
[25], Pra
j
apat et al. [26] ha
ve als
o
em
phasized in t
h
is
arena
and
propose
d
m
a
ny
new
i
d
ea
s t
o
pr
om
ot
e t
h
e secu
ri
t
y
t
o
ne
xt
hi
ghe
r l
e
vel
.
Unfortunately, in all such m
e
chan
ism
s
even though they are able
to reduce the comm
u
n
ication cost
fo
r sha
r
i
n
g or
neg
o
t
i
a
t
i
ng t
h
e
new key
s
,
but
st
i
l
l
t
h
e requi
r
e
m
e
nt
s of m
a
int
a
i
n
i
n
g key
secrecy
has n
o
t
bee
n
waive
d
c
o
m
p
l
e
tely. Because, if a
n
y
how the attacker
will succee
d t
o
ge
t
any one
of the keys
by ciphertext
only attack then also he can e
a
sily co
m
pute
the rest of
the keys afterwa
r
ds. There
f
ore, t
o
overc
o
m
e
from
the
aforesaid
dra
w
back
we ha
ve
propose
d
a new m
echan
ism to create the dynam
i
c keys
whe
r
e keys ca
n be
g
e
n
e
rated b
a
sed
o
n
two
estab
lish
e
d
in
itial k
e
ys.
Th
e re
st o
f
th
e
p
a
p
e
r
is o
r
g
a
n
i
zed
as fo
llo
ws: sectio
n
2
dem
onst
r
at
es
t
h
e pr
o
pos
ed
sc
hem
e
“Key
Ge
nerat
i
o
n wi
t
h
Err
o
r
C
o
nt
r
o
l
(
KGEC
)
” w
h
i
c
h not
o
n
l
y
gen
e
rat
e
s
th
e k
e
ys bu
t also
can
p
r
o
v
i
de th
e erro
r con
t
ro
l. Th
e st
ep wise illu
strati
o
n
of t
h
e sch
e
me with
ex
amp
l
e is
descri
bed i
n
se
ct
i
on 3
.
T
h
e ex
peri
m
e
nt
al
resul
t
s
ha
ve
bee
n
fu
rni
s
he
d i
n
se
ct
i
on 4
w
h
ere
as com
p
ari
s
o
n
am
ong
th
e related sche
m
e
s is
m
e
n
tio
n
e
d in
sectio
n
5
.
Fin
a
lly, conclu
d
i
ng
rem
a
rks is g
i
v
e
n in
sectio
n
6
.
2.
PROP
OSE
D
SCHE
ME
In
t
h
i
s
p
h
ase,
we
ha
ve
p
r
o
pos
ed
a
Key
Gene
ration
with
Erro
r Con
t
ro
l (KGEC) mech
an
ism
to
g
e
n
e
rate th
e auto
m
a
tic k
e
ys an
d
prov
id
e
an
ad
d
ition
a
l feat
u
r
e
o
f
error con
t
ro
l. In
th
is ap
pro
ach, th
e en
tire set
of
pl
ai
nt
ext
ne
eds t
o
be
di
vi
d
e
d i
n
t
o
eq
ual
s
i
zed bl
ocks i
n
t
h
e f
o
rm
of s
q
uare m
a
t
r
i
ces of
or
de
r n/
8,
w
h
ere
n
is the bloc
k le
ngt
h of e
n
cryption m
e
thod (i.e. in DES, t
h
e length of
n=
64
bits
or
i
n
AES
the
length of n
=128
b
its etc). If th
e len
g
t
h
of th
e
o
r
i
g
in
al p
l
ain
t
ex
t is n
o
t
m
u
lti
p
l
e of n
/
8
×
n
/
8
b
its th
en
ex
tra
b
its will b
e
app
e
nd
ed
as parity bits
and the bl
oc
ks
of m
a
trices are encrypte
d
o
n
e at a
ti
me. If we call su
ch
matrix
as P th
en
th
e
m
a
t
r
i
x
P ca
n
b
e
de
fi
ne
d as
p
1
, p
2
, p
3
, --
--
--
--
- wh
er
e p
i
is th
e i
th
bl
oc
k
of
pl
a
i
n t
e
xt
.
Su
pp
ose, i
f
t
h
e encry
p
t
i
o
n
m
e
t
hod
used i
s
DES, t
h
en t
h
e or
der
of t
h
e
i
ndi
vi
dual
pl
ai
n t
e
xt
m
a
t
r
i
x
bloc
k is 64/8 (n = 64) i.e.
8 a
nd e
v
ery c
h
ara
c
ter of the
plain text consists of
8 bits each.
There
f
ore, t
h
e
entire
pl
ai
n t
e
xt
bl
oc
ks ca
n
be
rep
r
e
s
ent
e
d
as
per
F
i
gu
re
1 f
o
r t
h
e
fol
l
o
wi
n
g
pl
ai
n
t
e
xt
:
“i
f som
e
one st
eal
s y
our pas
s
w
o
r
d y
o
u
can
chan
ge i
t
but
i
f
som
e
one st
eal
s y
our t
h
um
b pri
n
t
y
o
u
cann
o
t
get
a
ne
w t
h
um
b t
h
e
fa
i
l
u
re m
odes a
r
e ve
ry
di
f
f
ere
n
t
”
.
Fig
u
re
1
.
Represen
tatio
n of
plain
tex
t
in m
a
t
r
ix
form
After di
viding
the entire
plain te
xt into m
a
trix form
, each row an
d eac
h c
o
lum
n
woul
d
be encry
p
ted
separately by the aut
o
ge
ne
ra
ted va
ri
able ke
ys. Therefore
,
for each
n/8
num
b
er of
plaintext in the bl
oc
k, the
n
u
m
b
e
r
o
f
ciph
ertex
t
will b
e
n
/
4
(i.e. n
/
8
+
n/8
)
.
On
ce all
th
e
n
/
8
row ci
ph
er as well as
n
/
8
co
lu
m
n
ciph
er are
receive
d succe
ssfully, then the receive
r will perform
decryption se
paratel
y
and create two ne
w set of matrices
one
f
o
r
r
o
w
d
ecry
p
t
e
d
ci
p
h
e
r
t
e
xt
a
n
d t
h
e
ot
he
r
one
i
s
f
o
r c
o
l
u
m
n
dec
r
y
p
t
e
d ci
p
h
e
r
t
e
xt
nam
e
l
y
, p'
ro
w
and
p'
colu
m
n
resp
ectiv
ely. No
w, if
b
o
t
h
th
e m
a
tri
ces produce
the sam
e
values i.e. p'
row
= = (p'
colu
m
n
)
T
, whe
r
e
M
T
is
tran
sp
ose of t
h
e m
a
trix
M,
th
en
t
h
e receiv
e
d m
e
ssag
e
s will b
e
treated as error
free
o
t
h
e
rwise
d
i
scard
t
h
e
ent
i
r
e re
cei
ve
d
m
e
ssages of
t
h
e co
rres
p
on
di
n
g
bl
oc
ks as
n
o
i
s
e has
bee
n
det
ect
ed.
Th
e
p
r
o
p
o
s
ed
sch
e
m
e
can
g
e
n
e
rate th
e
su
ccessiv
e
k
e
ys
b
a
sed
o
n
t
w
o
i
n
itial k
e
ys i.e. K
1r
ow
and
K
1col
.
At first, p
1
(1
)(
)
th
ro
w and
p
1
(
)(1
)
th
co
lu
m
n
o
f
th
e 1
st
p
l
aintex
t
m
a
trix
p
1
wo
ul
d
be encr
y
p
t
e
d by
usi
n
g
key
s
K
1row
and K
1col
r
e
sp
ectiv
ely to
pr
odu
ce
the two cipherte
xts C
1,1row
and C
1,1col
. Therefore
,
for each
n/8
× n/
8
sq
uare m
a
trices, th
e
nu
m
b
er o
f
ci
p
h
e
rtex
t
will b
e
n
/
4
with
d
i
fferen
t
au
t
o
g
e
n
e
rated k
e
ys. No
w, th
e K
iro
w
th
and
p
1
(
1
)(
)
p
2
(3
)
(
)
P =
,
p
1
(
)
(
4
)
p
2
( )
(
2
)
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Two W
a
y
Mec
hanism to Enhance
Co
nfide
n
tiality and Acc
u
racy
of
Shar
e
d
.... (Manas
h Pr
atim
Dutta)
1
787
K
icol
th
key
s
can
sim
p
l
y
be generat
e
d by
co
m
put
i
ng K
irow
←
K
(i-1)row
p
j
( )(
u-
1) a
n
d K
icol
←
K
(i-1)col
p
j
(u
-
1)
( ) whe
r
e u
i
s
the u
th
row
or co
lu
m
n
o
f
the m
a
trix
b
l
o
c
k
p
j
. Ev
en
tu
ally,
b
y
using
th
ese
au
to
g
e
n
e
rated k
e
ys
t
h
e e
n
cry
p
t
i
o
n
of
t
h
e
res
p
ect
i
v
e
ro
w
o
r
c
o
l
u
m
n
of t
h
e
m
a
t
r
i
x
bl
oc
k ca
n
be
de
fi
ne
d as
C
j,urow
←
E{
K
irow
, p
j
(u
)(
)} a
n
d
C
j,ucol
←
E{K
icol
, p
j
( )(
u)
} an
d so on
.
The al
go
ri
t
h
m
fo
r
key
ge
ne
rat
i
on a
n
d e
n
cry
p
t
i
on
fo
r t
h
e
pl
a
i
n t
e
xt
bl
oc
ks a
r
e
descri
bed
be
l
o
w:
_
_
,
,
,
←
,
1
,
←
,
1
←
2
,
←
1
,
←
2
1
&&
1
←
⊕
8
⁄
←
⊕
8
⁄
←
⊕
1
←
⊕
1
,
←
,
,
←
,
8
⁄
1
←
1
←
1
←
1
←
1
3.
STEP WISE
ILLUSTRATION
OF
THE
PROP
OSE
D
SCHE
ME
We n
o
w
t
u
rn
t
o
a di
sc
ussi
on
o
f
t
h
e st
e
p
wi
se
o
p
erat
i
ons
t
o
per
f
o
r
m
t
h
e encry
p
t
i
on a
n
d
key
gene
rat
i
o
n p
r
o
cedu
r
e o
f
t
h
e
pr
o
pose
d
sc
he
m
e
. The hexa
d
ecim
a
l
equi
val
e
nt
of t
h
e
pre
v
i
ousl
y
m
e
nt
i
oned 1
st
bl
oc
k of
m
a
t
r
ix p
1
of
t
h
e gi
ve
n pl
ai
n
t
e
xt
i
s
p
1
=
69
66
65
73
73
6
74
65
6
75
6
72
72
70
64
79
6
65
61
6
6
6
73
79
61
73
6
75
73
77
63
61
6
63
74
62
68
61
75
74
6
65
61
6
6
6
73
79
6
67
69
66
65
69
73
6
65
73
6
73
74
65
72
74
Let th
e h
e
x
a
deci
m
a
l v
a
lu
es o
f
two
in
itial k
e
ys K
1row
and K
1col
are “
A3
EC0F172
CA0
3
BA9
” a
n
d
“
C
A
31
F0
6BC
A
3
52A
5B
” r
e
s
p
ect
i
v
el
y
and
t
h
e encry
p
t
i
o
n
m
e
t
hod i
s
D
E
S. The
r
ef
o
r
e,
t
h
e 1
st
encrypted row
C
1,1row
is “
5
2
E
7
9
BA985
885
D6
7
” a
n
d col
u
mn C
1,1col
is “
56
0F
60C
B
7
06
1E
95C
”
for th
e matrix
p
1
.
Th
er
e
f
o
r
e,
to
encry
p
t 2
nd
row and
co
lu
m
n
o
f
th
e m
a
trix
p
1
, the keys K
2row
and K
2col
will b
e
co
m
p
u
t
ed
as K
2row
←
K
1row
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
JECE
Vo
l. 6
,
N
o
. 4
,
Au
gu
st 2
016
:
17
85
–
1
791
1
788
p
1
( )(
1
)
a
n
d
K
2col
←
K
1col
p
1
(1
)(
) and
th
e h
e
x
a
d
e
ci
m
a
l eq
u
i
v
a
l
e
n
t
of
g
e
n
e
rated
k
e
ys will b
e
“
A35
783
04
A75
045
35
” a
n
d “
CA8
960
784
2D4
5
6
C
8
” res
p
ec
tively. Hence
,
t
h
e e
n
tire row
wise enc
r
ypte
d m
a
trix
C
row1
an
d
co
lum
n
wise en
cry
p
ted
m
a
trix
C
col1
are:
C
row1
=
52
7
93
9
9
9
90
33
8
56
13
1
9
88
51
85
88
85
1
5
67
38
3
68
4
5
6
47
43
7
04
66
06
12
65
4
1
2
8
69
5
33
7
6
76
43
8
98
6
9
93
6
19
71
05
8
37
C
col1
=
56
8
0
87
26
0
9
50
60
9
79
10
4
98
2
6
3
4
78
5
61
00
52
9
26
70
92
61
70
3
5
9
5
76
1
45
3
04
63
91
6
55
5
7
58
37
15
86
34
02
71
There
f
ore, afte
r receiving C
row1
and C
col1
, if t
h
e decry
p
t
i
on f
o
rm
s of row wi
se C
row1
co
m
p
lete
ly
ove
rl
aps
wi
t
h
t
r
ans
p
ose dec
r
y
p
t
i
on
fo
rm
s of col
u
m
n
wi
se C
col1
(i.e. D{C
row1
} ==D{C
col1
}
T
), th
en
th
e receiv
er
will take it grant that received m
e
ssage is
noise free
and ke
pt the copy of the
dec
r
ypted m
a
trix bloc
k
othe
rwise, simply discard the entire
m
a
trix as
m
e
ssage been c
o
r
r
u
p
t
e
d an
d appl
y
t
h
e ap
pr
op
ri
at
e AR
Q
mech
an
ism
to
g
e
n
e
rate resend
requ
est.
4.
E
X
PERI
MEN
T
AL RES
U
L
T
S
In th
is section, we will
d
e
mo
n
s
t
r
ate so
m
e
ex
p
e
rim
e
n
t
al resu
lts with
v
a
rio
u
s
set
o
f
p
l
ain
tex
t
. To
express e
fficie
n
cy of the
propose
d
m
echanism
,
we
ha
v
e
co
nsi
d
e
r
ed
r
a
nd
om
ness as
a pa
ram
e
t
e
r
whe
r
e
rando
m
n
ess h
a
s b
e
en
calcu
lated
b
a
sed on
h
a
mmin
g
d
i
stan
ce b
e
tween
t
h
e
su
ccessi
v
e
k
e
ys. Fo
r t
h
e illu
st
ratio
n
pu
r
pose a
n
d t
o
pr
o
v
e t
h
e e
ffi
ci
ency
of
o
u
r
schem
e
t
o
gen
e
rat
e
t
h
e s
u
cce
ssi
ve key
s
, we
have
use
d
t
h
e
sam
e
in
itial k
e
ys “
673
DE290
F120
A6
8
C
”
fo
r row
an
d “
5D
A78
0
E
48
12
FCAC
0
”
for co
lu
m
n
in
all
th
e exp
e
rim
e
n
t
s.
Ex
peri
m
e
nt
1:
In t
h
i
s
ex
peri
m
e
nt
, we have
used “
A
n
erro
r det
ect
i
ng co
d
e
can det
ect
o
n
l
y
t
h
e t
y
pes
of
errors f
o
r w
h
i
c
h i
t
i
s
desi
gned
ot
her t
y
pe
of
errors m
a
y
remai
n
un
det
ect
ed
” as a data set. The compute
d
val
u
es
of ra
n
d
o
m
n
ess am
ong
t
h
e aut
o
ge
ner
a
t
e
d successi
v
e
ro
w key
s
an
d col
u
m
n
key
s
are sho
w
n i
n
Fi
gu
re
2
(
a)
an
d 2(b
)
resp
ectiv
ely.
Fi
gu
re
2(a
)
.
R
a
nd
om
ness am
ong
t
h
e
successi
ve r
o
w
wi
se
key
s
fo
r t
h
e e
xpe
ri
m
e
nt
1
Fi
gu
re
2(
b
)
. R
a
nd
om
ness am
ong
t
h
e
successi
ve c
o
l
u
m
n
wi
se
key
s
f
o
r t
h
e e
xpe
ri
m
e
nt
1
Ex
peri
m
e
nt
2:
“
A bu
rst
error
i
s
more l
i
kel
y t
o
occ
u
r t
h
a
n
a
si
ngl
e bi
t
err
o
r
.
The
dur
at
i
o
n
of
n
o
i
s
e i
s
nor
m
a
l
l
y
l
o
n
g
e
r t
h
a
n
t
h
e
d
u
r
at
i
o
n of
one
bi
t
w
h
i
c
h
mea
n
s w
h
e
n
noi
se
af
f
ect
s dat
a i
t
af
f
ect
s a set
of
bi
t
” is
con
s
i
d
ere
d
as
t
h
e
dat
a
set
f
o
r
t
h
i
s
ex
pe
ri
m
e
nt
. T
h
e e
xpe
ri
m
e
nt
al
resul
t
f
o
r
ra
nd
om
ness are s
h
o
w
n i
n
Fi
gu
re
3
(
a)
an
d 3(b
)
.
Successive Key Pa
irs
Successive Key Pa
irs
R
andomne
s
s
R
andomness
Evaluation Warning : The document was created with Spire.PDF for Python.
IJECE
ISS
N
:
2088-8708
Two W
a
y
Mec
h
anism to Enhance
Confide
n
tiality and
Acc
u
racy of Share
d
....
(Manas
h
Pr
atim Dutta)
1
789
Fi
gu
re
3(a
)
.
R
a
nd
om
ness am
ong
t
h
e
successi
ve r
o
w
wi
se
key
s
fo
r t
h
e e
xpe
ri
m
e
nt
2
Fi
gu
re
3(
b
)
. R
a
nd
om
ness am
ong
t
h
e
successi
ve c
o
l
u
m
n
wi
se
key
s
f
o
r t
h
e e
xpe
ri
m
e
nt
2
Ex
peri
m
e
nt
3:
The f
o
l
l
o
wi
n
g
dat
a
set
i
s
co
ns
i
d
ere
d
f
o
r t
h
i
s
expe
ri
m
e
nt
and t
h
e
ge
nerat
e
d g
r
a
phs
are
sho
w
n i
n
Fi
gu
r
e
4
(
a)
an
d
4(
b
)
. “
Fo
rwa
r
d
erro
r co
rrection
i
s
th
e
p
r
o
cess in
w
h
ich
t
h
e receiver tries to
g
e
t th
e
mess
age
by
using re
dundant
bits where
as in
retrans
mi
ssion receiver asks t
h
e se
nder to re
send the
mes
s
age
”.
Fi
gu
re
4(a
)
.
R
a
nd
om
ness am
ong
t
h
e
successi
ve r
o
w
wi
se
key
s
fo
r t
h
e e
xpe
ri
m
e
nt
3
Fi
gu
re
4(
b
)
. R
a
nd
om
ness am
ong
t
h
e
successi
ve c
o
l
u
m
n
wi
se
key
s
f
o
r t
h
e e
xpe
ri
m
e
nt
3
5.
CO
MP
ARI
S
O
N
To j
u
st
i
f
y
o
u
r
pro
p
o
se
d sch
e
m
e
and t
o
sh
ow t
h
e e
ffect
i
v
ene
ss, we
ha
ve com
p
ared
ou
r p
r
o
p
o
se
d
sch
e
m
e
with
so
m
e
ex
istin
g sch
e
m
e
s [1
1
]
,[1
5
]
.
Un
like
th
e prev
i
o
us sch
e
m
e
s, o
u
r sch
e
m
e
en
cryp
ts th
e
m
e
ssages i
n
ro
w an
d c
o
l
u
m
n
wi
se an
d
key
s
are al
so
ge
ner
a
t
e
d res
p
ect
i
v
e
l
y
for eac
h
bl
o
c
k
of
pl
ai
n t
e
x
t
. A
s
t
h
e pl
ai
nt
ext
h
a
s bee
n
a
rra
n
g
e
d i
n
r
o
w
wi
se
an
d
fo
r e
v
e
r
y
ro
w a
ne
w
key
i
s
al
so
use
d
t
o
ge
nerat
e
he
nc
e, we
have t
a
ken
ro
w wi
se a
u
t
o
ke
y
s
onl
y
fo
r t
h
e
com
p
ari
s
on
p
u
r
p
ose.
Al
l
t
h
e t
h
ree ex
pe
ri
m
e
nt
s fr
om
t
h
e previ
o
u
s
sect
i
on are t
a
k
e
n f
o
r
o
u
r c
o
m
p
ari
s
on;
st
an
dar
d
devi
a
tion (Figure
5(a))
and t
h
e ave
r
a
g
e random
n
ess (Figure
5(b)) are use
d
as the pa
ram
e
ters whe
r
e thes
e are calcula
t
e
d as
descri
bed
i
n
t
h
e c
o
m
p
ared sc
hem
e
s. In
Fi
gu
re
5(a
)
a
n
d
5
(
b),
x-a
x
i
s
rep
r
ese
n
t
s
t
h
e
l
i
s
t
of
expe
ri
m
e
nt
s. I
n
Fi
gu
re
5(a
)
,
y
-
axi
s
re
prese
n
t
s
st
an
da
rd
d
e
vi
at
i
o
n
w
h
er
eas i
n
5
(
b)
, it r
e
pr
esen
ts
av
er
ag
e
r
a
ndom
n
e
ss.
Fi
gu
re 5(a
)
.
St
anda
r
d
Devi
at
i
o
n
com
p
ari
s
o
n
am
ong
t
h
e
sch
e
m
e
s
Fi
gu
re 5(
b
)
. A
v
era
g
e
R
a
nd
o
m
ness
com
p
ari
s
on
am
ong
t
h
e
sch
e
m
e
s
Successive Key Pa
irs
Successive Key Pa
irs
R
andomness
R
andomness
Successive Key Pa
irs
Successive Key Pa
irs
R
andomness
R
andomness
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 4
,
Au
gu
st 2
016
:
17
85
–
1
791
1
790
6.
CO
NCL
USI
O
N
In t
h
i
s
pa
per
,
we ha
ve co
nt
ri
but
e
d
a new di
m
e
nsi
on t
o
i
n
f
o
rm
at
i
on secur
i
t
y
where t
h
e securi
t
y
i
s
not
o
n
l
y enh
a
n
c
ed b
u
t
also
d
e
fined
th
e
reliab
ility an
d
in
cr
eased
th
e t
h
ro
ugh
pu
t of shared
inform
at
io
n
b
y
ad
d
i
ng
error control mechanism
as
we
ll. In t
h
e
previous section, a com
p
aris
on is also
m
a
d
e
with
a set of ex
istin
g
schem
e
s t
o
pr
ove
t
h
e e
x
cel
l
e
nce
of t
h
e
pr
op
ose
d
sc
hem
e
. Fr
om
Fi
gur
e 5(a
)
a
n
d
5
(
b)
, i
t
i
s
cl
eare
d
t
h
a
t
random
n
ess am
ong the auto gene
rated
keys is far better th
an that of standard AVK
but little bit weaker tha
n
th
e o
t
h
e
r on
e. As th
e sch
e
me is b
a
sed
on
two
i
n
itia
l
k
e
ys rath
er than
a sin
g
l
e
on
e th
erefo
r
e,
ap
p
l
ying
ci
phe
rt
ext
onl
y
at
t
ack t
o
fi
nd
t
h
e
key
s
i
s
not
feasi
b
l
e
i
n
l
i
n
ear
pol
y
n
o
m
i
al t
i
m
e
. Hence
,
t
h
e
pr
o
pose
d
sc
hem
e
i
s
far
bet
t
e
r
an
d s
h
o
u
l
d
be m
u
ch
pre
f
era
b
l
e
t
h
an ex
isting
ones fo
r real
worl
d
ap
p
lication
s
.
REFERE
NC
ES
[1]
S. K. Chakrabo
rty
,
et al.
, “Inv
estigation of Two New Protocols of
Aggressive Packet Combining Scheme
in
Achieving
Better Throughput,”
J
ournal of
the
Institut
i
on of
Eng
i
n
eers
, vol/issue: 9
6
(2), pp
. 141-14
5, 2014
.
[2]
S. K. Ch
akraborty
,
et al.
, “Studies of sever
a
l n
e
w
modi
fications of
Aggressive Packet Combining
to ach
ieve high
er
throughput, b
a
sed on correction
capabilit
y
of d
i
sjo
i
nt error v
ectors
,
”
Journal of
the
Institution o
f
E
ngineers
, pp. 1-
4, DOI 10.1007
/s40031-014-0162-4.
[3]
L. L
a
m
port, “
P
as
s
w
ord authent
i
ca
tion with
ins
ecure
com
m
unicat
ion,”
Commu
nication o
f
th
e
ACM
, vol/issue:
24(11), pp
. 770-
772, 1981
.
[4]
M. S. Hwang
an
d L. H.
Li, “A
new rem
o
te us
er
auth
enti
cat
i
on s
c
heme using smart
cards,”
IEEE Transaction on
Consumer Electronics
, vo
l/issue:
46(1), pp
. 28-30
, 2000.
[5]
C. W. Lin,
et a
l
.
, “A new strong password au
thentication sc
h
e
me using one-way
Hash functions,”
Journal of
Computer and S
y
stems Sciences
International
, vo
l/issue: 45
(4), pp
. 623-626
, 2006
.
[6]
M.
Az
iz
i,
et al.
,
“Cry
p
t
an
aly
s
is and Improvement of the
Zhu et al.'s Authentication
Protocol,”
International Journa
l
of Informatics a
nd Communication Technolog
y
,
vol/issue:
2(2), p
p
. 99-105
, 2013
.
[7]
S.
Ba
ne
rje
e
,
et al.
,
“
C
r
y
pt
anal
ys
is
and S
ecuri
t
y
Enhanc
em
ent
of an Eff
i
ci
ent
and S
ecur
e
D
y
nam
i
c ID Bas
e
d
Rem
o
te User Authenti
ca
tion Sc
hem
e
for Multi-Server Environ
m
ents,” in
Proceedings of the 2
015 Internation
a
l
Conference on Advanced
Research in Computer
S
c
ien
ce
Engineering
&
Technology (
I
CARCSET 2
015)
, March 6-7;
Eluru, India, 201
5.
doi>10.1145
/2743065.274307
9.
[8]
S
.
Banerj
ee,
et al.
, “
A
n Im
proved Sm
art Card based Anon
ym
ous
Multi-Ser
v
er Rem
o
te User Authenti
ca
tio
n
Scheme,”
Intern
ation Journal
of Smart
Home
, vol/issue: 9(5)
, pp
.
11-22, 2015
.
[9]
K. C. Baruah,
et al.
, “
A
n Im
proved Biom
etric-
based Multi server
Authenti
cat
i
on Schem
e
using Sm
art Card,”
International Jo
urnal of S
ecurity and Its
Application
, vo
l/issue: 9(
1), pp
. 397-408
,
2015.
[10]
R. Parim
a
l
a
and
C. Ja
ya
kum
ar,
“
P
roviding Authenti
cat
ion b
y
Us
ing Biom
etr
i
c
Multim
odal Fra
m
ework for Clo
ud
Computing,”
Ind
onesian Journal
of El
ec
trical
En
gineering
, vol/is
sue: 15(3), pp
. 5
91-596, 2015
.
[11]
C. T. Bhun
ia
, “
N
ew approach
es
for s
e
lec
tiv
e aes
towards
tack
lin
g error propag
a
ti
on effec
t
of AE
S
,
”
Asian Journ
a
l
of Information
Technolog
y
, vol/issue: 5(9), pp. 1
017-1022, 2006
.
[12]
C. T. Bhunia, “Application of
AVK a
nd selective encr
y
p
tion in
improving pe
rformance of quantum cr
y
p
togr
ap
h
y
and networks,”
h
ttp://www
.Ictp.it/~pub_off, IC/20
06/045
.
[13]
C. T. Bhunia,
et al.
, “Theor
y
an
d application of
time varian
t key
in
RS
A and t
h
at with s
e
l
ect
i
v
e encr
yp
tion in
AES,
” in
Proceedings of
EAIT
(
E
lsevi
er Publ
icat
i
ons, Calcu
tta
CSI)
, pp. 219-221
,
2006.
[14]
P
.
Chakarabar
ti
,
et al.
, “A novel approach towards r
ealizing optimum data
transfer and automatic variable k
e
y
(AVK) in cry
p
tography
,
”
Intern
ational Journal of
Comput
er Science and
Netwo
r
k Security
, vo
l/issue: 8(5), pp
.
241-250, 2008
.
[15]
C. T. Bhunia,
et al.
,
“A new technique (CSAVK) of automatic vari
able key
in achievi
ng perfect security
,”
100th
Indian Science
Congress Association
, 2013.
[16]
R. S. Goswa
m
i,
et al.
, “New techniques for generating
of autom
a
tic vari
able k
e
y
in
achiev
ing perfect security
,
”
Journal of
the
In
stitution
of
Engi
neers (
I
ndia)
: Series B,
vol/issue: 95(3), pp. 197-2
01, 2014
.
[17]
R. S. Goswa
m
i,
et al.
, “
N
ew approaches
towards
genera
tion of au
tom
a
tic var
i
abl
e
ke
y
to a
c
hiev
e perfec
t
s
ecuri
t
y
,
”
in
Proceed
ings of the 10th Intern
ational Conferen
ce
on Information Technology, I
EEE Computer Socie
ty
, pp
. 489-
491, 2013
.
[18]
R. S. Goswami,
et al.
, “Generation of automatic
variab
le key
un
der
various
appr
oaches
in cr
yp
to
graph
y
s
y
s
t
em
,
”
Journal of
the
In
stitution
of
Engi
neers (
I
ndia)
: Series B
, vol/issue: 94(4), pp. 215-2
20, 2014
.
[19]
R. S. Goswa
m
i,
et al.
, “Various new methods
o
f
implementing AVK,” In
Proceedings of the 2
nd International
Conference Advanced Comput
er Science and
En
gineering
, pp
. 1
49-152, 2013
.
[20]
S.
Ba
ne
rjee
,
et al.
, “A novel approach to achieve the perfect s
ecurity
through
avk over insecu
re communication
channe
l,
”
Journ
a
l of the Institution of
Engineers (
I
ndia
)
:
Series
B
(Com
m
unicated
).
[21]
S.
Ba
ne
rje
e
,
et a
l
.
,
“A New three dimens
ional based key
genera
tion technique in
AVK,
”
Journal of the Institutio
n
of Eng
i
neers (
I
ndia)
: Series B
(C
om
m
unicated).
[22]
B. K. Singh,
et al.
, “
G
ener
ation
of autom
a
tic v
a
r
i
abl
e
ke
y
to m
a
ke s
ecure com
m
unica
tion,
” in
P
r
oceedings
of th
e
International Co
nference on Recent Cognizance
Wi
reless Communication
&
I
m
a
g
e Processing (
I
CRCWIP-2014)
,
2015.
[23]
M. P. Dutta
,
et al.
,
“
T
wo new s
c
hem
e
s
to gen
e
r
a
te
autom
a
t
i
c v
a
riabl
e
ke
y (
a
vk)
to ach
iev
e
th
e p
e
rfec
t
s
ecur
i
t
y
i
n
ins
ecure
com
m
unica
tion ch
ann
e
l,
” in
Pro
ceed
i
ngs of the Int
e
rnational C
onfe
r
ence on Ad
van
ced R
e
search i
n
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Two W
a
y
Mec
hanism to Enhance
Co
nfide
n
tiality and Acc
u
racy
of
Shar
e
d
.... (Manas
h Pr
atim
Dutta)
1
791
Computer Science Engin
eerin
g
&
Technology (
I
CARCSET 2015)
,
March 6-7; Eluru, India, 2015. D
O
I=
http://dx.doi.org/10.1145/274306
5.2743080.
[24]
M.
P.
Dutta
,
et al.
, “An Approach to Generate
2-
Dimensional
AVK to Enhance Securi
ty
of Shared Information,”
International Jo
urnal of S
ecurity and Its
Applications
, vol/issue: 9
(
10), pp
. 147-15
4, 2015
.
[25]
A. P. Singh and S. Ku
mar, “A
New Method fo
r Generation of
Vari
able Session Key
s
,”
International Journal
of
Scien
tifi
c Resear
ch
and Educa
tio
n
, vol/issue: 2(8)
, pp
. 1578-1581
, 2014.
[26]
S.
Pra
j
a
p
at,
et al.
, “
A
Novel Approach for Inform
ation S
ecur
i
t
y
w
ith Autom
a
tic V
a
riab
le Ke
y us
in
g F
i
bonacci Q-
Matrix,
”
In
terna
tional
Journal o
f
Com
puter
&
Co
mmunication Technology
, vo
l/issue: 3(3)
, pp
. 54-
57, 2012
.
BIOGRAP
HI
ES OF
AUTH
ORS
Manash Pratim
Dutta,
he
is an
Assistent Profe
s
s
o
r in th
e Dep
a
r
t
m
e
nt of Com
p
u
t
er S
c
ienc
e
and
Engine
ering in
Nationa
l Institut
e
of Techno
log
y
, Aruna
cha
l
Pradesh. He is cur
r
entl
y working
towards his Ph.
D. degree in the field of cr
y
p
t
ograph
y
and in
formation security
at the same
Institute
.
Subhasish Baner
j
ee, he receiv
e
d
his M.Tech deg
r
ee
in Computer
Application fro
m Indian School
of Mines, Dhan
bad, Ind
i
a
in 2
012. Curr
ently
he is p
e
rsuing
his Ph.D and
also working as
Assistent Professor in th
e Depa
rt
m
e
nt of Com
put
er Sci
e
nce
and
E
ngineer
ing in
Na
tional
Institu
te
of Techno
log
y
,
Arunachal P
r
ad
e
s
h. His
res
earch
act
ivit
ies
ar
e m
a
inl
y
fo
cus
e
d on
cr
yptograp
h
y
and information
security
.
Dr. Swarnendu
Kumar Chakrab
o
rty
,
h
e
receiv
e
d hi
s Ph. D. d
e
gree from Natio
n
al Institute of
Techno
log
y
, Arunacha
l
P
r
ades
h. Currentl
y
, h
e
is
an As
s
i
s
t
ant
P
r
ofes
s
o
r as
well as
Head of
Com
puter S
c
ien
ce & Engin
eeri
ng Departm
e
nt,
NIT Arunachal
P
r
ades
h. His
res
earch in
ter
e
s
t
includ
es Networ
king, Network S
ecurity
, Cr
y
p
tog
r
aph
y
.
Prof. Chandan
Tilak
Bhunia did his B. Tech
.
in Radio ph
y
s
ics and Electronics in 1983 from
Calcutta Univ
ers
i
ty
. He receiv
e
d
his M. Tech.
in
Radio ph
y
s
ics
and Electronics in
1985 and th
en
joined North Bengal University
as a lectur
er of
Computer Science & Applicatio
ns in 1988. He
becam
e Assistant Professor of
ECE at NERI
ST,
Govt. of India in 1990. H
e
got P. hd. in
Com
puter Scien
ce &
Engin
eerin
g from
Jadavpur Universit
y
. He
becam
e
a ful
l
Professor in 1997
at NERIST. Cu
rrently
, he is
working as a
Di
rector
of National Institute
of Technolog
y
,
Arunachal Prad
esh. He h
a
s pu
blished around
150
resear
ch p
a
pers in
variou
s national
and
intern
atio
l journ
a
ls of repute. Under his supervis
ion, five P. hd. scholar
s got awarded and nin
e
scholars ar
e
curr
ently
work
ing in
various f
i
elds.
Evaluation Warning : The document was created with Spire.PDF for Python.