Indonesi
an
Journa
l
of El
ect
ri
cal Engineer
ing
an
d
Comp
ut
er
Scie
nce
Vo
l.
12
,
No.
3
,
Decem
ber
201
8
, p
p.
1297
~
1304
IS
S
N: 25
02
-
4752, DO
I: 10
.11
591/ijeecs
.v1
2
.i
3
.pp
1297
-
1304
1297
Journ
al h
om
e
page
:
http:
//
ia
es
core.c
om/j
ourn
als/i
ndex.
ph
p/ij
eecs
Preser
vin
g A
uth
enticit
y and Inte
gr
it
y
of
Distribu
ted Net
works
throu
gh No
ve
l
Mess
age A
uth
entication
Co
de
Gurpree
t
K
our So
dhi
1
, Gurj
ot Singh
Ga
b
a
2
, Lavish
Kan
sa
l
3
, Edu
ard
Babula
k
4
,
M
ohamme
d
AlZ
ain
5
,
Sa
n
deep
Kum
ar Aror
a
6
,
M
e
hedi M
asud
7
1,2,3,6
School
of E
le
c
troni
cs
and El
ec
tr
ic
a
l Engg., L
ovely
Profess
ion
al
Univ
ersity
,
Jal
andha
r
,
Indi
a
–
1
44411
4
Zi
gura
t
School
of
Business a
nd
Te
chno
log
y
Inn
ovat
ion
,
Spain
-
08018
4
Nati
ona
l
Sci
ence
Foundat
ion, Washington, D.
C.
,
US
A
–
22314
5
Depa
rtment of I
nform
at
ion
T
ec
h
nolog
y
T
ai
f
Uni
ver
sit
y
,
Saudi
Arabi
a
–
21974
7
Depa
rtment of
Com
pute
r
Scie
n
ce
,
T
ai
f
Univer
si
t
y
,
Saud
i
Arab
ia
–
21974
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
A
ug
2
8
, 201
8
Re
vised
Oct
15
, 2
018
Accepte
d
Oct
29
, 201
8
In
thi
s
era
of
unive
rsal
e
lectr
on
ic
connect
iv
ity
,
comm
unic
at
ion
is
no
m
ore
conf
ine
d
to
tra
ns
fer
of
dat
a
from
one
end
to
the
othe
r;
rat
h
er
it
ai
m
s
at
sec
ur
e
dat
a
tra
nsfer
.
C
om
m
unic
at
ion
sec
tor
h
as
dev
eloped
be
y
on
d
this
tra
ditiona
l
boundar
y
of
da
t
a
tra
nsfer
and
is
now
working
o
n
wa
y
s
to
provi
de
dat
a
from
the
intended
s
ende
rs
to
the
int
end
ed
recei
v
ers
in
an
unalter
ed
form
.
Consideri
ng
al
l
the
se
cond
it
io
ns,
the
da
ta
tr
ansfe
r
ne
eds
to
foll
ow
th
e
princ
iples
of
au
the
nti
cation,
co
nfide
ntial
ity
and
integrity
.
The
form
er
two
have
be
en
add
ressed
using
di
git
al
signat
ur
es
and
en
cr
y
pti
o
n
sche
m
es
respe
ctively
,
while
th
e
soluti
on
to
the
la
t
e
r
is
the
use
of
Mess
age
Authent
i
ca
t
ion
Code.
Th
is
pap
er
pre
sents
a
Mess
age
Authenti
ca
t
ion
Code
sche
m
e,
which
uses
the
b
i
ologi
c
al
cha
ra
ct
er
isti
cs
r
epr
e
sente
d
b
y
Deox
y
ribon
uclei
c
ac
id
combine
d
with
the
output
of
Blum
B
lum
Shub
Random
Nu
m
b
er
Gene
rat
o
r,
a
s
a
sec
ret
ke
y
al
ong
with
a
novel
hash
al
gorit
hm
.
Thi
s
Mess
age
Authen
ti
c
at
ion
Cod
e
st
ruc
ture
is
ev
al
u
at
ed
on
th
e
basis
of
Nati
on
a
l
Instit
ut
e
of
Sc
i
enc
e
and
T
ec
hn
olog
y
te
st
sui
te
for
ran
dom
num
ber
s,
ava
la
n
che
criter
i
a
and
net
work
at
t
ac
ks.
The
result
s
rev
ea
l
th
at
the
proposed
sche
m
e
per
form
s
well
under
al
l
th
e
criter
i
a
and
thus
is
ca
pable
of
pre
servin
g
integ
rity
;
thi
s
inc
r
eas
es
it
s
appl
ic
ab
il
ity
in
an
y
da
t
a
sensiti
ve
envi
ronm
ent
.
Ke
yw
or
ds:
Bl
um
b
lu
m
sh
ub r
a
ndom
nu
m
ber
ge
ner
a
tor
DNA
Hash
In
te
gr
it
y
Me
ssage A
uthe
ntica
ti
on
C
ode
Copyright
©
201
8
Instit
ut
e
o
f Ad
vanc
ed
Engi
n
ee
r
ing
and
S
cienc
e
.
Al
l
rights re
serv
ed.
Corres
pond
in
g
Aut
h
or
:
Sandeep
Kum
a
r
A
r
or
a
,
School
of
Ele
c
tro
nics and
Ele
ct
rical
Eng
g
.,
Lo
vely
Prof
es
s
ion
al
Un
i
ver
sit
y,
Jal
andhar,
Indi
a
–
1444
11
.
Em
a
il
: sand
eep
.1693
0@
l
pu.c
o.
in
1.
INTROD
U
CTION
On
e
form
of
Com
m
un
ic
at
io
ns
sec
ur
it
y
is
pr
e
ve
nting
una
uthorize
d
inter
cepto
rs
f
ro
m
a
ccessi
ng
th
e
data
wh
il
e
bei
ng
tra
ns
fe
rr
e
d
to
t
he
i
nten
de
d
receive
rs.
W
it
h
t
he
a
dva
ncem
ents
in
t
he
fiel
d
of
el
e
ct
roni
c
com
m
erce,
the
data
bein
g
t
ra
ns
fe
rr
e
d
over
Netw
orks
sho
ul
d
be
kep
t
c
onf
identia
l
an
d
re
qu
i
re
to
b
e
pr
e
ven
te
d
from
any
un
a
ut
horized
acce
ss
or
m
od
ific
at
io
n
[
1].
T
hus,
da
ta
integrity
is
the
ne
ed
of
the
hour
w
he
n
it
com
es
to
the
pr
e
sent
form
of
com
mu
nicat
io
n.
Eac
h
bit
of
in
f
orm
at
ion
carries
a
certai
n
valu
e
wh
ic
h
nee
ds
to
be
retai
ned an
d
a
ny
m
od
ific
at
ion
b
y t
he
i
ntr
ud
e
r c
an
le
ad
to
d
is
ast
ers
[
1].
Var
i
ou
s
m
et
ho
ds
ha
ve
bee
n
app
li
ed
to
a
uth
e
ntica
te
data
in
the
past.
A
dat
a
authen
ti
cat
io
n
schem
e
is
pro
po
se
d
wh
ic
h
hel
ps
in
pr
i
va
cy
pr
ese
rv
at
i
on
a
nd
is
base
d
on
e
ncr
y
ptio
n
sc
hem
e,
‘p
se
udonym
te
chnolo
gy’
and
Me
ssa
ge
Au
t
hen
ti
cat
io
n
Co
de
[
1].
A
uth
entic
at
io
n
re
f
ers
to
co
nfi
rm
at
ion
,
t
hat
the
data
ha
s
been
r
ecei
ved
from
the
pr
oje
ct
ed
sen
der
an
d
this
is
us
ual
ly
ver
ifie
d
us
i
ng
sec
ret
keys
wh
ic
h
are
known
to
ei
ther
ends
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1297
–
1304
1298
on
ly
[
2].
T
his
erad
ic
at
es
t
he
cha
nce
of
dat
a
bein
g
rec
ei
ve
d
f
r
om
an
ad
visory
since
t
he
key
has
no
t
been
sh
are
d
to
a
nyone.
Bi
om
et
rics
serv
e
s
the
bes
t
purpose
wh
e
n
it
com
es
to
authe
ntica
ti
on
;
it
inv
ol
ves
the
us
e
of
char
act
e
risti
c
featur
e
s
of
the
us
e
r
w
hic
h
are
un
i
qu
e
fo
r
a
n
in
di
vidual
an
d
cannot
be
rep
l
ic
at
ed.
So
fia
et
al
.
in
[
3],
pointed
out
to
that
featur
e
of
hu
m
an
body
wh
ic
h
can
be
us
e
d
as
the
aut
hen
ti
cat
io
n
ide
ntit
y.
The
aut
hen
ti
ca
ti
on
proce
ss
is
carried
out
by
us
in
g
this
uniq
ue
featu
re
as
a
key
to
de
velo
p
a
secur
e
syst
e
m
[4
]
.
A
m
ulti
bio
m
et
ric
us
er
aut
hen
t
ic
at
io
n
schem
e
is
pr
op
os
e
d
by
K
oong
et
al
.
[5
]
w
hich
util
iz
e
both
the
ph
ysi
ologica
l
and
behavi
or
al
bio
m
et
rics.
Fing
e
r
m
ov
e
m
e
nts
on
m
ulti
t
ou
c
h
de
vices
are
us
e
d
f
or
s
ecur
it
y
le
vel.
I
n
ad
diti
on
to
t
his,
th
e
us
er
c
red
e
nt
ia
l
is
m
ade
re
placea
ble
to
preve
nt
any
pri
vacy
le
akag
e
.
Dilli
and
Cha
ndra
[
6]
present
a
no
ther
sc
hem
e
i
nvolv
i
ng
the
us
e
of
HM
AC
SHA
256
Al
gorithm
fo
r
m
essage
authe
ntica
ti
on
and
data
inte
gri
ty
[6
]
.
Ve
rm
a
and
Pr
a
j
a
pati
[7
]
present
a
novel
S
HA
w
hich
e
xecu
te
s
in
le
ss
execu
ti
on ti
m
e
and
possesses
higher
b
it
diff
e
ren
ce
, th
is c
an
be
im
planted
s
o
as
to
i
ncr
ease
the sec
ur
it
y.
In
this
pa
per,
a
schem
e
has
be
en
presente
d
to
design,
MAC
(Message A
ut
he
ntica
ti
on
Co
de
)
wh
ic
h
is
us
e
d
to
ver
i
fy
the
integrity
of
a
m
essage.
It
assures
that
the
data
receive
d
is
un
al
te
re
d
and
no
t
m
od
ifie
d
by
any
m
eans.
As
obser
ved
f
ro
m
Eq
uation
1,
MAC
us
e
s
a
secr
et
key
&
ha
sh
al
gorithm
and
ta
kes
the
m
essage
a
s
input
to
produ
ce
a
ta
g,
al
so
known
as
cry
pt
ographic
chec
ks
um
.
This
ta
g
is
app
e
nd
e
d
to
the
m
essage
and
com
par
ed
at
the
receiv
er
en
d
to
con
cl
ud
e
if
the
m
essage
is
in
it
s
or
iginal
form
.
Her
e
the
assum
ption
is
that
the secret
key i
s sh
a
re
d betwe
en
the
se
nd
i
ng
and the
receivi
ng p
a
rty
only
.
=
(
,
)
(1)
Wh
e
re,
C
is
t
he
MAC
f
un
c
ti
on
,
K
is
the
s
ecret
k
ey
,
M
is
the
m
essage
i
nput
,
M
AC
is
the
m
essage
a
uth
e
ntica
ti
on
c
od
e
[8].
The
sec
ret
key
to
be
use
d
in
t
he
pr
ese
nted
s
chem
e
is
gen
er
at
ed
us
i
ng
D
N
A
(
De
ox
y
rib
onuclei
c
aci
d)
wh
ic
h
is
pr
e
se
nt
in
li
vi
ng
be
ing
s
an
d
is
uniqu
e
to
e
ve
ry
ind
i
vidual.
T
hu
s,
D
N
A
ca
n
be
eff
ic
ie
ntly
use
d
for
authe
n
ti
cat
ion
pro
vision.
Fu
rt
her,
to
in
crease
the
str
eng
t
h
of
the
al
gorithm
B
B
SG
(Blum
Blu
m
Sh
ub
Ra
ndom
Nu
m
ber
Gen
e
rato
r)
has
been
us
e
d
t
o
furthe
r
inc
reas
e
the
com
plex
it
y
of
the
al
go
rithm
.
This
ge
ner
at
or
ta
kes
a
seed
value
as
the
in
pu
t
an
d
pro
duc
es
a
ran
dom
se
q
ue
nce
as
the
ou
t
pu
t. Ap
a
rt
f
ro
m
the
secret
key,
a
hash
al
gorithm
has
al
so
bee
n
us
e
d
in
MAC
desig
ning.
T
hi
s
novel
ha
sh
al
gorithm
is
a
resu
lt
of
t
he
inte
gr
at
io
n
of
‘f’
f
un
ct
io
n
in
the
e
xisti
ng
SHA
-
160
al
gorithm
.
The
pro
po
s
ed
w
ork
ha
s
bee
n
e
xp
la
in
ed
with
the
hel
p
of
a
flo
w
c
ha
rt
in
Figure
1.
The
detai
le
d descri
ption i
s
pr
ese
nt
in
Sect
io
n 2 f
ol
lowed b
y
res
ul
ts i
n
Sect
io
n 3
.
Figure
1. MAC
G
e
ner
at
io
n Pr
ocess
2.
RESEA
R
CH MET
HO
D
Data
integ
rity
is
m
ai
ntained
us
in
g
MAC
w
hich
c
onsti
tutes
of
a
m
essage
input,
a
secre
t
key
and
a
has
h
al
gorithm
.
The
pro
pose
d
schem
e
us
es
a
novel
has
h
al
gorithm
wh
ic
h
f
ollows
the
basi
c
structu
re
of
S
HA
-
160,
to
en
ha
nc
e
it
s
s
treng
t
h
an
‘f’
functi
on
has
bee
n
i
nteg
rated
al
ong
wi
th
a
secret
key
wh
ic
h
is
pro
duced
us
in
g
D
NA
se
qu
e
nce
an
d
B
BSG
pro
duced
rando
m
sequ
e
nce.
T
he
pro
posed
MAC
sche
m
e
is
co
m
patib
le
with
the
existi
ng
se
cur
it
y
pa
rad
i
gm
s
and
does
not
ad
d
a
ny
m
or
e
com
plexity
.
The
e
xisti
ng
s
yst
e
m
s
can
repl
ace
the
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Preservin
g
A
u
t
h
entici
ty a
nd Integrity
o
f Dist
ribu
te
d
Net
wor
ks thr
o
ug
h
… (
Gu
r
pr
eet
K
our
Sodhi
)
1299
tradit
ion
al
versi
on
s
of
M
A
C
with
the
ne
w
pro
pose
d
MAC.
The
de
ta
il
ed
structu
r
e
is
exp
la
ine
d
in
the
fo
ll
owin
g
s
ubs
ect
ion
s.
2.1.
N
ovel
H
as
h
Algori
th
m
The
novel
ha
s
h
al
gorithm
use
d
in
t
he
pr
opos
e
d
al
gorith
m
is
a
resu
lt
of
t
he
inc
orp
orat
ion
of
‘
f’
functi
on
in
t
he
basic
str
uctu
r
e
of
S
HA
-
16
0.
The
SHA
-
160
al
gorithm
const
it
utes
of
t
otal
80
r
ounds
a
nd
f
or
ever
y
20
rou
nds
a
co
ns
ta
nt
‘K’
is
us
e
d
a
s
in
pu
t.
T
her
e
are
f
our
‘K’
value
s,
eac
h
of
w
hich
is
8
dig
it
hex
a
decim
al
values.
T
he
m
essage
dig
est
(M
D)
pro
duced
is
of
16
0
bi
ts.
T
he
‘
f’
f
unct
ion
co
ns
ti
tutes
of
three
op
e
rati
ons;
Ex
pansi
on
(E
XP
)
,
Substi
tuti
on
us
in
g
S
-
box
(S)
an
d
m
od
ulo
2
48
ad
diti
on
(+
)
ap
plied
on
th
e
five
reg
ist
er
v
al
ues (A, B, C,
D, E
)
[4].
T
he
str
uct
ur
e
of the
h
a
sh al
gorithm
is exp
la
ine
d usi
ng
Figure
2.
Figure
2. A
No
vel H
a
sh Al
gor
it
h
m
2.2.
D
NA
-
BB
SG
Based
Secret
Key
The
novel
has
h
al
go
rithm
is
app
li
ed
on
the
m
essage
in
pu
ts
al
ong
with
t
he
secret
key.
T
he
secret
key
us
e
d
in
t
he
pro
posed
sche
m
e
is
fr
am
ed
us
in
g
th
e
D
NA
w
hich
re
pr
ese
nted
in
t
he
f
orm
of
a
seq
uen
c
e
com
pr
isi
ng
o
f
‘ag
ct
’
c
har
act
e
rs
f
ollow
i
ng
a u
ni
qu
e p
at
te
rn
f
or
eve
ry
ind
iv
idu
al
.
T
he
cha
r
act
erist
ic
un
iq
uen
e
ss
of a
DNA
se
qu
ence m
akes it i
m
po
ssible t
o b
e re
plica
te
d
or
stolen
[8
]
.
To
stre
ngthe
n
t
he
sec
ur
it
y,
B
BSG
is
us
ed
t
o
pro
du
ce
a
n
ou
tpu
t
ra
ndom
sequ
e
nce
w
hich
i
s
the
res
ult
of
the
sec
ret
seed
val
ue
giv
e
n
to
the
ra
ndom
nu
m
ber
generator
.
The
D
NA
se
quence
is
conver
te
d
into
it
s
bin
a
ry
fo
rm
and
exclusi
ve
-
or
op
e
rati
on
is
app
li
ed
in
betwe
en
D
NA
an
d
BB
SG
seq
uence.
This
res
ults
into
a
256
-
bit
key,
w
hich
is
fur
t
her
us
e
d
in
the
for
m
at
ion
of MA
C [9
]
.
2.3.
Form
ati
on o
f MA
C
MAC
is
al
so
known
as
ke
ye
d
Has
h
du
e
to
it
s
com
posit
ion
ha
ving
a
secret
key
and
a
ha
s
h
al
gorithm
[1
0].
The
DNA
-
BB
SG
key
is
of
256
bits
an
d
t
his
key
has
to
be
furthe
r
s
plit
into
f
our
32
-
bit
ke
ys
in
o
r
der
t
o
be
us
e
d
f
or
M
AC,
th
eref
or
e
var
i
ous
op
e
rati
ons
are
app
li
ed
on
the
256
-
bit
key
in
order
t
o
c
onve
rt
it
into
f
our
32
-
bi
t
keys.
T
he
var
i
ou
s
ap
plied
op
e
rati
ons
a
re
ex
plaine
d
t
hro
ugh
ps
e
udocode
a
nd
gr
a
ph
ic
al
represe
ntati
on
for bet
te
r unde
rstan
ding.
1)
Apply
6
-
bit
ci
rcu
la
r
s
hift
on
the
25
6
-
bit
DNA
-
BB
S
G
key
f
our
tim
es
and
store
the
se
que
nce
eve
ry
tim
e
it
’s
sh
ifte
d.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1297
–
1304
1300
2)
The
n
s
plit
the
256 bit
s
hifted key
into
fo
ur
pa
rts of
64
-
bit eac
h.
3)
Apply
Excl
us
ive
-
or
operati
on
on
first
tw
o
par
ts,
f
ollow
e
d
by
re
peati
ng
it
for
the
la
st
tw
o
pa
rts,
resu
lt
in
g
in a se
quence
of
64
-
bits.
4)
Sp
li
t t
he ob
ta
i
ne
d 64
-
bit seq
ue
nce in
t
o
tw
o pa
rts of
32
-
bit eac
h.
5)
Apply E
xclusi
ve
-
or ope
rati
on b
et
wee
n
t
he o
btained
se
qu
e
nc
es.
6)
Convert t
he obt
ai
ned
32
-
bit s
equ
e
nce i
nto h
exad
eci
m
al
f
orm
, f
or
m
ing
the
8
-
bi
t
hex k
ey
.
7)
Re
peat ste
ps 2
to 6 eve
ry ti
m
e
the
key is s
hift
ed by 6
-
bits, th
us
ob
ta
i
ning f
i
nal fo
ur
keys.
A pseud
o
c
ode
g
ivi
ng a
bette
r
d
esc
riptio
n of
the ope
rati
ons
involve
d
is
give
n unde
r.
Y= in
it
ia
l key
of 25
6
-
bits
for
i=
0:
4
//
rep
eat
ing t
he op
e
rati
on
f
our
tim
es
Y(
i)=
circs
hift
(Y
,
6)
//
ci
rcu
la
r
s
hift
of 6
-
bits a
nd st
or
e
the
bit stre
a
m
end
for
i=
0:
3
//
sp
li
tt
ing
the
ke
y i
nto
4 parts
of 64
-
bit eac
h
x(
i+
1,
:)=
Y
(64
*i+1:6
4*(i+
1))
end
for j=1:
4
k(j)
=
~x
or(
x(2
*j
-
1,
:),
x(
2*j
,:)
)
//
Ap
plyi
ng
ex
cl
us
ive
-
or
ope
ra
ti
on
bet
wee
n
co
ns
ecuti
ve
pair
and
the
n
betwee
n
thei
r r
esults f
or
m
ing
on
e
62
-
bit se
quence
.
end
for
i=
0:
3
//
sp
li
tt
ing
the
ke
y i
nto
2 parts
of 32
-
bit eac
h
x(
i+
1,
:)=
Y
(32
*i+1:3
2*(i+
1))
end
for j=1:
2
k(j)
=
~x
or(
x(2
*j
-
1,
:),
x(
2*j
,:)
)
//
Ap
plyi
ng e
xc
lusive
-
or
o
pe
ra
ti
on
end
//
k
rep
re
sents t
he key
//
//
The
f
our key
values
are
c
on
ver
te
d
int
o hexa
decim
al
f
or
m
and the
n use
d
i
n
MAC/
/
A gr
a
phic
al
r
e
pr
ese
ntati
on is
giv
e
n
in
Fig
ure
3
.
Figure
3. Key
Gen
e
rati
on P
rocess
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Preservin
g
A
u
t
h
entici
ty a
nd Integrity
o
f Dist
ribu
te
d
Net
wor
ks thr
o
ug
h
… (
Gu
r
pr
eet
K
our
Sodhi
)
1301
The
final
f
our
keys
a
re
re
presented
in
he
xad
eci
m
al
fo
r
m
as
sh
own
i
n
Ta
ble
1.
T
he
SHA
-
160
al
gorithm
us
es
four
32
-
bit
co
ns
ta
nt
values
[
11
]
w
hic
h
are
rep
la
ce
d
with
the
f
our
keys
wh
ic
h
we
re
f
r
a
m
ed
us
in
g
t
he op
e
ra
ti
on
s.
Th
e
s
of
t
war
e
to
ol MA
TLAB
has bee
n use
d
f
or the
s
i
m
ulati
on
.
Table
1.
Secu
ri
ty
K
ey
s
S.No.
32
-
b
it Key
s
(Hexa
d
eci
m
al)
K
1
CD2
7
4
0
EB
K
2
AF3
4
9
D0
3
K
3
0
EBCD2
7
4
K
4
D0
3
AF3
4
9
This
f
or
m
s
a
novel
MAC
al
gorithm
.
The
M
AC
val
ues
obt
ai
ned
,
us
i
ng
t
he
pro
po
se
d
te
c
hn
i
qu
e
a
re
giv
e
n
in
Ta
ble
2.
Table
2.
M
AC
Values
Inp
u
t
Hex
f
o
r
m
MAC V
alu
es
(H
ex
ad
eci
m
al
)
G
67
d
4
b
e6
3
6
1
4
7
9
e2
7
0
5
9
5
4
f
b
e2
1
6
4
1
c9
2
d
9
a3
7
c6
5
e3
So
d
h
i
6
f
6
4
6
8
6
9
9
ced6
4
e5
2
0
ccf
d
7
4
1
b
8
ed
3
8
3
2
6
e3
3
a6
b
8
8
a6
5
b
5
2
Un
ited
states
7
5
6
e6
9
7
4
6
5
6
4
7
3
7
4
6
1
7
4
6
5
7
3
f
2
9
d
9
0
3
1
3
9
0
5
8
7
0
1
e3
9
e3
ceb1
c1
7
7
6
3
1
6
4
5
4
ef0c
The
com
pu
te
d
MAC
values
are
then
co
nve
rted
into
bi
nary
fo
rm
fo
r
eva
luati
on
on
ra
ndom
ness
an
d
avalanc
he
c
rite
ria.
3.
RESU
LT
S
AND A
N
ALYSIS
The
propose
d
te
chn
iq
ue
is
a
naly
zed
usi
ng
NI
S
T
te
st
su
it
e
of
rand
om
ness
an
d
the
stri
ct
avalanch
e
crit
eria.
These
te
sts
are
per
f
orm
ed
fo
r
th
ree
diff
e
re
nt
input
values
eac
h
ha
ving
a
diff
e
re
nt
le
ng
th.
T
hese
te
sts
com
pu
te
the
P
-
value
f
or
a
bina
ry
seq
uen
ce;
wh
ic
h
m
us
t
be
gr
eat
er
tha
n
0.01
for
a
seq
ue
nce
to
be
c
onsidere
d
as r
a
ndom
[
12]
.
In
or
der
to
vali
date
the
eff
ic
ie
ncy
of
our
pro
po
s
ed
te
ch
niqu
e,
the
NI
S
T
res
ults
of
the
pro
po
se
d
MAC
schem
e
are
com
par
ed
with
tho
s
e
of
t
he
exi
sti
ng
te
ch
niqu
es.
The
ei
ght
di
git
hex
a
decim
al
key
us
ed
f
or
these
HMAC tec
hn
i
qu
e
s is
‘3A
54E2
6B’, w
hich
is k
e
pt c
on
sta
nt for
all
the
sc
hem
es.
A br
ie
f
ove
rv
ie
w of
t
he vari
ous NIST tests
is
giv
e
n
as:
1)
Fr
e
qu
e
ncy T
es
t
Fr
e
qu
e
ncy
te
st
cal
culat
es
the
rati
o
of
the
num
ber
of
on
es
a
nd
zer
os
in
the
entire
sequ
e
nc
e.
It
checks
the adjace
ncy
betwee
n
the
nu
m
ber
o
f o
nes
a
nd the
num
ber
o
f
ze
r
os
. A se
quence
is co
ns
i
de
red
t
o be ran
dom
if
the
rati
o
of
both
is
cl
os
e
to
each
oth
e
r
[
12]
.
T
he
res
ults
in
Ta
ble
3
dep
ic
t
that
t
he
pro
po
se
d
al
gorithm
pro
du
ces
b
et
te
r
proxim
i
ty
b
et
ween t
he
c
ount
of
on
es
and ze
ro
s
as c
om
par
ed
to
o
t
her te
ch
niques.
Table
3
.
NIST
te
st resu
lt
s
for Fre
qu
e
ncy test
MAC
Techn
iq
u
e
P
-
v
a
lues
G
So
d
h
i
u
n
ited
states
HMAC
MD2
0
.37
6
8
0
.37
6
8
0
.47
9
5
HMAC
MD5
0
.85
9
7
0
.59
5
9
0
.85
9
7
HMAC
SHA
-
160
0
.87
4
4
1
.00
0
0
0
.87
4
4
HMAC
SHA
-
256
0
.26
0
6
0
.90
0
5
0
.08
0
1
HMAC
SHA
-
384
0
.22
0
7
0
.12
5
8
0
.30
7
4
HMAC
SHA
-
512
0
.79
0
9
0
.92
9
6
0
.92
9
6
Prop
o
sed
T
echn
iq
u
e
0
.87
7
4
0
.93
8
9
0
.92
1
9
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1297
–
1304
1302
2)
Bi
nar
y
De
rivat
ive Test
The
Bi
nar
y
De
rivati
ve
Test
proceed
s
by
app
l
yi
ng
exclusi
ve
-
or
operati
on
be
tween
al
l
the
consecuti
ve
bits
of
the
se
quence
unti
l
only
on
e
bit
is
le
f
t.
The
n,
the
ra
ti
o
of
the
num
ber
of
on
es
to
the
total
num
ber
of
el
e
m
ents
in
the
sequ
e
nce
is
cal
culat
ed
for
e
ach
case.
Final
ly
,
the
aver
age
of
the
rati
o
f
or
al
l
the
sequ
e
nces
is
cal
culat
ed,
if th
is value lie
s nea
r
to 0.5, then t
he
sequence i
s r
an
do
m
[
12
]
. T
he
res
ults in
Table 4
il
lustra
te
that
the outp
ut
of th
e pro
posed
sc
hem
e is rando
m
.
Table
4
.
NIST
te
st resu
lt
s
for B
inary De
rivat
ive test
MAC
Techn
iq
u
e
P
-
v
alu
es
G
So
d
h
i
u
n
ited
states
HMAC
MD2
0
.49
5
2
0
.51
2
6
0
.50
1
6
HMAC
MD5
0
.51
2
9
0
.49
0
1
0
.51
4
9
HMAC
SHA
-
160
0
.50
6
9
0
.49
2
4
0
.50
2
6
HMAC
SHA
-
256
0
.50
4
6
0
.50
0
7
0
.50
4
0
HMAC
SHA
-
384
0
.50
0
5
0
.49
6
4
0
.49
9
3
HMAC
SHA
-
512
0
.50
2
6
0
.50
3
4
0
.49
8
7
Prop
o
sed
T
echn
iq
u
e
0
.51
6
0
0
.51
3
6
0
.50
9
2
3)
Discrete F
ouri
er T
ran
s
f
or
m
Test (DFT)
The
fo
c
us
of
the
D
FT
te
st
is
to
fin
d
t
he
pea
k
hei
gh
ts
in
the
Discre
te
Four
ie
r
Tra
ns
f
or
m
of
a
seq
uen
ce
.
It
de
te
rm
ines
the
pr
esence
of
sim
il
ar
patte
rn
s
in
the
sequ
e
nce
wh
ic
h
furthe
r
ind
ic
at
es
a
de
viati
on
from
the
exp
e
ct
ed
rand
om
ness.
The
pu
rpo
se
is
to
check
if
m
or
e
than
5%
of
the
pea
ks
excee
d
the
95
%
thres
ho
l
d [12].
The res
ults f
or
DF
T test
a
re su
m
m
arized in
T
able 5.
Table
5.
NIST
te
st
resu
lt
s
for DFT test
MAC
Techn
iq
u
e
P
-
v
alu
es
G
So
d
h
i
u
n
ited
sates
HMAC
MD2
0
.14
4
3
0
.09
4
0
0
.33
0
4
HMAC
MD5
0
.87
1
1
0
.51
6
4
0
.07
4
4
HMAC
SHA
-
160
0
.14
6
8
0
.46
8
2
0
.02
9
5
HMAC
SHA
-
256
0
.42
2
0
0
.42
2
0
0
.13
5
9
HMAC
SHA
-
384
0
.77
8
7
0
.77
8
7
0
.51
2
1
HMAC
SHA
-
512
0
.37
2
3
0
.25
6
1
0
.62
6
5
Prop
o
sed
T
echn
iq
u
e
0
.87
4
0
0
.77
9
8
0
.63
1
8
4)
Appro
xim
at
e E
ntr
op
y Te
st
This
te
st
cal
c
ulate
s
the
fr
e
quency
of
al
l
t
he
overla
pp
i
ng
bit
patte
rn
s
pr
ese
nt
in
the
sequ
e
nce.
It
com
par
es
the
f
reque
ncy
of
overla
pp
i
ng
bloc
ks
of
tw
o
s
ub
seq
uen
t
le
ngth
s
with
the
e
xp
ect
ed
outc
om
e
for
a
rand
om
seq
uence [
12
]
. T
he
r
e
su
lt
s ar
e
g
i
ven
in Ta
ble 6.
Table
6.
NIST
te
st resu
lt
s
for Ap
pro
xim
at
e e
ntr
op
y t
est
MAC
Techn
iq
u
e
P
-
v
alu
es
G
So
d
h
i
u
n
ited
states
HMAC
MD2
0
.74
6
4
0
.77
2
7
0
.73
1
0
HMAC
MD5
0
.45
3
3
0
.89
8
3
0
.88
6
3
HMAC
SHA
-
160
0
.92
8
8
0
.88
3
5
0
.98
8
3
HMAC
SHA
-
256
0
.83
3
0
0
.94
4
0
0
.95
8
7
HMAC
SHA
-
384
0
.98
1
7
0
.98
3
6
0
.98
6
5
HMAC
SHA
-
512
0
.99
4
9
0
.98
9
1
0
.98
5
5
Prop
o
sed
T
echn
iq
u
e
0
.94
0
3
0
.98
8
9
0
.98
7
4
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Preservin
g
A
u
t
h
entici
ty a
nd Integrity
o
f Dist
ribu
te
d
Net
wor
ks thr
o
ug
h
… (
Gu
r
pr
eet
K
our
Sodhi
)
1303
5)
Ma
ur
e
r’
s
“Uni
ver
sal
Stat
ist
ical” Test
This
te
st
is
use
d
to
fi
nd
out
if
a
seq
uen
ce
can
be
c
om
pr
essed
without
a
ny
loss
of
in
form
ation
.
A
seq
uen
ce
is sai
d
to
b
e
r
a
ndom
if it i
sn’t com
pr
essi
ble [1
2].
The res
ults are
su
m
m
arized in
Table
7.
Table
7.
NIST
te
st resu
lt
s
for M
aur
e
r
te
st
MAC
Techn
iq
u
e
P
-
v
alu
es
G
So
d
h
i
u
n
ited
states
HMAC
MD2
0
.92
6
8
0
.95
2
8
0
.95
5
3
HMAC
MD5
0
.98
3
1
0
.98
3
3
0
.99
5
1
HMAC
SHA
-
160
0
.97
1
3
0
.96
0
0
0
.92
5
5
HMAC
SHA
-
256
0
.99
1
2
0
.95
9
9
0
.97
0
5
HMAC
SHA
-
384
0
.97
7
4
0
.99
0
9
0
.99
1
3
HMAC
SHA
-
512
0
.98
6
5
0
.99
0
9
0
.97
6
5
Prop
o
sed
T
echn
iq
u
e
0
.99
8
7
0
.99
3
9
0
.99
9
3
As
it
is
obser
ve
d
f
ro
m
Table
3
to
Ta
ble
7
th
e
pro
po
se
d
sc
hem
e
per
f
or
m
s
bette
r
by
passi
ng
t
he
NI
S
T
crit
eria. T
hus,
i
nd
ic
at
in
g
it
s e
f
fici
ency as a
MAC tec
hniq
ue.
The
obj
ect
ive
of
MAC
is
t
o
pr
ese
rv
e
the
integrity
of
t
he
data
an
d
t
o
sig
nifica
ntly
detect
any
m
od
ific
at
io
n
in
the
recei
ved
data
[13].
Also
,
eve
ry
MA
C
represe
nts
s
pecific
data
co
ntent
a
nd
th
us
it
c
a
n
sign
ific
a
ntly
noti
fy
a
cha
ng
e
in
the
data
[14].
To
stu
dy
this
cha
racteri
st
ic
,
Av
al
a
nche
te
st
is
app
li
ed
to
the
MAC
values
.
This
te
st
cal
culat
es
the
chang
e
in
the
outp
ut
with
res
pect
to
the
c
hange
i
n
the
in
put,
w
hich
is
known
as t
he
a
valanc
he
e
ff
ect
and is cal
c
ulate
d usin
g
t
he
f
orm
ula as g
ive
n i
n
E
q
uatio
n
(
2) [16
]
.
Av
al
a
nch
e
Eff
ect
=
.
.
×
100
(2)
To
a
pp
ly
this
t
est
,
a
sin
gle
ch
aracte
r
of
t
he
input
va
lue
is
a
lt
ered
,
a
nd
ava
la
nch
e
e
ff
ect
is
cal
culat
ed
.
The A
valanc
he
Test res
ults ar
e su
m
m
arized in
Ta
ble
8.
Table
8.
A
valanch
e
Test a
nal
ysi
s
Origin
al I
n
p
u
t
Altered
Inp
u
t
No
.
o
f
b
its f
lip
p
ed
Av
alan
ch
e E
f
f
ect (%
)
G
P
79
4
9
.37
So
d
h
i
So
d
h
b
81
5
0
.62
Un
ited
states
u
n
ited
straten
76
4
7
.50
It
can
be
cl
ea
rly
ob
se
rv
e
d
that
the
pro
po
s
ed
te
chn
i
que
pe
rfor
m
s
well
un
de
r
this
crit
er
ia
too
,
thus
dem
on
strat
in
g
it
s
eff
ic
ie
ncy.
The
pro
po
s
ed
MAC
te
ch
niqu
e
has
highe
r
c
om
plexity
,
whic
h
m
akes
it
hig
hly
resist
ive
to
wa
rd
s
va
rio
us
at
ta
cks
on
inte
gri
ty
,
thu
s
i
ncrea
sing
it
s
a
ppli
cabil
it
y
in
ne
tworks
dem
and
i
ng
secur
it
y [
17]
.
4.
CONCL
US
I
O
N
This
pa
per
pr
e
sents
an
ef
fici
ent
MAC
te
chn
i
qu
e;
de
sig
ned
us
in
g
a
novel
has
h
al
gorithm
and
a
secre
t
key
ge
ne
rated
us
in
g
DNA
a
nd
BB
S
G.
T
he
pro
po
se
d
te
c
hniq
ue
is
te
ste
d
us
in
g
N
IS
T
st
at
ist
ic
al
te
st
su
it
e
for
rand
om
and
pse
udoran
dom
nu
m
ber
ge
nerat
or
s
for
c
rypt
ogra
ph
y
a
ppli
cat
ion
s
a
nd
th
e
avalanc
he
c
rite
ria.
MAC
al
so
known
as
c
rypt
ogra
phic
chec
ksum
is
an
auth
entic
at
ion
te
ch
nique
w
hic
h
use
s
a
has
h
te
c
hn
i
que
al
ong
with
a
se
cret
key
to
pr
otect
integrity
of
a
m
essage
an
d
to
validat
e
the
m
essage.
The
pro
po
se
d
te
ch
ni
que
involves
t
he
use
bio
m
et
ric
char
act
erist
ic
s
al
ong
with
a
no
ve
l
hash
al
go
rithm
to
fr
am
e
the
MAC.
The
a
naly
sis
on
the
ba
sis
of
diff
e
re
nt
te
st
resu
lt
s
dem
on
strat
es
that
the
pro
pos
ed
a
lgorit
hm
per
form
s
bette
r
than
the
existi
ng
HMA
C
schem
es
su
ch
as
MD
2,
M
D5,
SHA
-
16
0,
SH
A
-
256,
S
H
A
-
384
a
nd
SHA
-
512.
This
sc
hem
e
us
es
a
secret
ke
y
wh
ic
h
in
vo
l
ves
D
NA
c
harac
te
risti
cs
of
the
us
e
r,
th
us
m
aking
it
le
ss
su
sce
ptible
to
at
ta
cks
.
The
c
om
bin
at
ion
o
f
bio
l
og
i
cal
char
act
e
risti
cs
al
ong
with
m
at
he
m
at
ic
a
l
op
e
rati
ons
m
ake
this
te
c
hn
i
qu
e
eff
ic
ie
nt e
noug
h
to
b
e
used
un
der inte
ns
e
sec
ur
it
y re
qu
i
rin
g areas,
su
c
h
as
m
ilit
ary, r
esear
ch,
ba
nks,
et
c.
The
propose
d
MAC
can
be
app
li
ed
i
n
va
ri
ou
s
c
rypt
ogra
phic
scena
ri
os
f
or
e
nhance
d
s
ecur
it
y
an
d
pr
e
ve
ntion
aga
inst
at
ta
cks
on
data
inte
gr
it
y.
Furthe
rm
or
e,
key
ge
ne
rati
on
can
be
done
usi
ng
ot
her
bio
l
og
ic
a
l
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1297
–
1304
1304
char
act
e
risti
cs
in
the
fo
rm
of
im
age,
vo
ic
e,
gestu
res,
f
aci
al
exp
ressi
on
s
et
c.
w
hic
h
w
ou
l
d
i
m
pr
ov
e
th
e
un
i
qu
e
ness
and
ori
gin
al
it
y o
f
t
he key
pr
oduce
d,
t
hus leadi
ng
to enha
nced se
cur
it
y.
REFERE
NCE
S
[1]
Zhong
H,
Shao
L.
A
Li
ghtwei
g
ht
and
Secur
e
Data
Authentic
at
i
on
Scheme
with
Privacy
Preserv
at
ion
for
W
ire
les
s
Sensor Net
works
,
Inte
rn
ational
Confer
ence
on
Networki
ng
and
Netw
ork
Applicati
ons (NaNA).
2016;
210
–
217.
[2]
Abdulla
h
N,
Sa
le
h,
Moham
m
ad
A,
Ahm
ad
A.
Secur
ity
of
a
New
Cr
y
ptogr
a
phic
Hash
Func
ti
on
–
Ti
t
ani
um
,
Indone
sian
Jour
nal
of
E
le
c
tri
c
al
Engi
ne
eri
ng
and
Com
pute
r
Sci
en
ce
,
Kuw
ai
t
,
201
8;
10(3):
1244~1
250.
[3]
Sofia
NR,
Hm
a
d
R,
Abdoll
ah
MF
,
Dutkie
wic
z
E.
A
b
iometric
-
base
d
sec
ur
ity
for
data
au
the
nt
i
ca
t
ion
in
W
ir
el
e
ss
bod
y
Area
Netw
ork
(W
BA
N),
1
5th
Inte
rna
t
ional
Confer
enc
e
on
Advanc
ed
Com
m
unic
at
ions
Tec
hnolog
y
(ICAC
T),
2014;
998
–
100
1.
[4]
Um
a
M,
Anand
S.
Survey
o
f
Source
Anon
y
m
ous
Mess
age
Authent
icati
on
Scheme
using
Anal
y
t
ical
an
d
Com
puta
ti
onal
Approac
h,
I
nte
rna
ti
ona
l
Journal
of
El
e
ctronics,
E
lectr
i
c
al
and
Com
p
uta
ti
on
al
S
y
ste
m
,
La
kshm
anga
rh,
2015;
7(2).
[5]
Koong
GS
,
Yang
T,
Tseng
C.
A
Us
er
Authentic
at
ion
Sch
eme
U
sing
Ph
y
siolog
ical
and
Beh
avi
or
al
Biom
e
tri
cs
fo
r
Multi
touc
h
Devi
ce
s, The
Sci
ent
if
ic
W
orld
Journal
Resea
r
ch
Art
ic
l
e,
Tung
Univ
ersi
t
y
,
Hs
inc
hu
,
Tai
wan,
2014
.
[6]
Dill
i
R
,
Ch
andr
a
S
.
Im
ple
m
entation
of
HMAC
-
SH
A
256
al
gori
th
m
for
h
y
br
id
rou
ti
ng
pro
toc
ols
in
MA
NETs,
IE
E
E
Inte
rna
ti
ona
l
Co
nfe
ren
c
e
on
Ele
ct
roni
c
Design,
Com
pute
r
Networks
&
Autom
at
ed
Veri
fi
ca
t
ion
(EDCAV
),
2015;
154
–
159
.
[7]
Verm
a
S,
Praja
pat
i
GS
.
Robustness
and
Secur
ity
Enha
nce
m
en
t
of
SH
A
with
Mo
difi
ed
Mess
age
Digest
and
La
rg
e
r
Bit
Diff
ere
n
ce
.
I
EE
E
S
y
m
posiu
m
on
Colossal
D
at
a
Anal
y
sis
and
Networki
ng
(C
DA
N),
2016;
1
-
5.
[8]
Sodhi
GK
,
Gaba
GS
.
“An
eff
ic
ient
hash
al
gorit
h
m
to
pre
serve
dat
a
integrity
,
”
Journal
of
Engi
ne
er
ing
Scie
nc
e
and
Te
chno
log
y
(
ESTE
C),
2018;
13(
3);
778
-
789.
[9]
Sodhi
GK
,
Gaba
GS
.
“
DN
A
and
Blum
Blum
S
hub
Random
Num
ber
Gene
rat
o
r
Based
Secur
ity
Ke
y
G
ene
r
a
tion
Algorit
hm
”,
Internat
ion
al
Journ
al of
Secu
rity
and
it
s Appli
ca
t
ions
(IJS
IA),
2017;
1
1(4):
1
-
10.
[10]
Stal
li
ngs
W
.
Cr
y
ptogr
aph
y
and
Network
Secur
ity
:
Prin
ci
p
le
s
&
Prac
tices,
”
New
York,
NY
:
Pea
rson
Educ
ation
.
2014;
752.
[11]
Ea
stl
ake
D
,
Han
sen
T, RFC,
N
etw
ork
W
or
king G
roup,
SH
A
-
160.
2016
.
[12]
Rukhin
A,
Soto
J,
Nec
hva
ta
l
J,
S
m
id
M,
Barke
r
E,
L
ei
gh
S
,
L
ev
enso
M,
Vange
ML,
Banks
D,
Hec
ker
t
A,
Dra
y
J,
Bassham
III
LE
.
A
Stat
isti
c
al
T
est
Suite
for
Ra
ndom
and
Ps
eu
dora
ndom
Number
Gene
ra
tors
for
Cr
y
ptogr
aph
ic
Applic
a
ti
ons.
20
10
.
[13]
Hans
P,
Christi
a
n
L,
Ulr
ic
h
L,
UMAC
—
A
Univer
sal
MA
C
ar
chitecture
for
heter
ogene
ous
hom
e
net
works
,
IE
EE
Inte
rna
ti
ona
l
Co
nfe
ren
c
e
on
Ultr
a
Modern
Tele
c
om
m
unic
at
ions
&
W
orkshops
,
2
009;
1
-
6.
[14]
Mavrom
at
i
C,
Ke
y
-
r
ec
ove
r
y
a
t
ta
cks
aga
inst
th
e
MA
C
al
gori
th
m
Chaske
y
,
Spr
nger
,
In
te
rn
at
ion
al
Conf
ere
nc
e
o
n
el
e
ct
ed
Area
s
in Cr
y
ptogr
aph
y
,
2
015;
205
-
216.
[15]
Adeshina
A,
H
ashim
R,
Com
puta
ti
on
al
Appro
ac
h
for
Se
cur
in
g
Radi
olog
y
-
Di
agnosti
c
Da
ta
Connec
t
ed
Hea
l
th
Network
using
High
-
Perform
anc
e
GP
U
-
Acc
elera
t
ed
AES,
I
nte
rdisc
ipl
in
ar
y
Scie
nc
es:
Co
m
puta
ti
onal
Li
f
e
,
Springer,
2017
; 140
–
152.
[16]
Khali
lian
R
,
Re
z
ai
A,
Abedini
E
,
Khali
l
ia
n
R.
An
eff
i
ci
en
t
m
et
ho
d
to
improve
W
BAN
sec
urity
.
Advanc
ed
Scie
n
ce
and
T
ec
hnolo
g
y
Le
tters.
2014;
43
–
46.
[17]
Mar
am
B,
Gnan
ase
kar
JM
,
A
B
loc
k
Ciph
er
Alg
orit
hm
to
Enhance
th
e
Aval
anche
Eff
e
ct
Us
ing
D
y
namic
Ke
y
-
Depe
ndent S
-
Box
and
G
ene
t
ic Opera
t
ions.
In
te
rn
at
ion
al
Journa
l
o
f
Pure
and
Appli
ed
Math
ematics.
2018;
399
-
418
.
Evaluation Warning : The document was created with Spire.PDF for Python.