I
n
t
e
r
n
at
ion
al
Jou
r
n
al
of
E
lec
t
r
ical
an
d
Com
p
u
t
e
r
E
n
gin
e
e
r
in
g
(
I
JE
CE
)
Vol.
1
4
,
No.
5
,
Oc
tober
20
2
4
,
pp
.
5400
~
5407
I
S
S
N:
2088
-
8708
,
DO
I
:
10
.
11591/i
jec
e
.
v
1
4
i
5
.
pp
5
400
-
5407
5400
Jou
r
n
al
h
omepage
:
ht
tp:
//
ij
e
c
e
.
iaes
c
or
e
.
c
om
E
n
h
an
c
in
g t
h
e
r
e
si
st
a
n
c
e
of
p
asswor
d
h
as
h
in
g
u
si
n
g b
i
n
ar
y
r
an
d
om
iz
at
io
n
t
h
r
o
u
gh
l
ogi
c
a
l
gat
e
s
M
u
h
am
ad
Z
ak
i
Anb
ar
i,
B
am
b
an
g
S
u
gian
t
or
o
M
a
s
te
r
of
I
nf
or
ma
ti
c
s
D
e
pa
r
tm
e
nt
, F
a
c
ul
ty
of
S
c
ie
nc
e
a
nd
T
e
c
h
nol
ogy, S
una
n K
a
li
ja
ga
I
s
la
mi
c
S
ta
te
U
ni
ve
r
s
it
y, Y
ogya
ka
r
ta
, I
nd
one
s
ia
Ar
t
icle
I
n
f
o
AB
S
T
RA
CT
A
r
ti
c
le
h
is
tor
y
:
R
e
c
e
ived
F
e
b
20,
2024
R
e
vis
e
d
J
un
14,
2024
Ac
c
e
pted
J
un
17,
2024
D
i
g
i
t
al
i
zat
i
o
n
i
n
v
ari
o
u
s
s
ec
t
o
r
s
mak
e
s
i
n
fo
rma
t
i
o
n
s
ecu
r
i
t
y
i
s
s
u
e
s
v
er
y
cru
ci
a
l
.
In
fo
rmat
i
o
n
s
ec
u
ri
t
y
fo
l
l
o
w
s
t
h
e
au
t
h
e
n
t
i
cat
i
o
n
,
au
t
h
o
ri
za
t
i
o
n
,
an
d
acco
u
n
t
i
n
g
(A
A
A
)
p
r
i
n
c
i
p
l
e,
w
h
ere
o
n
e
o
f
t
h
e
mo
s
t
i
mp
o
r
t
an
t
p
art
s
i
s
au
t
h
en
t
i
ca
t
i
o
n
.
T
h
e
mo
s
t
w
i
d
e
l
y
u
s
ed
a
u
t
h
en
t
i
ca
t
i
o
n
met
h
o
d
i
s
u
s
e
rn
ame
-
p
as
s
w
o
rd
.
T
h
e
b
e
s
t
met
h
o
d
t
o
s
ec
u
re
a
u
s
er
-
p
a
s
s
i
s
t
o
co
n
v
ert
t
h
e
p
l
ai
n
t
e
x
t
u
s
i
n
g
a
h
as
h
s
o
t
h
at
t
h
e
c
o
n
v
ert
e
d
p
l
ai
n
t
e
x
t
ca
n
n
o
t
b
e
reco
v
ere
d
.
H
o
w
ev
er,
w
i
t
h
h
i
g
h
er
t
ech
n
o
l
o
g
y
,
h
ack
ers
ca
n
crac
k
t
h
e
ci
p
h
ert
e
x
t
u
s
i
n
g
b
r
u
t
e
fo
rce.
T
h
i
s
res
earc
h
p
ro
p
o
s
es
a
u
s
er
n
ame
-
p
a
s
s
w
o
r
d
s
cramb
l
i
n
g
al
g
o
ri
t
h
m
b
ef
o
re
i
t
i
s
fe
d
i
n
t
o
t
h
e
h
as
h
fu
n
ct
i
o
n
t
o
i
mp
r
o
v
e
res
i
l
i
en
ce
fro
m
at
t
ack
s
.
T
h
i
s
al
g
o
ri
t
h
m
i
s
n
amed
l
o
g
i
ca
l
g
at
e
s
(L
G
).
It
w
o
r
k
s
b
y
co
n
v
ert
i
n
g
t
h
e
u
s
er
p
a
s
s
i
n
t
o
b
i
n
ar
y
fo
rm,
ad
d
i
n
g
s
al
t
,
an
d
s
cram
b
l
i
n
g
i
t
w
i
t
h
cert
ai
n
l
o
g
i
ca
l
g
at
e
s
b
efo
re
i
n
s
ert
i
n
g
i
t
i
n
t
o
t
h
e
h
as
h
fu
n
ct
i
o
n
.
T
e
s
t
i
n
g
i
s
d
i
v
i
d
ed
i
n
t
o
t
w
o
:
t
i
me
o
f
ex
ecu
t
i
o
n
an
d
at
t
ack
res
i
s
t
an
ce.
T
i
me
o
f
ex
ec
u
t
i
o
n
res
u
l
t
s
s
h
o
w
t
h
a
t
L
G
t
ak
e
s
0
.
0
4
4
3
4
3
2
0
3
3
s
,
w
h
i
l
e
w
i
t
h
o
u
t
L
G
t
ak
es
0
.
0
1
4
0
3
1
9
7
6
4
6
s
.
T
h
e
res
i
s
t
a
n
ce
o
f
at
t
ack
res
u
l
t
s
s
h
o
w
t
h
a
t
t
h
e
p
l
a
i
n
t
ex
t
o
f
t
h
e
h
as
h
amp
l
i
f
i
ed
b
y
L
G
can
n
o
t
b
e
crac
k
ed
a
t
al
l
an
d
i
n
crea
s
es
t
h
e
a
t
t
ac
k
t
i
me
b
y
3
2
1
.
3
%
at
p
refi
x
an
d
1
6
1
.
3
%
at
p
o
s
t
f
i
x
,
w
h
i
l
e
w
i
t
h
o
u
t
L
G
,
t
h
e
p
l
a
i
n
t
ex
t
ca
n
b
e
fo
u
n
d
fo
r
a
cert
ai
n
d
u
ra
t
i
o
n
o
f
t
i
me.
K
e
y
w
o
r
d
s
:
B
inar
y
Ha
s
h
I
nf
or
mation
s
e
c
ur
it
y
L
ogica
l
ga
tes
S
a
lt
Th
i
s
i
s
a
n
o
p
en
a
c
ces
s
a
r
t
i
c
l
e
u
n
d
e
r
t
h
e
CC
B
Y
-
SA
l
i
ce
n
s
e.
C
or
r
e
s
pon
din
g
A
u
th
or
:
M
uha
mad
Z
a
ki
Anba
r
i
M
a
s
ter
of
I
nf
o
r
matics
De
pa
r
tm
e
nt,
F
a
c
ult
y
of
S
c
ie
nc
e
a
nd
T
e
c
hnology,
S
una
n
Ka
li
jaga
I
s
lamic
S
tate
Unive
r
s
it
y
C
a
tur
tunggal,
De
pok,
S
lema
n,
Yogya
ka
r
ta,
5528
1
,
I
ndone
s
ia
E
mail:
mza
kianba
r
i@gm
a
il
.
c
om
1.
I
NT
RODU
C
T
I
ON
T
oda
y
mos
t
pe
ople
ha
ve
uti
l
ize
d
tec
hnology
to
s
uppor
t
their
va
r
ious
a
c
ti
vit
ies
s
uc
h
a
s
c
omm
unica
ti
on,
bus
ines
s
,
s
tudy,
e
nter
tainment,
publi
c
s
e
r
vice
s
,
a
nd
s
o
on.
E
a
c
h
a
ppli
c
a
ti
on
of
the
tec
hnology
is
c
los
e
ly
r
e
late
d
to
da
ta
o
r
inf
o
r
matio
n
s
o
that
inf
o
r
mation
s
e
c
ur
it
y
be
c
omes
ve
r
y
im
po
r
tant
f
or
e
ve
r
yone
.
T
he
r
a
pid
digi
t
iza
ti
on
on
the
one
ha
nd
doe
s
f
a
c
il
it
a
te
va
r
ious
a
c
ti
vit
ies
but
a
ls
o
c
r
e
a
tes
r
i
s
ks
s
uc
h
a
s
da
ta
lea
ka
ge
.
C
onf
identialit
y,
int
e
gr
it
y
,
a
nd
a
v
a
il
a
bil
it
y
a
r
e
thr
e
e
pa
r
a
mete
r
s
that
mus
t
be
r
e
f
e
r
e
nc
e
d
in
buil
ding
inf
o
r
mation
s
e
c
ur
it
y
[
1
]
.
C
onf
identialit
y
mea
ns
e
ns
ur
ing
that
the
us
e
a
nd
s
tor
a
ge
of
da
ta
c
a
n
only
be
done
by
thos
e
who
ha
ve
the
r
ight
.
I
ntegr
it
y
me
a
ns
e
ns
ur
ing
that
the
da
ta
is
int
a
c
t
a
nd
not
de
f
o
r
med
or
c
ontaminate
d
by
malwa
r
e
or
vir
us
e
s
.
Ava
il
a
bil
it
y
mea
ns
e
ns
ur
ing
that
us
e
r
s
who
ha
ve
da
ta
a
c
c
e
s
s
r
ight
s
c
a
n
a
c
c
e
s
s
the
da
ta
whe
n
they
ne
e
d
it
[
2
]
.
E
ve
r
y
a
ppli
c
a
ti
on
mus
t
ha
ve
a
n
a
uthentica
ti
on
s
ys
tem.
Authe
nti
c
a
ti
on
is
ve
r
y
im
por
tant
be
c
a
us
e
it
s
e
r
ve
s
to
e
ns
ur
e
that
the
da
ta
or
inf
or
mation
in
the
a
ppli
c
a
ti
on
c
a
n
only
be
a
c
c
e
s
s
e
d
by
thos
e
e
nti
tl
e
d
to
a
c
c
e
s
s
it
[
3]
.
T
he
mos
t
c
omm
on
ly
us
e
d
a
uthentica
ti
on
is
a
c
ombi
na
ti
on
o
f
us
e
r
na
me
a
nd
pa
s
s
wor
d,
s
o
the
is
s
ue
of
s
e
c
ur
ing
pa
s
s
wor
d
da
ta
is
ve
r
y
im
po
r
tant
[
4]
.
S
ome
methods
of
s
e
c
ur
ing
pa
s
s
wor
ds
a
r
e
by
e
nc
r
ypti
ng
pa
s
s
wor
ds
,
e
nter
ing
pa
s
s
wor
ds
int
o
a
ha
s
h
f
unc
ti
on
be
f
or
e
s
tor
ing
them
in
the
da
taba
s
e
[
5]
,
a
nd
Evaluation Warning : The document was created with Spire.PDF for Python.
I
nt
J
E
lec
&
C
omp
E
ng
I
S
S
N:
2088
-
8708
E
nhanc
ing
the
r
e
s
is
tance
of
pas
s
w
o
r
d
has
hing
us
ing
binar
y
r
andomiz
ati
on
…
(
M
uhamad
Z
ak
i
A
nba
r
i)
5401
c
r
e
a
ti
ng
s
tr
ong
pa
s
s
wor
ds
[
6]
.
S
tr
ong
pa
s
s
wor
d
c
r
it
e
r
ia
include
a
mi
nim
um
length
o
f
6
c
ha
r
a
c
ter
s
,
n
ot
us
ing
the
s
a
me
pa
s
s
wor
d
f
or
a
ll
a
c
c
ounts
,
us
ing
a
c
ombi
na
ti
on
of
letter
s
,
numbe
r
s
,
s
ymbol
s
,
a
nd
a
voidi
ng
dictionar
y
wor
ds
a
s
much
a
s
pos
s
ibl
e
[
7]
.
T
he
method
of
s
e
c
ur
ing
pa
s
s
wor
ds
by
s
tor
ing
ha
s
he
s
is
the
mos
t
s
e
c
ur
e
method
.
Ha
c
ke
r
s
will
ha
ve
dif
f
iculty
f
indi
ng
the
plaintext
pa
s
s
wor
d
due
to
the
one
-
wa
y
na
tur
e
of
the
ha
s
h
f
unc
ti
on
[
8]
.
T
h
e
us
e
of
ha
s
he
s
to
s
e
c
ur
e
da
ta
or
pa
s
s
wor
ds
c
a
n
be
im
p
r
ov
e
d
by
a
dding
s
a
lt
[
9]
.
S
a
lt
is
r
a
ndom
text
that
is
c
ombi
ne
d
with
the
plaintext
pa
s
s
wor
d.
S
a
lt
in
a
ddit
ion
to
inc
r
e
a
s
ing
the
number
o
f
pa
s
s
wor
d
c
ha
r
a
c
ter
s
will
a
l
s
o
make
it
mor
e
di
f
f
icult
to
r
e
a
d
a
nd
gue
s
s
,
making
it
mor
e
im
mune
to
va
r
ious
a
tt
a
c
ks
s
uc
h
a
s
dictionar
y
a
tt
a
c
k,
br
ute
f
or
c
e
a
tt
a
c
k,
or
r
a
inbow
table
a
tt
a
c
k
[
10]
,
[
11
]
.
One
of
the
modul
e
s
us
e
d
to
ge
ne
r
a
te
s
a
lt
is
S
e
c
r
e
ts
.
T
he
S
e
c
r
e
ts
modul
e
e
xis
ts
in
the
python
pr
og
r
a
mm
ing
langua
ge
a
nd
is
us
e
d
to
ge
ne
r
a
te
c
r
yptog
r
a
phica
ll
y
s
tr
ong
r
a
ndom
s
tr
ings
.
S
e
c
r
e
ts
ha
s
incor
por
a
ted
va
r
ious
pa
r
a
mete
r
s
in
c
r
yptog
r
a
phy
theor
y
to
be
a
ble
to
ge
ne
r
a
te
r
a
ndom
s
tr
ings
that
a
r
e
mor
e
im
mune
to
c
r
yptog
r
a
phic
a
tt
a
c
ks
[
12
]
.
Apa
r
t
f
r
om
us
ing
s
a
lt
,
ha
s
h
s
e
c
ur
it
y
is
a
ls
o
a
f
f
e
c
ted
by
the
c
ombi
na
ti
on
s
c
he
me
be
twe
e
n
pa
s
s
wor
d
a
nd
s
a
lt
.
R
e
s
e
a
r
c
h
c
onduc
ted
by
[
13]
c
lea
r
ly
s
hows
the
e
f
f
e
c
t
of
s
a
lt
plac
e
ment
whe
n
us
e
d
a
s
p
r
e
f
ix,
pos
tf
ix,
a
nd
a
lt
e
r
na
ti
ng
.
T
his
mea
ns
that
the
s
e
c
ur
it
y
of
the
ha
s
h
f
unc
ti
on
c
a
n
be
im
pr
ove
d
by
incr
e
a
s
ing
the
c
ompl
e
xit
y
of
the
pa
s
s
wor
d
be
f
or
e
it
is
e
nt
e
r
e
d
int
o
the
ha
s
h
f
unc
ti
on.
Anothe
r
method
int
r
oduc
e
d
to
i
mpr
ove
ha
s
h
s
e
c
u
r
it
y
is
the
S
XR
a
lgor
it
hm
.
S
XR
s
tands
f
or
s
pli
t
,
XO
R
,
a
nd
r
e
plac
e
.
T
his
a
lgor
it
hm
c
ons
is
ts
of
4
s
t
e
ps
:
the
pa
s
s
wor
d
is
ha
s
h
e
d,
then
the
r
a
ti
o
a
nd
number
of
it
e
r
a
ti
ons
of
the
s
e
c
r
e
t
ke
y
a
r
e
c
a
lcula
ted.
Ne
xt,
th
e
ha
s
he
d
pa
s
s
wor
d
is
s
pli
t
int
o
2
ba
s
e
d
on
the
r
e
s
u
lt
of
the
r
a
ti
o
c
a
lcula
ti
on.
F
inally
,
the
obtaine
d
da
ta
is
c
o
mbi
ne
d
a
nd
s
tor
e
d
in
the
da
taba
s
e
[
14]
.
Anothe
r
method
int
r
oduc
e
d
is
by
s
wa
pping
the
e
leme
nts
in
the
a
r
r
a
y
pr
opos
e
d
by
Ka
r
r
a
r
e
t
al.
[
15]
.
T
his
a
lgor
it
hm
wor
ks
by
r
a
ndomi
z
ing
the
pa
s
s
wor
d
a
nd
s
a
lt
e
leme
nts
,
t
he
n
s
e
pa
r
a
ti
ng
a
nd
ha
s
hing
the
s
a
lt
whe
n
s
tor
e
d
in
the
da
taba
s
e
,
making
it
di
f
f
icult
f
o
r
ha
c
ke
r
s
to
gue
s
s
the
s
tor
e
d
pa
s
s
wor
d.
R
e
s
e
a
r
c
h
c
onduc
ted
by
De
Guz
man
e
t
al.
[
16
]
tr
ied
to
s
tr
e
ngthen
the
ha
s
h
f
unc
ti
on
by
a
dding
a
hil
l
c
hipper
.
Hill
c
hipper
is
us
e
d
to
incr
e
a
s
e
c
ompl
e
xit
y
whe
n
ge
ne
r
a
ti
ng
s
a
lt
.
T
his
r
e
s
e
a
r
c
h
f
o
c
us
e
s
on
ove
r
c
omi
ng
ha
s
h
-
c
oll
is
ion
that
may
oc
c
u
r
in
lar
ge
da
taba
s
e
s
.
T
he
method
us
e
d
is
that
whe
n
the
s
ys
t
e
m
de
tec
ts
ha
s
h
-
c
oll
is
ion,
the
a
lgor
it
hm
will
take
the
f
ir
s
t
a
nd
las
t
c
ha
r
a
c
ter
s
of
the
us
e
r
na
me,
then
input
them
int
o
the
matr
ix
e
nc
r
ypt
ion
ke
y
(
M
E
K)
whic
h
then
ge
ne
r
a
tes
a
s
a
lt
.
T
he
s
a
lt
is
c
ombi
ne
d
with
the
or
i
ginal
pa
s
s
wor
d
to
pr
oduc
e
a
ne
w
ha
s
h
va
lue
s
o
that
ha
s
h
-
c
oll
is
ion
c
a
n
be
a
voided.
B
a
s
e
d
on
pr
e
vious
r
e
s
e
a
r
c
h,
ther
e
a
r
e
s
e
ve
r
a
l
methods
to
im
pr
ove
ha
s
h
s
e
c
ur
it
y.
S
tar
ti
ng
f
r
o
m
c
ha
nging
the
ha
s
h
f
unc
ti
on
it
s
e
lf
,
a
dding
s
a
lt
,
us
ing
c
ompl
e
x
pa
s
s
wor
ds
,
o
r
a
dding
othe
r
a
lgo
r
it
hm
s
be
f
or
e
the
ha
s
h
f
unc
ti
on
.
I
n
s
umm
a
r
y
,
thi
s
r
e
s
e
a
r
c
h
a
im
s
to
de
ve
lop
a
lt
e
r
na
ti
ve
a
lgor
i
thm
s
in
r
a
ndomi
z
ing
us
e
r
na
mes
,
pa
s
s
wor
ds
,
a
nd
s
a
lt
be
f
or
e
be
ing
e
n
ter
e
d
int
o
the
ha
s
h
f
unc
ti
on.
T
he
r
e
s
ult
ing
a
lgo
r
it
hm
is
e
xpe
c
ted
to
ha
ve
be
tt
e
r
c
ompl
e
xit
y
a
nd
r
obus
tnes
s
than
other
e
xis
ti
ng
a
lgor
it
h
ms
or
methods
.
T
he
pr
opos
e
d
a
lgor
it
hm
is
na
med
the
logi
c
a
l
ga
tes
(
L
G)
a
lgor
it
hm.
T
he
wa
y
i
t
wor
ks
is
that
the
us
e
r
na
me
a
nd
p
a
s
s
wor
d
that
ha
ve
be
e
n
c
ombi
ne
d
with
s
a
lt
int
o
binar
y
f
or
m,
then
s
c
r
a
mbl
e
them
with
a
s
e
r
ies
of
c
e
r
tain
lo
gic
ga
tes
,
the
r
e
s
ult
is
a
binar
y
c
ir
c
uit
that
is
c
ompl
e
tely
dif
f
e
r
e
nt
f
r
om
the
ini
ti
a
l
bina
r
y
c
ir
c
uit
.
F
ur
the
r
mor
e
,
th
e
binar
y
s
e
r
ies
is
c
onve
r
ted
ba
c
k
to
s
tr
ing
f
or
m
a
nd
e
nter
e
d
int
o
a
ha
s
h
f
unc
ti
on.
I
n
the
f
inal
s
tage
,
tes
ti
n
g
is
done
us
ing
ti
me
of
e
xe
c
uti
on
tes
t
a
nd
r
e
s
is
tanc
e
of
a
tt
a
c
k
ha
s
h
to
c
ompar
e
the
pe
r
f
o
r
manc
e
of
L
G
a
lgor
it
hm
with
other
a
lgor
it
hms
.
2.
P
ROP
OS
E
D
AL
GO
RI
T
HM
At
thi
s
s
tage
the
pr
opos
e
d
a
lgor
it
hm
is
de
s
igned
a
nd
de
ve
loped.
T
he
pr
opos
e
d
a
lgor
it
hm
us
e
s
a
c
ombi
na
ti
on
of
logi
c
ga
tes
to
s
c
r
a
mbl
e
the
us
e
r
na
me,
pa
s
s
wor
d,
a
nd
s
a
lt
be
f
or
e
be
ing
e
nter
e
d
in
to
the
ha
s
h
f
unc
ti
on.
T
he
f
lowc
ha
r
t
of
the
pr
opos
e
d
a
lgor
it
hm
c
a
n
be
s
e
e
n
in
F
igu
r
e
1
.
L
ogic
ga
tes
ha
ve
many
ty
pe
s
with
dif
f
e
r
e
nt
f
unc
ti
ons
.
Ac
c
or
ding
to
Ga
r
g
a
nd
Ka
ur
[
17]
ther
e
a
r
e
7
types
of
logi
c
ga
tes
,
na
mely
AN
D,
OR
,
NO
T
,
NA
ND
,
NO
R
,
XO
R
,
a
nd
XN
OR
.
T
he
L
G
a
lgor
it
hm
us
e
s
s
ome
of
thes
e
logi
c
ga
te
s
to
r
a
ndomi
z
e
the
binar
y
us
e
r
na
me,
pa
s
s
wor
d,
a
nd
s
a
lt
be
f
or
e
e
nter
ing
the
ha
s
h
f
unc
ti
on.
T
he
f
i
r
s
t
s
tep
is
f
or
the
us
e
r
to
e
nter
a
us
e
r
na
me
a
nd
pa
s
s
w
or
d
li
ke
mos
t
a
uthentica
ti
on
methods
.
S
e
c
ond,
the
s
ys
tem
will
a
utom
a
ti
c
a
ll
y
ge
ne
r
a
te
a
s
a
lt
us
ing
the
s
e
c
r
e
ts
modul
e
.
T
he
thi
r
d
s
a
lt
a
nd
pa
s
s
wor
d
will
be
c
ombi
ne
d
us
ing
two
dif
f
e
r
e
nt
s
c
he
mes
in
tur
n
,
na
mely
the
pr
e
f
ix
a
nd
pos
tf
ix
s
c
he
mes
.
T
he
goa
l
is
to
f
ind
out
whic
h
s
c
he
me
is
be
tt
e
r
f
o
r
s
tr
e
ngthening
the
ha
s
h
f
unc
ti
on
.
T
he
f
ou
r
th
s
tep
of
the
c
ombi
ne
d
pa
s
s
wor
d
a
nd
s
a
lt
will
be
c
onve
r
ted
in
b
inar
y
f
or
m
whic
h
only
c
ons
is
ts
of
the
number
s
1
a
nd
0
.
T
he
n
the
binar
y
will
be
e
nter
e
d
s
e
que
nti
a
ll
y
thr
ough
a
s
e
r
ies
of
c
e
r
tain
logi
c
ga
tes
.
De
ter
mi
ning
the
or
de
r
of
the
logi
c
ga
te
c
ir
c
uit
is
ve
r
y
c
ons
ider
ing
the
f
unc
ti
on
o
f
the
f
unc
ti
on
of
e
a
c
h
logi
c
ga
te.
E
r
r
or
s
in
making
s
e
que
nc
e
s
c
a
n
c
a
us
e
f
unc
ti
ons
be
twe
e
n
log
ic
ga
tes
to
be
inef
f
e
c
ti
ve
a
nd
e
li
mi
na
te
e
a
c
h
other
.
F
o
r
e
xa
mpl
e
,
whe
n
the
NA
ND
ga
te
is
f
ol
lowe
d
by
the
NO
T
ga
te,
it
is
the
s
a
me
a
s
dir
e
c
tl
y
us
ing
the
AN
D
ga
te.
T
he
logi
c
ga
te
c
ir
c
uit
us
e
d
in
the
L
G
a
lgor
it
hm
is
a
s
f
oll
ows
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
S
N
:
2088
-
8708
I
nt
J
E
lec
&
C
omp
E
ng
,
Vol
.
1
4
,
No.
5
,
Oc
tober
2
02
4
:
5400
-
5407
5402
=
(
1)
=
+
(
2)
(
+
)
=
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
(
3)
(
+
)
=
+
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
(
4)
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
+
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
=
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
⊕
+
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
(
5)
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
⊕
+
(
+
)
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
̅
=
(
+
)
⊕
+
(
+
)
(
6)
Af
ter
pa
s
s
ing
th
r
ough
a
s
e
r
ies
of
logi
c
ga
tes
,
the
r
e
s
ult
ing
binar
y
will
be
c
onve
r
ted
ba
c
k
int
o
s
tr
ing
f
or
m.
B
ut
s
ometim
e
s
the
r
e
s
ult
ing
bina
r
y
c
a
nnot
be
c
onve
r
ted
im
media
tely
int
o
s
tr
ing
f
or
m
be
c
a
us
e
the
a
r
r
a
nge
ment
of
the
r
e
s
ult
ing
binar
y
doe
s
not
mee
t
ASC
I
I
s
tanda
r
ds
.
S
o
,
the
s
tep
be
f
o
r
e
c
onve
r
ti
ng
ba
c
k
int
o
a
s
tr
ing
is
to
f
or
c
e
the
binar
y
to
mee
t
the
ASC
I
I
s
tanda
r
d.
F
inally
,
the
r
e
s
ult
ing
s
tr
ing
is
e
nter
e
d
int
o
the
ha
s
h
f
unc
ti
on.
T
he
f
lowc
ha
r
t
of
L
G
a
lgor
it
hm
is
s
hown
in
F
igur
e
1.
F
igur
e
1.
F
lowc
ha
r
t
of
L
G
a
lgor
it
hm
S
tar
t
In
put
us
e
r
na
me
a
nd
pa
s
s
w
or
d
f
r
om
us
e
r
Ge
ne
r
a
te
s
a
lt
a
nd
c
onc
a
tena
te
it
with
pa
s
s
wor
d
C
onve
r
t
us
e
r
na
me
&
pa
s
s
wor
d
to
binar
y
f
or
m
C
ombi
ne
binar
y
-
us
e
r
&
binar
y
-
pa
s
s
wor
d
thr
ough
AN
D
&
OR
ga
tes
C
ombi
ne
binar
y
-
AN
D
&
binar
y
-
OR
thr
ough
NA
ND
&
NO
R
ga
tes
C
ombine
bina
r
y
-
N
A
N
D
&
bina
r
y
-
NO
R
thr
ough
XO
R
ga
tes
R
e
ve
r
s
e
modi
f
ied
pa
s
s
wor
d
binar
y
thr
ough
NO
T
ga
tes
F
or
ce
and
con
ver
t
m
od
i
f
i
ed
pa
s
s
wor
d
binar
y
to
s
tr
ing
f
or
m
I
nput
modi
f
ied
pa
s
s
wor
d
to
ha
s
h
f
unc
ti
on
F
ini
s
h
Evaluation Warning : The document was created with Spire.PDF for Python.
I
nt
J
E
lec
&
C
omp
E
ng
I
S
S
N:
2088
-
8708
E
nhanc
ing
the
r
e
s
is
tance
of
pas
s
w
o
r
d
has
hing
us
ing
binar
y
r
andomiz
ati
on
…
(
M
uhamad
Z
ak
i
A
nba
r
i)
5403
3.
M
E
T
HO
D
3.
1.
Re
s
e
ar
c
h
S
e
t
u
p
T
he
r
e
s
e
a
r
c
h
be
gins
with
pr
e
pa
r
ing
r
e
s
e
a
r
c
h
e
quipm
e
nt
in
the
f
or
m
of
a
c
omput
e
r
with
I
ntel
C
or
e
i3
-
10100T
@3.
00
GH
z
pr
oc
e
s
s
or
s
pe
c
if
ica
ti
ons
,
8
GB
R
AM
,
a
nd
W
indows
10
ope
r
a
ti
ng
s
ys
te
m.
C
omput
e
r
s
pe
c
if
ica
ti
ons
will
g
r
e
a
tl
y
a
f
f
e
c
t
the
tes
ti
ng
p
r
oc
e
s
s
.
E
s
pe
c
ially
in
tes
ti
ng
ti
me
of
a
tt
a
c
k
us
ing
th
e
ha
s
hc
a
t
a
ppli
c
a
ti
on,
whe
r
e
the
a
ppli
c
a
ti
on
is
highl
y
de
pe
nde
nt
on
c
omput
e
r
c
omput
ing
c
a
pa
bil
it
ies
[
18
]
.
3.
2.
E
xp
e
r
im
e
n
t
al
d
e
s
ign
T
his
r
e
s
e
a
r
c
h
us
e
s
8
dif
f
e
r
e
nt
pa
s
s
wor
ds
a
nd
s
a
lt
s
with
the
s
a
me
us
e
r
na
me.
E
a
c
h
pa
s
s
wor
d
a
nd
s
a
lt
will
pa
s
s
thr
ough
the
L
G
a
lgor
it
hm
with
va
r
iat
ion
s
in
s
a
lt
plac
e
ment
pos
tf
ix
a
nd
pr
e
f
ix
.
T
he
f
oll
owi
ng
is
the
ps
e
udo
-
c
od
e
of
the
L
G
a
lgor
it
hm
whe
n
us
ing
the
pr
e
f
ix
va
r
iation
,
while
the
pos
tf
ix
va
r
iation
only
ne
e
ds
to
c
ha
nge
the
ps
e
udo
-
c
od
e
on
li
ne
number
4
to
+
.
Alg
or
it
hm
1
a
r
e
s
howing
the
pr
e
f
ix
va
r
iations
o
f
the
L
G
a
lgor
it
hm
:
Algor
it
hm
1
.
L
G
a
lgor
i
thm
Input:
a username U
a password P
Output:
a hash value with modified password MP
Start
01: U
char(00000000)
02: P
char(000000)
03: salt
generate_random char (00)
04: ps
p + salt
05: bin_U
conv2bin(U)
06: bin_PS
conv2bin(PS)
07: bin_AND
empty array
08:
bin_OR
empty array
09: bin_NAND
empty array
10: bin_NOR
empty array
11: bin_XOR
empty array
12: bin_NOT
empty array
13: ascii_char
empty array
14: for i to len(bin_U) do :
15:
bin_AND[i]
bin_U[i] AND bin_PS[i]
16:
bin_OR[i]
bin_U[i] OR bin_PS [i]
17: end loop
18: for I to len(bin_U) do :
19:
bin_NAND[i]
bin_AND[i] NAND bin_OR[i]
20:
bin_NOR[i]
bin_AND[i] NOR bin_OR[i]
21: end loop
22: for I to len(bin_U) do :
23:
bin_XOR
bin_NAND[i] XOR bin_NOR[i]
24: end loop
25: for I to len(bin_U) do :
26:
bin_NOT
bin_XOR[i] NOT
27: end loop
28: ascii_char
“01”+Bin_NOT[3:len(bin_U)]
29: hash_value
md5(ascii_char)
T
e
s
ti
ng
is
done
with
the
a
im
of
knowing
how
the
ha
s
h
r
e
s
is
tan
c
e
that
ha
s
be
e
n
s
tr
e
ngthene
d
with
the
L
G
a
lgor
it
hm
whe
n
c
ompar
e
d
to
ha
s
h
without
the
L
G
a
lgor
it
hm.
T
e
s
ti
ng
is
divi
de
d
int
o
2
,
na
mel
y
ti
me
of
e
xe
c
uti
on
a
nd
r
e
s
is
tanc
e
of
a
tt
a
c
k
.
T
im
e
o
f
e
xe
c
uti
on
tes
t
is
a
tes
t
o
f
a
lgor
it
hm
e
xe
c
uti
on
ti
me,
whi
c
h
is
the
ti
me
r
e
qui
r
e
d
f
or
a
c
omput
e
r
to
r
un
a
n
a
lgor
it
h
m,
ge
ne
r
a
ll
y
the
lowe
r
the
e
xe
c
uti
on
ti
me,
the
be
tt
e
r
the
a
lgor
it
hm
[
19
]
.
W
hil
e
the
r
e
s
is
tanc
e
of
a
tt
a
c
k
tes
t
i
s
a
tes
t
of
ha
s
h
r
e
s
is
tanc
e
whe
n
a
tt
a
c
ke
d
or
ha
c
ke
d.
I
n
thi
s
tes
t,
the
br
ute
f
or
c
e
a
tt
a
c
k
method
wil
l
be
us
e
d,
whic
h
is
the
e
a
s
ies
t
a
tt
a
c
k
a
nd
is
wide
ly
us
e
d
by
ha
c
ke
r
s
be
c
a
us
e
the
method
is
s
im
ple
[
18]
.
T
he
r
e
s
is
tanc
e
of
a
tt
a
c
k
tes
t
us
e
s
ha
s
hc
a
t
v6.
2.
6
s
of
twa
r
e
to
int
e
nti
ona
ll
y
pe
ne
tr
a
te
or
br
u
te
f
o
r
c
e
a
tt
a
c
ks
.
T
he
mor
e
c
ompl
e
x
or
s
e
c
ur
e
a
ha
s
h
us
e
d,
the
longer
it
take
s
to
ha
c
k
it
[
20]
.
4.
RE
S
UL
T
S
AN
D
DI
S
CU
S
S
I
ON
T
he
L
G
a
lgor
it
hm
is
tes
ted
th
r
ough
two
types
of
t
e
s
ti
ng,
na
mely
ti
me
of
e
xe
c
uti
on
a
nd
r
e
s
is
tanc
e
of
a
tt
a
c
k.
S
ome
e
xa
mpl
e
s
of
pa
s
s
wor
ds
a
nd
s
a
lt
s
us
e
d
f
or
tes
ti
ng
pur
pos
e
s
a
r
e
take
n
ba
s
e
d
on
[
13]
w
hich
a
r
e
then
li
mi
ted
to
6
c
ha
r
a
c
ter
s
,
while
the
s
a
lt
is
ge
n
e
r
a
ted
us
ing
the
s
e
c
r
e
ts
python
modul
e
a
nd
is
li
m
it
e
d
to
2
c
ha
r
a
c
ter
s
.
L
im
it
ing
the
nu
mber
of
c
ha
r
a
c
ter
s
in
p
a
s
s
wor
ds
a
nd
s
a
lt
s
a
im
s
to
s
pe
e
d
up
tes
ti
ng
due
to
li
mi
ted
c
omput
e
r
s
pe
c
if
ica
ti
ons
a
nd
c
omput
ing
powe
r
[
21]
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
S
N
:
2088
-
8708
I
nt
J
E
lec
&
C
omp
E
ng
,
Vol
.
1
4
,
No.
5
,
Oc
tober
2
02
4
:
5400
-
5407
5404
4.
1.
T
e
s
t
d
at
as
e
t
T
he
us
e
r
na
me
us
e
d
in
the
r
e
s
e
a
r
c
h
is
made
uni
f
or
m,
na
mely
"
uinj
ogja
"
,
while
the
li
s
t
o
f
pa
s
s
wor
ds
,
s
a
lt
,
a
nd
ha
s
h
va
lues
us
e
d
c
a
n
be
s
e
e
n
in
T
a
ble
1.
T
he
L
G
a
lgor
i
thm
is
im
pleme
nted
us
ing
the
P
ython
langua
ge
by
uti
li
z
ing
Google
C
olab.
He
r
e
's
a
n
e
x
a
mpl
e
of
how
the
L
G
a
lgor
it
hm
wo
r
ks
.
F
o
r
e
xa
mpl
e
,
the
pa
s
s
wor
d
input
ted
is
"
qwe
r
ty"
a
nd
the
s
a
lt
ge
ne
r
a
t
e
d
f
r
om
the
s
e
c
r
e
t’
s
modul
e
is
"
b9"
.
I
n
the
L
G
a
l
gor
it
hm,
the
pr
e
f
ix
va
r
iations
of
the
two
va
r
iable
s
will
be
c
ombi
ne
d
int
o
"
b9qwe
r
ty"
then
the
s
tr
ing
a
nd
us
e
r
na
me
a
r
e
c
onve
r
ted
int
o
binar
y
f
o
r
m
whic
h
only
c
ons
is
ts
of
the
number
s
0
a
nd
1.
Af
te
r
that
the
binar
y
us
e
r
n
a
me
a
nd
binar
y
pa
s
s
wor
d
will
be
input
int
o
a
s
e
r
ies
of
logi
c
ga
tes
a
s
de
s
c
r
ibed
in
(
1
)
to
(
6
)
.
T
he
r
e
s
ult
is
a
modi
f
ied
binar
y
s
tr
ing
that
is
dif
f
e
r
e
nt
f
r
o
m
the
in
it
ial
us
e
r
na
me
a
nd
pa
s
s
wor
d
binar
y.
How
e
ve
r
,
the
mod
if
ied
binar
y
is
of
ten
not
r
e
c
ognize
d
by
the
ASC
I
I
s
tanda
r
d.
I
n
ASC
I
I
the
b
inar
y
f
ir
s
t
byte
of
a
s
tr
ing
is
"
0"
s
o
whe
n
the
modi
f
ied
binar
y
ha
s
a
f
ir
s
t
byte
of
"
1"
it
ne
e
ds
to
be
c
onve
r
ted
ba
c
k
to
a
va
lue
o
f
"
0"
in
or
d
e
r
to
be
r
e
c
ognize
d
by
ASC
I
I
.
Af
ter
the
modi
f
ied
binar
y
i
s
in
a
c
c
or
da
nc
e
with
ASC
I
I
,
i
t
wil
l
then
be
r
e
tur
n
e
d
in
the
f
or
m
of
a
s
tr
ing
,
s
o
that
f
r
om
the
input
us
e
r
na
me
"
uinj
ogja"
,
pa
s
s
wor
d
"
q
we
r
ty"
,
a
nd
s
a
lt
"
b9
"
a
ne
w
s
tr
ing
will
be
ge
ne
r
a
ted
,
na
mely
"
h/`
bujag"
.
T
he
ne
w
s
tr
i
ng
is
then
input
ted
in
to
a
ha
s
h
f
unc
ti
on
whic
h
in
t
his
s
tudy
us
e
s
the
M
D5
ha
s
h
f
unc
ti
on.
F
inally
,
the
r
e
s
ult
ing
ha
s
h
va
lue
is
s
tor
e
d
in
the
da
taba
s
e
.
T
a
ble
1.
P
a
s
s
wor
d,
s
a
lt
,
a
nd
ha
s
h
va
lue
da
ta
N
o.
P
a
s
s
w
or
d
S
a
lt
H
a
s
h
va
lu
e
pr
e
f
ix
(
N
on
-
L
G
)
H
a
s
h
va
lu
e
pr
e
f
ix
(
L
G
)
H
a
s
h
va
lu
e
po
s
tf
ix
(
N
on
-
L
G
)
H
a
s
h
va
lu
e
po
s
tf
ix
(
L
G
)
1
qw
e
r
ty
b9
a
57c
f
f
b9f
48b37302279
c
b65c
28774c
6
3c
a
9d9c
e
a
b8f
b2b639c
49a
73590b519e
b47e
d88c
a
e
441f
0e
23f
c
1272
2f
b98478
9f
c
747c
a
76a
15894c
64
7d34441c
e
a
7f
e
2
123456
d8
2b10bb383c
c
f
f
a
1c
f
f
33a
f
8187367143
6a
c
43c
69655c
04b37d
706b2a
766e
9e
d1
38df
f
c
940c
c
4f
21c
3c
de
f
30a
249576da
c
82d53102081487769f
77374f
9da
69c
f
3
monye
t
ya
bc
b00de
27df
5c
0b5c
5a
7
c
4d1b1a
18dd4
c
8e
9d120e
e
747f
f
54c
5
841b5d6dc
51f
a
c
5a
d972283684079c
891c
78
0d3b66342
c
8c
0f
9b7db316890b4e
3a
d955f
d87d45
4
qa
z
w
s
x
60
773f
c
2c
5b4c
3d4549e
0
b804d80b65330
416c
b4084e
98a
33512
09bdb50a
131e
07
8f
82e
e
16388f
7dd17f
da
7b01
8b5c
7940
e
c
8f
2e
10507e
f
3309e
e
e
1f
7879c
48767
5
qw
a
s
z
x
e2
a
a
c
8e
c
9a
a
26314d72e
a
f
11270a
62e
1c
c
f
34e
a
b820a
2241d9bf
6
c
bc
8c
f
8595026
c
8301921bc
c
c
19b4e
249d94
d4a
443d5b
7a
58f
b0be
8d7f
a
40c
33
581a
e
35163467
6
ha
r
ke
y
e8
c
0c
3c
bb45de
7d1d6e
00
d3794f
1415a
e
d
74c
d4547873b1c
7745
6a
16a
750598338
012f
e
d830e
f
9e
9f
9d863616a
8bdd2e
b4
b9e
d9b01df
5d7d65ddb
b7b5e
a
9c
7f
60a
7
654321
ef
77c
be
5a
08f
41a
c
2ba
e
f
6
d0a
67591d45a
4c
461860053b441bc
e
17dd596d00833c
4e
981513bf
3f
127d0358f
b7
b4f
0bdf
f
9
a
3be
7d5c
c
1c
e
86
c
e
b34
6bd36931273c
4
8
a
bc
123
67
3a
13787a
28981863e
a
0
0a
9a
099e
9e
a
1a
b897de
258e
d1bf
d6a
8f
e
be
a
c
6f
f
5c
3e
3
8459e
2de
27a
b485d40a
8f
88
13f
03b74f
6e
7be
7789b71bb171f
5
4f
0f
b554c
05a
d
4.
2.
T
im
e
o
f
e
xe
c
u
t
io
n
t
e
s
t
T
i
m
e
of
e
x
e
c
u
ti
on
t
e
s
t
a
im
s
t
o
de
ter
mi
ne
t
h
e
e
xe
c
uti
on
t
im
e
of
th
e
L
G
a
lg
or
it
h
m
a
nd
th
e
a
l
gor
it
hm
w
it
h
ou
t
L
G.
T
h
e
e
x
e
c
ut
io
n
ti
me
i
s
c
a
l
c
u
la
te
d
f
r
o
m
th
e
t
im
e
th
e
u
s
e
r
n
a
m
e
a
n
d
pa
s
s
w
or
d
a
r
e
i
np
ut
te
d
unt
il
th
e
ha
s
h
v
a
l
u
e
i
s
ge
n
e
r
a
t
e
d.
T
hi
s
te
s
t
u
s
e
s
s
of
t
w
a
r
e
.
T
h
e
t
e
s
t
r
e
s
ul
t
s
s
h
ow
th
a
t
t
he
a
v
e
r
a
g
e
e
x
e
c
ut
io
n
ti
me
of
t
h
e
a
l
gor
it
hm
wi
th
ou
t
L
G
ta
ke
s
0.
0
14
03
19
76
46
s
e
c
on
ds
whi
l
e
th
e
L
G
a
l
go
r
it
h
m
ta
k
e
s
0
.
0
44
34
32
03
3
s
e
c
on
d
s
.
T
he
L
G
a
lg
or
i
th
m
t
a
k
e
s
4
t
im
e
s
l
on
g
e
r
t
h
a
n
th
e
a
lg
or
it
hm
w
it
ho
ut
L
G.
T
hi
s
d
a
t
a
i
s
o
bt
a
i
n
e
d
b
y
t
e
s
t
in
g
e
a
c
h
p
a
s
s
wor
d
f
r
o
m
T
a
bl
e
1
u
s
in
g
pr
e
f
ix
a
n
d
po
s
tf
i
x
v
a
r
i
a
t
io
n
s
f
or
10
r
e
p
e
t
it
io
n
s
a
nd
t
h
e
n
t
a
ki
ng
t
he
a
v
e
r
a
g
e
.
T
hu
s
,
th
e
a
l
go
r
it
hm
w
it
h
o
ut
L
G
ha
s
b
e
t
te
r
p
e
r
f
or
m
a
nc
e
th
a
n
t
he
L
G
a
lgo
r
it
hm
i
n
t
h
e
e
x
e
c
ut
io
n
t
im
e
s
e
c
ti
on.
Ho
w
e
v
e
r
,
wi
th
a
n
e
x
e
c
u
ti
on
ti
me
of
le
s
s
t
ha
n
0.
1
s
e
c
o
nd
s
,
hu
ma
n
s
wi
ll
no
t
r
e
a
ll
y
no
ti
c
e
i
t
w
h
e
n
th
e
a
lg
or
i
thm
i
s
im
pl
e
m
e
n
t
e
d
i
n
th
e
r
e
a
l
wo
r
l
d
[
22]
.
T
h
e
ti
m
e
of
e
xe
c
uti
on
t
e
s
t
d
a
t
a
i
s
s
h
o
wn
i
n
T
a
b
le
2.
T
a
ble
2.
E
xe
c
uti
on
ti
me
da
ta
No
T
im
e
e
xe
c
ut
io
n pr
opos
e
d
a
lg
or
it
hm
(
s
)
T
im
e
e
xe
c
ut
io
n w
it
hout
pr
opos
e
d a
lg
or
it
hm
(
s
)
P
r
e
f
ix
P
os
tf
ix
P
r
e
f
ix
P
os
tf
ix
1
0.0141196250
0.0131189823
0.0410013198
0.0520370006
2
0.0111825466
0.0125463008
0.0456936359
0.0502171516
3
0.0131368637
0.0158793926
0.0417432785
0.0403289794
4
0.0123655796
0.0108537674
0.0394756794
0.0459666252
5
0.0161843299
0.0133821964
0.0389025211
0.0469002723
6
0.0199582576
0.0157468318
0.0447325706
0.0459043979
7
0.0125904083
0.0116624832
0.0402889251
0.0458452701
8
0.0178318023
0.0139522552
0.04235863686
0.04809498787
Evaluation Warning : The document was created with Spire.PDF for Python.
I
nt
J
E
lec
&
C
omp
E
ng
I
S
S
N:
2088
-
8708
E
nhanc
ing
the
r
e
s
is
tance
of
pas
s
w
o
r
d
has
hing
us
ing
binar
y
r
andomiz
ati
on
…
(
M
uhamad
Z
ak
i
A
nba
r
i)
5405
4.
3.
Re
s
is
t
an
c
e
of
a
t
t
ac
k
t
e
s
t
T
he
r
e
s
is
tanc
e
of
a
tt
a
c
k
tes
t
a
im
s
to
c
ompar
e
the
r
e
s
is
tanc
e
of
the
ha
s
h
va
lue
ge
n
e
r
a
ted
without
the
L
G
a
lgor
it
hm
with
the
ha
s
h
that
ha
s
be
e
n
r
e
inf
o
r
c
e
d
with
the
L
G
a
lgor
i
thm
.
T
he
tes
t
da
ta
is
obt
a
ined
by
tes
ti
ng
e
a
c
h
pa
s
s
wor
d
f
r
om
T
a
ble
1
us
ing
pr
e
f
ix
a
nd
pos
tf
ix
va
r
iations
f
or
10
r
e
pe
ti
ti
ons
a
nd
then
th
e
a
ve
r
a
ge
is
take
n.
T
he
r
e
s
is
tanc
e
of
a
tt
a
c
k
da
ta
is
s
hown
in
T
a
ble
3.
B
r
ute
f
or
c
e
wor
ks
by
t
r
ying
a
l
l
pos
s
ibl
e
c
ombi
n
a
ti
ons
to
gue
s
s
the
pa
s
s
wor
d
to
be
a
tt
a
c
ke
d.
T
he
dur
a
ti
on
of
br
ute
f
or
c
e
is
highl
y
de
pe
nde
nt
on
how
long
the
c
ha
r
a
c
ter
s
e
t
is
a
nd
the
c
omput
a
ti
ona
l
c
a
pa
bil
it
ies
of
the
de
vice
us
e
d
by
the
ha
c
ke
r
[
21
]
.
T
he
f
oll
owing
is
the
c
omm
a
nd
us
e
d
to
pe
r
f
o
r
m
b
r
ute
f
or
c
e
pe
ne
tr
a
ti
on
us
ing
ha
s
hc
a
t:
ℎ
ℎ
−
3
−
0
ℎ
ℎ
_
.
–
−
the
a
bove
c
omm
a
nd
c
ons
is
ts
of
s
e
ve
r
a
l
a
r
guments
,
na
mely:
−
ℎ
ℎ
:
to
c
a
ll
ha
s
hc
a
t
a
ppli
c
a
ti
on
−
−
:
to
de
ter
mi
ne
a
tt
a
c
k
mode
−
3
:
to
de
ter
mi
ne
b
r
ute
f
o
r
c
e
a
s
a
tt
a
c
k
mode
−
−
:
to
de
ter
mi
ne
ha
s
h
f
unc
ti
on
−
0
:
to
de
ter
mi
ne
md5
a
s
ha
s
h
f
unc
ti
on
−
ℎ
ℎ
_
.
:
to
c
a
ll
f
il
e
c
ontains
ha
s
h
va
lue
−
−
−
:
to
ignor
e
a
ny
wa
r
nings
I
n
ha
s
hc
a
t,
br
ute
f
o
r
c
e
a
tt
a
c
ks
a
r
e
s
im
il
a
r
to
mas
k
a
tt
a
c
ks
.
T
he
dif
f
e
r
e
nc
e
be
twe
e
n
mas
k
a
tt
a
c
k
a
nd
br
ute
f
or
c
e
a
tt
a
c
k
is
in
de
ter
mi
ning
the
ke
ys
pa
c
e
.
B
r
ute
f
or
c
e
a
tt
a
c
ks
us
e
the
de
f
a
ult
ke
ys
pa
c
e
,
while
mas
k
a
tt
a
c
ks
us
e
a
k
e
ys
pa
c
e
that
ha
s
be
e
n
a
djus
ted
to
t
he
ha
c
ke
r
's
tar
ge
t.
Ke
ys
pa
c
e
i
s
a
li
mi
tation
of
pos
s
ibi
li
ti
e
s
that
a
r
e
de
ter
mi
ne
d
be
f
or
e
c
a
r
r
ying
out
a
n
a
tt
a
c
k
[
23]
.
F
or
e
xa
mpl
e
,
whe
n
ha
c
ke
r
s
us
e
br
ute
f
or
c
e
,
b
y
de
f
a
ult
ha
s
hc
a
t
will
us
e
a
c
ombi
na
ti
on
of
c
ha
r
a
c
ter
s
e
ts
that
include
uppe
r
c
a
s
e
letter
s
,
lowe
r
c
a
s
e
letter
s
,
a
nd
a
ll
number
s
or
known
a
s
mi
xa
lpha
-
numer
ic.
T
he
us
e
of
ke
ys
pa
c
e
a
ll
ows
ha
c
ke
r
s
to
s
pe
e
d
up
the
a
tt
a
c
k
pr
oc
e
s
s
a
s
it
mi
nim
ize
s
the
number
of
c
ombi
na
ti
ons
that
ne
e
d
to
be
e
xe
c
uted
by
the
c
omput
e
r
.
How
e
ve
r
,
t
he
us
e
of
ke
ys
pa
c
e
may
a
c
tually
pr
olong
the
ha
c
king
p
r
oc
e
s
s
or
e
ve
n
thwa
r
t
it
due
to
the
ha
c
ke
r
's
mi
s
take
in
de
ter
mi
ning
the
ke
ys
pa
c
e
.
Ke
ys
pa
c
e
de
ter
mi
na
ti
on
is
c
los
e
ly
r
e
late
d
to
s
oc
ial
e
nginee
r
ing
tec
hniques
.
S
oc
ial
e
nginee
r
ing
plays
a
r
ole
in
the
pr
oc
e
s
s
of
f
indi
ng
out
how
s
omeone
de
s
igns
a
pa
s
s
wor
d.
B
y
know
ing
how
s
omeone
de
s
igns
a
pa
s
s
wor
d,
ha
c
ke
r
s
c
a
n
de
ter
m
ine
a
na
r
r
owe
r
ke
ys
pa
c
e
s
o
that
the
a
tt
a
c
k
ti
me
be
c
omes
s
hor
ter
[
24]
.
T
his
r
e
s
e
a
r
c
h
us
e
s
a
br
ute
f
or
c
e
a
tt
a
c
k
with
a
de
f
a
ult
ke
ys
pa
c
e
be
c
a
u
s
e
br
ute
f
or
c
e
is
mor
e
ge
ne
r
a
l
a
nd
objec
ti
ve
.
I
n
s
hor
t,
whe
n
a
ha
s
h
is
im
mune
to
br
ute
f
or
c
e
,
it
is
a
lm
os
t
c
e
r
tainly
im
mune
to
othe
r
types
of
a
tt
a
c
ks
[
25]
.
He
r
e
is
the
ke
ys
pa
c
e
br
ute
f
or
c
e
a
tt
a
c
k
on
ha
s
hc
a
t:
“
?
1
?
2
?
2
?
2
?
2
?
2
?
2
?
3
?
3
?
3
?
3
?
?
?
?
”
whe
r
e
,
?
1
:
?
?
?
(
lowe
r
c
a
s
e
letter
s
,
number
s
,
a
nd
uppe
r
c
a
s
e
letter
s
)
?
2
:
?
?
(
lowe
r
c
a
s
e
letter
s
a
nd
number
s
)
?
3
:
?
?
∗
!
$@
_
(
lowe
r
c
a
s
e
letter
s
,
number
s
,
a
nd
f
ive
s
e
lec
ted
s
pe
c
ial
c
ha
r
a
c
ter
s
)
T
he
r
e
s
ult
s
of
the
r
e
s
is
tanc
e
of
a
tt
a
c
k
tes
t
c
a
n
be
s
e
e
n
in
T
a
ble
3.
T
a
bl
e
3.
R
e
s
is
tanc
e
of
a
tt
a
c
k
tes
t
da
ta
No
A
ve
r
a
ge
dur
a
ti
on of
a
tt
a
c
k
P
r
e
f
ix
N
on L
G
(
s
)
C
r
a
c
ke
d
P
r
e
f
ix
L
G
(
s
)
C
r
a
c
ke
d
P
os
tf
ix
N
on L
G
(
s
)
C
r
a
c
ke
d
P
os
tf
ix
L
G
(
s
)
C
r
a
c
ke
d
1
5639.3
Y
e
s
28798.4
No
17774.7
Y
e
s
28651.7
No
2
1450.5
Y
e
s
28793.3
No
11637.6
Y
e
s
28488.8
No
3
6316.8
Y
e
s
28831.6
No
2469.8
Y
e
s
28543.1
No
4
22421.9
Y
e
s
28669.8
No
3277.1
Y
e
s
28705.9
No
5
7506.7
Y
e
s
28965.2
No
7759.2
Y
e
s
28474.1
No
6
6345.7
Y
e
s
20715
No
19217.9
Y
e
s
28568.7
No
7
2161.7
Y
e
s
28450.8
No
22954.2
Y
e
s
28601.5
No
8
775.3
Y
e
s
28456.5
No
2415.6
Y
e
s
28660.3
No
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
S
N
:
2088
-
8708
I
nt
J
E
lec
&
C
omp
E
ng
,
Vol
.
1
4
,
No.
5
,
Oc
tober
2
02
4
:
5400
-
5407
5406
T
a
ble
3
s
hows
that
c
onve
nti
ona
l
o
r
non
-
L
G
ha
s
h
e
s
c
a
n
be
c
r
a
c
ke
d
withi
n
a
c
e
r
tain
pe
r
iod
o
f
t
im
e
.
T
he
dif
f
e
r
e
nc
e
in
ti
me
is
due
to
the
va
r
ying
lev
e
l
of
c
ompl
e
xit
y
o
f
the
ha
s
he
d
pa
s
s
wor
d.
B
a
s
e
d
on
the
e
xpe
r
im
e
nts
c
onduc
ted,
it
is
known
that
pa
s
s
wor
ds
that
us
e
number
s
a
r
e
mor
e
vulner
a
ble
than
pa
s
s
w
or
ds
that
us
e
letter
s
.
T
his
is
be
c
a
us
e
number
s
only
ha
ve
1
0
dif
f
e
r
e
nt
va
r
iations
,
na
mely
number
s
0
-
9.
W
hil
e
letter
s
ha
ve
26
dif
f
e
r
e
nt
va
r
iations
,
na
mely
A
-
Z
.
F
or
e
xa
mpl
e
,
pa
s
s
wor
d
number
1
(
qwe
r
ty)
ha
s
a
longer
h
a
c
k
ti
me
than
pa
s
s
wor
d
number
2
(
123456
)
.
I
n
a
ddit
ion,
t
he
or
de
r
in
whic
h
pa
s
s
wor
ds
a
r
e
c
r
e
a
ted
ha
s
a
s
i
gnif
ica
nt
e
f
f
e
c
t
on
the
du
r
a
ti
on
o
f
the
ha
c
k
[
13]
.
P
u
tt
ing
lett
e
r
s
a
t
the
be
ginni
ng
o
f
the
pa
s
s
wor
d
s
hows
be
tt
e
r
s
tr
e
ngth
than
putt
ing
number
s
a
t
the
be
ginni
ng
of
the
pa
s
s
wor
d.
P
a
s
s
wor
d
No.
2
whe
n
c
ombi
ne
d
with
s
a
lt
(
d
8123456)
ha
s
a
longer
dur
a
ti
on
than
pa
s
s
wor
d
No.
8
(
67a
bc
123)
e
ve
n
though
the
number
of
letter
s
in
pa
s
s
wor
d
No.
8
is
mor
e
than
No.
2.
M
e
a
nwhile,
the
L
G
-
s
tr
e
ngthene
d
ha
s
h
ha
s
a
much
longer
ha
c
king
du
r
a
ti
on
than
the
c
onve
nti
ona
l
ha
s
h.
T
a
ble
2
s
hows
that
the
du
r
a
ti
o
n
of
the
L
G
a
lgor
i
thm
ha
s
a
s
mall
dif
f
e
r
e
nc
e
be
t
we
e
n
one
pa
s
s
wor
d
va
r
iation
a
nd
a
nother
.
T
his
is
ve
r
y
dif
f
e
r
e
nt
f
r
om
the
non
-
L
G
a
lgor
it
hm
whos
e
dur
a
ti
o
n
va
r
ies
gr
e
a
tl
y
a
c
c
or
ding
to
the
leve
l
o
f
pa
s
s
wor
d
c
om
plexity.
T
he
s
im
il
a
r
it
y
in
the
dur
a
ti
on
of
the
L
G
ha
s
h
is
be
c
a
us
e
ha
s
hc
a
t
ha
s
r
un
out
of
pa
s
s
wor
d
c
a
ndidat
e
s
with
a
length
of
8
c
ha
r
a
c
ter
s
.
S
o,
the
a
tt
a
c
k
dur
a
ti
on
on
the
L
G
ha
s
h
is
the
tot
a
l
a
mount
of
ti
me
it
take
s
ha
s
hc
a
t
to
tes
t
pa
s
s
wor
d
c
a
ndidate
s
f
r
om
1
c
ha
r
a
c
ter
to
8
c
ha
r
a
c
ter
s
.
I
n
the
L
G
ha
s
h,
a
ll
pa
s
s
wor
d
va
r
iation
s
c
a
nnot
be
f
ound
in
plaintext
.
T
his
method
is
mu
c
h
mor
e
e
f
f
e
c
ti
ve
f
or
im
p
r
oving
pa
s
s
wor
d
s
e
c
ur
it
y
be
c
a
us
e
ther
e
is
no
ne
e
d
to
f
or
c
e
s
omeone
to
c
r
e
a
te
a
c
ompl
e
x
pa
s
s
wor
d
f
or
s
e
c
ur
it
y,
but
the
c
omput
e
r
will
a
utom
a
ti
c
a
ll
y
s
tr
e
ngthen
the
e
nter
e
d
pa
s
s
wor
d
n
o
matter
whe
ther
it
is
vulne
r
a
ble
or
not
[
26]
.
5.
CONC
L
USI
ON
T
he
de
ve
lopm
e
nt
of
digi
taliza
ti
on
make
s
inf
or
mati
on
s
e
c
ur
it
y
is
s
ue
s
ve
r
y
im
por
tant.
F
r
a
ud,
ha
c
king
,
da
ta
thef
t
that
is
incr
e
a
s
ingl
y
ha
ppe
ning
s
hows
th
a
t
r
e
s
e
a
r
c
h
in
the
f
ield
o
f
in
f
or
mation
s
e
c
ur
it
y
is
ne
e
de
d.
T
he
main
f
oc
us
of
thi
s
r
e
s
e
a
r
c
h
is
on
methods
to
i
mpr
ove
pa
s
s
wor
d
s
e
c
ur
it
y
us
ing
ha
s
h
f
unc
ti
ons
by
uti
li
z
ing
the
logi
c
a
l
ga
tes
(
L
G)
a
lgor
it
h
m.
T
he
L
G
a
lgor
it
h
m
is
a
n
a
lgor
it
hm
that
f
unc
ti
ons
to
r
a
ndomi
z
e
the
us
e
r
na
me
a
nd
pa
s
s
wor
d
a
t
the
binar
y
leve
l
be
f
or
e
be
ing
e
nter
e
d
int
o
the
ha
s
h
f
unc
ti
on.
T
e
s
ts
we
r
e
c
ond
uc
ted
to
mea
s
ur
e
the
e
xe
c
uti
on
ti
me
of
the
L
G
a
lgor
it
hm
a
nd
mea
s
ur
e
the
r
e
s
is
tanc
e
of
the
ha
s
h
ge
ne
r
a
ted
us
ing
a
br
ute
f
or
c
e
a
tt
a
c
k.
T
he
tes
t
r
e
s
ult
s
s
how
that
the
L
G
a
lgor
it
hm
r
e
quir
e
s
f
our
ti
mes
longer
e
xe
c
uti
on
ti
me
than
the
us
e
of
ha
s
h
without
L
G.
How
e
ve
r
,
the
ha
s
h
c
ombi
ne
d
wi
th
the
L
G
a
lgor
it
hm
ha
s
a
much
higher
r
e
s
is
tanc
e
to
br
ute
f
or
c
e
a
tt
a
c
ks
.
E
xpe
r
im
e
ntal
r
e
s
ult
s
s
how
that
none
of
the
8
pa
s
s
wor
d
va
r
iations
us
e
d
c
a
n
be
c
r
a
c
ke
d
by
br
ute
f
or
c
e
.
E
ve
n
though
in
the
wor
s
t
-
c
a
s
e
h
a
c
ke
r
s
c
a
n
ha
c
k
the
ha
s
h
of
L
G,
ha
c
ke
r
s
s
ti
ll
ne
e
d
to
tr
y
to
f
ind
the
or
igi
na
l
plaintext
pa
s
s
wor
d
f
r
om
the
modi
f
ied
pa
s
s
wor
d
ge
ne
r
a
ted
by
L
G.
T
his
r
e
s
e
a
r
c
h
c
a
n
be
a
s
o
lut
ion
to
buil
d
a
s
ys
tem
that
is
us
e
r
f
r
iendly,
mea
ning
t
ha
t
us
e
r
s
do
not
ne
e
d
to
c
r
e
a
te
pa
s
s
wor
ds
that
a
r
e
too
c
ompl
ica
ted,
but
s
ti
ll
take
int
o
a
c
c
ount
in
ter
ms
of
in
f
or
mation
s
e
c
ur
it
y
.
F
utu
r
e
r
e
s
e
a
r
c
h
is
e
xp
e
c
ted
to
de
ve
lop
the
L
G
a
lgor
it
hm
s
o
that
it
c
a
n
be
e
mbedde
d
in
a
ha
r
dwa
r
e
s
o
that
it
s
a
ppli
c
a
ti
on
in
s
tr
e
n
gthening
inf
or
mation
s
e
c
ur
it
y
be
c
omes
wide
r
.
RE
F
E
RE
NC
E
S
[
1]
S
.
S
a
mona
s
a
nd
D
.
C
os
s
,
“
T
h
e
c
ia
s
tr
ik
e
s
ba
c
k:
R
e
d
e
f
in
in
g
c
onf
id
e
nt
ia
li
ty
,
in
te
gr
it
y
a
nd
a
va
il
a
bi
li
ty
in
s
e
c
ur
it
y,”
J
our
nal
of
I
nf
or
m
at
io
n Sy
s
te
m
Se
c
u
r
it
y
, vol
. 10, no. 3, pp. 21
–
45, 2014
.
[
2]
K
.
Y
.
C
ha
i
a
nd
M
.
F
.
Z
ol
ki
pl
i,
“
R
e
vi
e
w
on
c
onf
id
e
nt
ia
li
ty
,
in
t
e
gr
it
y
a
nd
a
va
il
a
bi
li
ty
in
in
f
or
ma
ti
on
s
e
c
ur
it
y,”
J
our
nal
of
I
C
T
I
n
E
duc
at
io
n
, vol
. 8, no. 2, pp. 34
–
42, 2021, doi:
10.37134/j
ic
ti
e
.v
ol
8.2.4.2021.
[
3]
A
. S
a
di
qui
, “
S
e
c
ur
in
g a
c
c
e
s
s
us
in
g A
A
A
,
”
C
om
put
e
r
N
e
tw
o
r
k
Se
c
ur
it
y
, pp. 67
–
78, 2020, doi:
10.1002/978111970
6762.c
h4.
[
4]
E
.
K
uka
a
nd
R
.
B
a
hi
ti
,
“
I
nf
or
ma
ti
on
s
e
c
ur
it
y
ma
na
ge
me
nt
:
P
a
s
s
w
or
d
s
e
c
ur
it
y
is
s
ue
s
,
”
A
c
ade
m
ic
J
our
nal
of
I
nt
e
r
di
s
c
ip
li
nar
y
St
udi
e
s
, vol
. 7, no. 2, pp. 43
–
47, 2018, doi:
10.2478/ajis
-
2018
-
0045.
[
5]
M
.
B
ur
ne
tt
a
nd
J
.
C
.
F
os
te
r
,
C
hapt
e
r
1
M
anaging
us
e
r
s
s
ol
ut
io
ns
in
th
is
C
hapt
e
r
.
S
yngr
e
s
s
P
ubl
is
hi
ng,
I
nc
,
2004
,
doi
:
10.1016/B
978
-
1
-
932266
-
65
-
8.50034
-
5.
[
6]
A
. S
in
gh a
nd
S
. R
a
j,
“
S
e
c
ur
in
g
pa
s
s
w
or
d us
in
g dyna
mi
c
pa
s
s
w
or
d poli
c
y ge
ne
r
a
to
r
a
lg
or
it
hm,”
J
our
nal
of
K
in
g Saud
U
ni
v
e
r
s
it
y
-
C
om
put
e
r
and I
nf
or
m
at
io
n Sc
ie
n
c
e
s
, vol
. 34, no. 4, pp. 1357
–
1
361, 2022, doi:
10.1016/j
.j
ks
uc
i.
2019.06.006.
[
7]
M
.
Y
ıl
dı
r
ım
a
nd
I
.
M
a
c
ki
e
,
“
E
nc
our
a
gi
ng
us
e
r
s
to
im
pr
ove
pa
s
s
w
or
d
s
e
c
ur
it
y
a
nd
me
mor
a
bi
li
ty
,”
I
nt
e
r
nat
io
nal
J
our
na
l
of
I
nf
or
m
at
io
n Se
c
ur
it
y
, vol
. 18, no. 6, pp. 741
–
759, 2019, doi:
10.1007/s
10207
-
019
-
00429
-
y.
[
8]
M
. C
. A
h K
io
on,
Z
. W
a
ng, a
nd
S
. D
e
b D
a
s
, “
S
e
c
ur
it
y a
na
ly
s
is
of
M
D
5 a
lg
or
it
hm
i
n pa
s
s
w
or
d s
to
r
a
ge
,”
in
P
r
oc
e
e
di
ngs
of
t
he
2nd
I
nt
e
r
nat
io
nal
Sy
m
pos
iu
m
on
C
om
put
e
r
,
C
om
m
uni
c
at
io
n,
C
ont
r
ol
and
A
ut
om
at
io
n
(
I
SC
C
C
A
-
13)
,
F
e
b.
2013,
pp.
706
–
709,
doi
:
10.2991/i
s
c
c
c
a
.2013.177.
[
9]
D
.
B
a
lu
,
A
.
G
,
T
.
S
,
K
.
V
,
a
nd
P
.
V
,
“
I
mpl
e
me
nt
a
ti
on
of
s
e
c
ur
i
ty
in
lo
gi
n
pa
ge
u
s
in
g
s
a
lt
a
nd
p
e
ppe
r
a
lg
or
it
hm,”
SSR
N
E
le
c
tr
oni
c
J
our
nal
, 2019, doi:
10.2139/s
s
r
n.3358813.
[
10]
P
.
P
a
te
l,
P
.
G
os
w
a
mi
,
A
.
M
is
hr
a
,
S
.
K
ha
n,
a
nd
A
.
C
houdha
r
y,
“
B
r
ut
e
f
or
c
e
,
di
c
ti
ona
r
y
a
nd
r
a
in
bow
ta
bl
e
a
tt
a
c
k
on
ha
s
he
d
pa
s
s
w
or
ds
,
”
I
nt
e
r
nat
io
nal
J
our
nal
of
C
r
e
at
iv
e
R
e
s
e
ar
c
h T
houg
ht
s
(
I
J
C
R
T
)
,
vol
. 9, no. 4,
p
p. 1899
–
1905
, 2021.
[
11]
U
. R
a
th
od, M
. S
onka
r
, a
nd B
. R
. C
ha
nda
va
r
ka
r
, “
A
n e
xpe
r
im
e
nt
a
l
e
va
lu
a
ti
on on the
de
pe
nde
nc
y be
twe
e
n one
-
w
a
y ha
s
h f
unc
ti
ons
a
nd
s
a
lt
,”
2020
11t
h
I
nt
e
r
nat
io
nal
C
onf
e
r
e
n
c
e
on
C
om
put
in
g
,
C
om
m
uni
c
at
io
n
and
N
e
tw
o
r
k
in
g
T
e
c
hnol
ogi
e
s
,
I
C
C
C
N
T
20
20
,
Evaluation Warning : The document was created with Spire.PDF for Python.
I
nt
J
E
lec
&
C
omp
E
ng
I
S
S
N:
2088
-
8708
E
nhanc
ing
the
r
e
s
is
tance
of
pas
s
w
o
r
d
has
hing
us
ing
binar
y
r
andomiz
ati
on
…
(
M
uhamad
Z
ak
i
A
nba
r
i)
5407
2020, doi:
10.1109/I
C
C
C
N
T
49239.2020.9225503.
[
12]
P
yt
hon
S
of
twa
r
e
F
ounda
ti
on,
“
S
e
c
r
e
ts
—
G
e
ne
r
a
te
s
e
c
ur
e
r
a
ndom
numbe
r
s
f
or
ma
na
gi
ng
s
e
c
r
e
ts
,”
P
yt
hon
S
of
twa
r
e
F
ounda
ti
on
,
2024,
ht
tp
s
:/
/d
oc
s
.pyt
hon.or
g/
3/
li
br
a
r
y/
s
e
c
r
e
ts
.ht
ml
(
a
c
c
e
s
s
e
d
F
e
b 20, 2024
)
.
[
13]
S
ut
r
im
a
n
a
nd
B
.
S
ugi
a
nt
or
o
,
“
A
na
ly
s
i
s
of
pa
s
s
w
or
d
a
nd
s
a
lt
c
ombi
na
ti
on
s
c
he
me
to
im
pr
ove
ha
s
h
a
lg
or
it
hm
s
e
c
ur
i
ty
,”
I
nt
e
r
nat
io
nal
J
our
nal
of
A
dv
anc
e
d
C
om
put
e
r
Sc
i
e
nc
e
a
nd
A
ppl
ic
at
io
ns
,
vol
.
10,
no.
11,
pp.
420
–
425,
2019,
doi
:
10.14569/I
J
A
C
S
A
.2019.0101158.
[
14]
J
.
P
ol
pong
a
nd
P
.
W
ut
ti
di
tt
a
c
hot
ti
,
“
A
ut
he
nt
ic
a
ti
on
a
nd
pa
s
s
w
or
d
s
to
r
in
g
im
pr
ove
me
nt
us
in
g
S
X
R
a
lg
or
i
th
m
w
it
h
a
h
a
s
h
f
unc
ti
on,”
I
nt
e
r
nat
io
nal
J
our
nal
of
E
le
c
tr
ic
al
and
C
om
put
e
r
E
ngi
ne
e
r
in
g
,
vol
.
10,
no.
6,
pp
.
6582
–
6591
,
D
e
c
.
2020,
doi
:
10.11591/i
je
c
e
.v10i6.pp6582
-
6591.
[
15]
A
.
K
a
r
r
a
r
,
T
.
A
lm
ut
ir
i,
S
.
A
lg
r
a
f
i,
N
.
A
la
lwi
,
a
nd
A
.
A
lh
a
r
bi
,
“
E
nha
nc
in
g
s
a
lt
e
d
pa
s
s
w
or
d
ha
s
hi
ng
te
c
hni
que
us
in
g
s
w
a
pp
in
g
e
le
me
nt
s
in
a
n
a
r
r
a
y
a
lg
or
it
hm,”
I
nt
e
r
nat
io
nal
J
our
nal
of
C
o
m
put
e
r
Sc
ie
nc
e
and
T
e
c
hnol
ogy
(
I
J
C
ST
),
v
ol
.
9,
no.
1,
pp.
21
–
25,
2018.
[
16]
F
.
E
.
D
e
G
uz
ma
n,
B
.
D
.
G
e
r
a
r
do,
a
nd
R
.
P
.
M
e
di
na
,
“
I
mpl
e
me
nt
a
ti
on
of
e
nha
nc
e
d
s
e
c
ur
e
h
a
s
h
a
lg
or
it
hm
to
w
a
r
ds
a
s
e
c
ur
e
d
w
e
b
por
ta
l,
”
2019
I
E
E
E
4t
h
I
nt
e
r
nat
io
nal
C
onf
e
r
e
nc
e
on
C
om
put
e
r
and
C
om
m
uni
c
at
io
n
Sy
s
t
e
m
s
,
I
C
C
C
S
2019
,
pp.
189
–
192,
20
19,
doi
:
10.1109/C
C
O
M
S
.2019.8821764.
[
17]
B
.
G
a
r
g
a
nd
S
.
K
a
ur
,
“
A
r
e
vi
e
w
of
lo
gi
c
ga
te
s
a
nd
it
s
a
ppl
ic
a
ti
ons
,”
J
our
nal
of
E
m
e
r
gi
ng
T
e
c
hnol
ogi
e
s
and
I
nnov
at
iv
e
R
e
s
e
a
r
c
h
,
vol
. 6, no. 5, pp. 124
–
129, 2019
.
[
18]
K
.
S
w
a
th
i,
“
B
r
ut
e
f
or
c
e
a
tt
a
c
k
on
r
e
a
l
w
or
ld
pa
s
s
w
or
ds
,
”
I
nt
e
r
nat
io
nal
J
our
nal
of
R
e
s
e
ar
c
h
P
ubl
ic
at
io
n
and
R
e
v
ie
w
s
,
vol
.
3,
no. 11, pp. 552
–
558, 2022.
[
19]
J
.
B
ie
le
c
ki
a
nd
M
.
Ś
mi
a
łe
k,
“
E
s
ti
ma
ti
on
of
e
xe
c
ut
io
n
ti
me
f
or
c
omput
in
g
ta
s
ks
,”
C
lu
s
te
r
C
o
m
put
in
g
,
vol
.
26,
n
o.
6,
pp. 3943
–
3956, 2023, doi:
10.1007/s
10586
-
022
-
03774
-
1.
[
20]
D
.
P
.
P
ut
r
a
,
I
.
W
.
A
.
P
.
P
ut
r
a
,
a
nd
I
.
G
.
W
.
P
.
S
uc
ip
ta
,
“
C
ompa
r
is
on
of
pa
s
s
w
or
d
a
tt
a
c
ks
us
in
g
th
e
to
ol
s
ba
r
s
hw
f
,
ha
s
hc
a
t,
a
n
d
ha
s
h
c
r
a
c
ke
r
c
ons
ol
e
,”
(
in
B
a
ha
s
a
)
,
J
T
I
K
(
J
ur
nal
T
e
k
ni
k
I
nf
or
m
at
ik
a
K
aput
am
a)
,
vol
.
7,
no.
1,
pp.
181
–
187,
2023,
doi
:
10.59697/j
ti
k.v7i1.62.
[
21]
D
. J
. B
e
r
ns
te
in
, “
U
nde
r
s
ta
ndi
ng br
ut
e
f
or
c
e
,”
E
C
R
Y
P
T
ST
V
L
W
or
k
s
hop on Sy
m
m
e
tr
ic
K
e
y
E
nc
r
y
pt
io
n
, pp. 10
–
19, 2005.
[
22]
R
.
B
.
M
il
le
r
,
“
R
e
s
pon
s
e
ti
me
in
ma
n
-
c
omput
e
r
c
onve
r
s
a
ti
ona
l
tr
a
ns
a
c
ti
ons
,”
P
r
oc
e
e
di
ng
s
of
th
e
D
e
c
e
m
be
r
9
-
11,
1968,
F
al
l
J
oi
nt
C
om
put
e
r
C
onf
e
r
e
nc
e
, P
ar
t
I
,
vol
. 33, no. pt 1, pp. 26
7
–
277, 1968, doi:
10.1145/1476589.1
476628.
[
23]
M
. C
ur
ti
n a
nd J
. D
ol
s
k
e
, “
A
br
ut
e
f
or
c
e
s
e
a
r
c
h of
D
E
S
ke
ys
pa
c
e
,”
L
ogi
n
,
vol
. 23, no. 3, pp. 15
–
25, 1998.
[
24]
R
. H
r
a
ni
c
ký, L
. Z
oba
l,
O
. R
yš
a
vý, a
nd D
. K
ol
á
ř
, “
D
is
tr
ib
ut
e
d p
a
s
s
w
or
d c
r
a
c
ki
ng w
it
h B
O
I
N
C
a
nd ha
s
h
c
a
t,
”
D
ig
it
al
I
nv
e
s
ti
gat
i
on
,
vol
. 30, pp. 161
–
172, 2019, doi:
10.1016/j
.di
in
.2019.08.001.
[
25]
I
.
A
lk
hw
a
ja
e
t
al
.
,
“
P
a
s
s
w
or
d
c
r
a
c
ki
ng
w
it
h
br
ut
e
f
or
c
e
a
lg
or
it
hm
a
nd
di
c
ti
ona
r
y
a
tt
a
c
k
us
in
g
pa
r
a
ll
e
l
pr
ogr
a
mm
in
g,”
A
ppl
ie
d
Sc
ie
nc
e
s
(
Sw
it
z
e
r
la
nd)
, vol
. 13, no. 10, 2023, doi
:
10.3390/a
pp
13105979.
[
26]
H
.
H
us
s
a
in
,
“
P
a
s
s
w
or
d
S
e
c
ur
it
y:
B
e
s
t
pr
a
c
ti
c
e
s
a
nd
m
a
na
ge
me
nt
s
tr
a
te
gi
e
s
,”
SSR
N
E
le
c
tr
oni
c
J
our
nal
,
2022,
doi
:
10.2139/s
s
r
n.4136333.
B
I
OG
RA
P
HI
E
S
OF
AU
T
HO
RS
M
uha
m
a
d
Za
k
i
A
nb
a
ri
recei
v
ed
h
i
s
B.
Sc
d
e
g
ree
i
n
p
h
y
s
i
c
s
fro
m
D
i
p
o
n
eg
o
ro
U
n
i
v
er
s
i
t
y
,
I
n
d
o
n
e
s
i
a,
i
n
2
0
2
0
.
C
u
rren
t
l
y
,
h
e
i
s
a
mas
t
er
o
f
co
m
p
u
t
er
s
ci
e
n
ce
d
eg
ree
ca
n
d
i
d
a
t
e
at
t
h
e
D
e
p
art
me
n
t
o
f
In
f
o
rmat
i
cs
,
Fac
u
l
t
y
o
f
Sci
e
n
ce
an
d
T
ech
n
o
l
o
g
y
,
Su
n
an
K
al
i
j
ag
a
S
t
at
e
Is
l
am
i
c
U
n
i
v
ers
i
t
y
.
H
i
s
res
ea
rch
i
n
t
eres
t
s
i
n
c
l
u
d
e
au
t
o
mat
i
o
n
,
i
n
t
ern
e
t
o
f
t
h
i
n
g
s
,
c
o
mp
u
t
er
n
et
w
o
r
k
s
,
an
d
cy
b
er
s
ecu
r
i
t
y
.
H
e
can
b
e
reach
ed
a
t
emai
l
:
mzak
i
a
n
b
ar
i
@
g
mai
l
.
co
m
.
Ba
m
ba
n
g
Sug
i
a
nto
r
o
earn
ed
h
i
s
B.
Sc
an
d
D
r
d
eg
rees
i
n
co
mp
u
t
er
s
ci
e
n
ce
fro
m
G
ad
j
ah
Mad
a
U
n
i
v
er
s
i
t
y
,
In
d
o
n
es
i
a.
MT
d
e
g
ree
i
n
el
ec
t
ri
ca
l
en
g
i
n
eer
i
n
g
at
Ba
n
d
u
n
g
In
s
t
i
t
u
t
e
o
f
T
ech
n
o
l
o
g
y
.
H
e
i
s
cu
rre
n
t
l
y
t
h
e
h
ea
d
o
f
t
h
e
i
n
fo
rmat
i
c
s
mas
t
er
s
t
u
d
y
p
r
o
g
ram
at
t
h
e
In
fo
rma
t
i
c
s
D
e
p
art
me
n
t
o
f
Su
n
an
K
al
i
j
a
g
a
St
a
t
e
Is
l
a
mi
c
U
n
i
v
ers
i
t
y
.
H
i
s
res
earc
h
i
n
t
eres
t
s
i
n
c
l
u
d
e
co
mp
u
t
er
n
e
t
w
o
rk
s
,
cy
b
er
s
ecu
r
i
t
y
,
an
d
mach
i
n
e
l
earn
i
n
g
.
H
e
can
b
e
co
n
t
act
e
d
v
i
a
emai
l
:
b
amb
a
n
g
.
s
u
g
i
a
n
t
o
ro
@
u
i
n
-
s
u
k
a.
ac.
i
d
.
Evaluation Warning : The document was created with Spire.PDF for Python.