I
nd
o
ne
s
ia
n J
o
urna
l o
f
E
lect
rica
l En
g
ineering
a
nd
Co
m
p
u
t
er
Science
Vo
l.
22
,
No
.
3
,
J
u
n
e
2
0
2
1
,
p
p
.
1
6
5
0
~
1
6
5
8
I
SS
N:
2
5
02
-
4
7
5
2
,
DOI
: 1
0
.
1
1
5
9
1
/i
j
ee
cs
.
v
2
2
.i
3
.
pp
1
6
5
0
-
1
6
5
8
1650
J
o
ur
na
l ho
m
ep
a
g
e
:
h
ttp
:
//ij
ee
cs.ia
esco
r
e.
co
m
M
ethods
f
o
r se
cu
re c
lo
ud p
ro
cess
ing
of big da
ta
Yer
zha
n N.
Seit
k
ulo
v
,
Seil
kh
a
n N.
B
o
ra
nb
a
y
ev
,
G
uld
en
B
.
Uly
uk
o
v
a
,
B
a
nu
B
.
Yer
g
a
liy
e
v
a
,
Dina
S
a
t
y
ba
ldi
na
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
Un
i
v
e
rsit
y
,
Ka
z
a
k
h
sta
n
Art
icle
I
nfo
AB
ST
RAC
T
A
r
ticle
his
to
r
y:
R
ec
eiv
ed
A
p
r
23
,
2
0
2
1
R
ev
i
s
ed
A
p
r
23
,
2
0
2
1
A
cc
ep
ted
Ma
y
5
,
2
0
2
1
W
e
stu
d
y
n
e
w
m
e
th
o
d
s
o
f
se
c
u
re
c
lo
u
d
p
ro
c
e
ss
in
g
o
f
b
ig
d
a
ta
w
h
e
n
so
lv
in
g
a
p
p
li
e
d
c
o
m
p
u
tatio
n
a
ll
y
-
c
o
m
p
lex
p
ro
b
lem
s
w
it
h
se
c
re
t
p
a
ra
m
e
ter
s.
T
h
is
is
o
n
e
o
f
th
e
to
p
ica
l
issu
e
s
o
f
se
c
u
re
c
li
e
n
t
-
se
rv
e
r
c
o
m
m
u
n
ica
ti
o
n
.
A
s
p
a
rt
o
f
o
u
r
re
se
a
rc
h
w
o
rk
,
w
e
m
o
d
e
l
th
e
c
l
ien
t
-
se
rv
e
r
in
tera
c
ti
o
n
s:
w
e
g
iv
e
sp
e
c
i
f
ic
d
e
f
in
it
io
n
s
o
f
su
c
h
c
o
n
c
e
p
ts
a
s
“
so
lv
a
b
le
b
y
th
e
p
ro
to
c
o
l
”
,
“
se
c
u
re
p
ro
t
o
c
o
l
”
,
“
c
o
rre
c
t
p
ro
to
c
o
l
”
,
a
s
w
e
ll
a
s
a
c
tu
a
li
z
e
th
e
w
e
ll
-
k
n
o
w
n
c
o
n
c
e
p
ts
-
“
a
c
ti
v
e
a
tt
a
c
k
s
”
a
n
d
“
p
a
ss
iv
e
a
tt
a
c
k
s
”
.
F
irst,
w
e
w
il
l
o
u
tl
in
e
th
e
t
h
e
o
ry
a
n
d
m
e
th
o
d
s
o
f
se
c
u
re
o
u
tso
u
rc
in
g
f
o
r
v
a
rio
u
s
a
b
stra
c
t
e
q
u
a
ti
o
n
s
w
it
h
se
c
re
t
p
a
ra
m
e
ters
,
a
n
d
t
h
e
n
p
re
se
n
t
t
h
e
re
su
lt
s
o
f
u
sin
g
th
e
se
m
e
th
o
d
s
i
n
so
lv
in
g
a
p
p
li
e
d
p
ro
b
lem
s
w
it
h
se
c
re
t
p
a
ra
m
e
ters
,
a
risin
g
f
ro
m
th
e
m
o
d
e
li
n
g
o
f
e
c
o
n
o
m
ic
p
ro
c
e
ss
e
s.
M
a
n
y
e
c
o
n
o
m
ic
tas
k
s
in
v
o
lv
e
p
r
o
c
e
ss
in
g
a
larg
e
se
t
o
f
e
c
o
n
o
m
ic
in
d
ica
to
rs.
T
h
e
re
f
o
re
,
w
e
a
re
c
o
n
sid
e
rin
g
a
ty
p
ica
l
e
c
o
n
o
m
ic
p
r
o
b
lem
th
a
t
c
a
n
o
n
ly
b
e
so
lv
e
d
o
n
v
e
ry
p
o
w
e
r
f
u
l
c
o
m
p
u
ters
.
K
ey
w
o
r
d
s
:
B
ig
d
ata
C
lo
u
d
co
m
p
u
tin
g
I
n
f
o
r
m
a
tio
n
s
ec
u
r
it
y
I
n
ter
n
et
o
f
t
h
i
n
g
s
Secu
r
e
o
u
t
s
o
u
r
cin
g
T
h
is i
s
a
n
o
p
e
n
a
c
c
e
ss
a
rticle
u
n
d
e
r th
e
CC B
Y
-
SA
li
c
e
n
se
.
C
o
r
r
e
s
p
o
nd
ing
A
uth
o
r
:
Yer
zh
an
N.
Sei
tk
u
lo
v
Gu
m
il
y
o
v
E
u
r
a
s
ian
Na
tio
n
al
Un
i
v
er
s
it
y
2
Satp
ay
e
v
s
tr
.
,
N
u
r
-
S
u
lta
n
cit
y
,
Kaz
ak
h
s
ta
n
E
m
ail:
y
er
zh
a
n
.
s
eit
k
u
lo
v
@
g
m
ail.
co
m
1.
I
NT
RO
D
UCT
I
O
N
I
n
th
is
p
ap
er
w
e
in
v
es
tig
a
te
n
e
w
m
et
h
o
d
s
f
o
r
s
ec
u
r
e
clo
u
d
p
r
o
ce
s
s
in
g
o
f
b
ig
d
ata
w
h
e
n
s
o
lv
i
n
g
ap
p
lied
co
m
p
u
tatio
n
all
y
-
co
m
p
lex
p
r
o
b
lem
s
w
it
h
s
ec
r
et
p
ar
am
eter
s
.
As
a
r
u
le,
s
tan
d
ar
d
c
r
y
p
to
g
r
ap
h
ic
p
r
o
to
co
ls
ar
e
u
s
ed
to
en
s
u
r
e
th
e
s
ec
u
r
it
y
o
f
clie
n
t
-
s
er
v
er
co
m
m
u
n
icatio
n
s
.
T
h
ese
cr
y
p
to
g
r
ap
h
ic
m
eth
o
d
s
ar
e
ef
f
ec
tiv
e
f
o
r
b
ig
d
ata
s
to
r
ag
e
t
ask
s
,
b
u
t a
r
e
n
o
t a
l
w
a
y
s
ac
ce
p
tab
le
f
o
r
s
ec
u
r
e
in
f
o
r
m
at
io
n
p
r
o
ce
s
s
in
g
ta
s
k
s
.
Fo
r
ex
a
m
p
le,
t
h
e
w
ell
-
k
n
o
w
n
m
at
h
e
m
a
tical
m
eth
o
d
s
o
f
h
o
m
o
m
o
r
p
h
ic
en
cr
y
p
tio
n
s
till
h
av
e
n
o
p
r
ac
tical
ap
p
licatio
n
d
u
e
to
th
e
h
u
g
e
co
m
p
u
tatio
n
al
co
s
t
s
o
n
th
e
clien
t
s
id
e.
T
h
er
ef
o
r
e,
al
o
n
g
w
it
h
class
ical
cr
y
p
to
g
r
ap
h
ic
m
et
h
o
d
s
,
it
i
s
n
ec
es
s
ar
y
to
u
s
e
a
lter
n
ati
v
e
(
n
o
n
-
cr
y
p
to
g
r
ap
h
ic)
m
et
h
o
d
s
a
n
d
tech
n
o
lo
g
ie
s
f
o
r
p
r
o
tectin
g
in
f
o
r
m
atio
n
.
Su
c
h
m
et
h
o
d
s
,
as
a
r
u
le,
ar
e
u
s
ed
f
o
r
th
e
s
af
e
p
r
o
ce
s
s
in
g
o
f
b
ig
d
ata
ar
is
in
g
in
t
h
e
m
at
h
e
m
a
tical
m
o
d
elin
g
o
f
ec
o
n
o
m
ic
p
r
o
b
le
m
s
,
in
lin
ea
r
p
r
o
g
r
a
m
m
in
g
p
r
o
b
le
m
s
,
w
h
ic
h
,
f
o
r
o
n
e
r
ea
s
o
n
o
r
an
o
th
er
,
m
a
y
co
n
ta
in
s
ec
r
et
p
a
r
a
m
eter
s
[
1
]
-
[
2
4
]
.
Ou
r
p
r
o
b
lem
ca
n
b
e
d
escr
ib
ed
as
f
o
llo
w
s
.
W
e
w
ill
as
s
u
m
e
t
h
at
a
"
clien
t"
is
an
en
tit
y
w
h
o
w
is
h
es
to
s
ec
u
r
e
u
s
e
an
i
n
s
ec
u
r
e
s
er
v
er
to
s
o
lv
e
s
o
m
e
co
m
p
u
ta
tio
n
al
l
y
-
co
m
p
le
x
p
r
o
b
lem
,
th
at
is
,
th
e
clien
t
w
is
h
e
s
to
s
ec
u
r
e
p
r
o
ce
s
s
b
i
g
d
ata
o
n
th
e
s
er
v
er
.
As
a
s
er
v
er
a
s
u
p
er
co
m
p
u
ter
ca
n
b
e
u
s
ed
,
w
h
ich
is
f
ea
s
ib
le
f
o
r
t
h
e
i
m
p
le
m
en
ta
tio
n
o
f
th
is
co
m
p
u
tatio
n
all
y
-
co
m
p
lex
tas
k
.
I
t
is
i
m
p
o
r
ta
n
t
to
n
o
te
t
h
at
i
n
t
h
i
s
s
ettin
g
,
th
e
s
er
v
er
i
s
n
o
t
tr
u
s
ted
b
y
t
h
e
clie
n
t;
th
er
ef
o
r
e,
s
en
s
iti
v
e
o
r
co
n
f
id
en
t
ia
l
in
f
o
r
m
atio
n
m
u
s
t
b
e
p
r
o
tecte
d
f
r
o
m
t
h
e
s
er
v
er
,
an
d
th
e
r
es
u
lt
s
o
f
t
h
e
s
er
v
er
's
co
m
p
u
tatio
n
s
,
g
en
er
all
y
s
p
ea
k
in
g
,
m
u
s
t
b
e
ea
s
il
y
v
er
i
f
ied
b
y
th
e
clie
n
t.
F
u
r
th
er
,
o
w
n
co
m
p
u
ti
n
g
d
ev
ices
ca
n
a
ct
as
a
s
er
v
er
,
b
u
t
co
n
tr
o
lled
u
n
s
cr
u
p
u
lo
u
s
o
r
ca
r
eless
e
m
p
lo
y
ee
s
.
T
h
er
ef
o
r
e,
an
ad
v
er
s
ar
y
w
h
o
w
a
n
ts
to
in
ter
ce
p
t
class
i
f
ied
i
n
f
o
r
m
atio
n
ca
n
also
ac
t
as
a
s
er
v
er
.
So
,
f
o
r
m
all
y
,
t
h
e
s
er
v
er
is
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
Meth
o
d
s
fo
r
s
ec
u
r
e
clo
u
d
p
r
o
c
ess
in
g
o
f b
ig
d
a
t
a
(
Yer
z
h
a
n
N
.
S
eitku
lo
v
)
1651
s
i
m
u
lta
n
eo
u
s
l
y
an
ad
v
er
s
ar
y
,
an
d
th
e
d
ata
s
e
n
t
to
it
r
ep
r
esen
t
s
a
co
m
p
u
tatio
n
al
l
y
-
co
m
p
lex
p
r
o
b
le
m
th
at
it
m
u
s
t so
l
v
e
in
e
n
cr
y
p
ted
f
o
r
m
.
Fu
r
t
h
er
,
th
e
co
n
ce
p
t
o
f
"
clie
n
t"
w
ill
b
e
r
elati
v
e,
an
d
it
w
il
l
d
ep
en
d
o
n
th
e
co
n
s
id
er
ed
class
o
f
p
r
o
b
lem
s
w
ith
s
ec
r
et
p
ar
a
m
et
er
s
,
w
h
ic
h
m
u
s
t
b
e
s
o
lv
ed
u
s
in
g
t
h
e
s
er
v
er
i
n
en
cr
y
p
ted
f
o
r
m
.
T
h
er
ef
o
r
e,
a
"
r
eg
u
lar
"
co
m
p
u
ter
,
b
u
t
w
it
h
l
i
m
ited
co
m
p
u
ti
n
g
r
e
s
o
u
r
ce
s
,
c
an
s
er
v
e
a
s
a
clie
n
t.
I
n
t
h
is
ca
s
e,
th
e
s
er
v
er
ac
t
s
as
an
id
ea
l
s
u
p
er
co
m
p
u
ter
t
h
at
th
e
clien
t
ca
n
u
s
e
o
n
a
co
n
tr
ac
tu
al
b
asis
to
s
o
lv
e
it.
T
h
is
clien
t
-
s
er
v
er
in
ter
ac
tio
n
ca
n
b
e
g
iv
e
n
t
h
e
f
o
llo
w
i
n
g
p
r
o
to
co
l f
o
r
m
(
s
ee
[
8
]
)
.
L
et
th
e
clie
n
t
n
ee
d
to
s
o
lv
e
s
o
m
e
co
m
p
u
ta
tio
n
all
y
-
co
m
p
l
ex
p
r
o
b
lem
Z
,
d
ep
en
d
in
g
o
n
th
e
s
ec
r
et
p
ar
am
eter
α
:
Z
(
α
)
.
Su
p
p
o
s
e
th
at
th
er
e
is
a
ce
r
tain
alg
o
r
ith
m
(
s
ch
e
m
e)
A
f
o
r
s
o
lv
i
n
g
p
r
o
b
lem
Z
(
α
)
,
w
h
ich
ca
n
b
e
ef
f
icie
n
tl
y
i
m
p
le
m
e
n
ted
u
s
i
n
g
t
h
e
co
m
p
u
ti
n
g
r
eso
u
r
ce
s
o
f
th
e
s
er
v
er
,
b
u
t
n
o
t
o
n
th
e
cl
ie
n
t sid
e.
P
r
o
to
co
l Z
:
i)
T
h
e
clien
t
d
ec
o
m
p
o
s
es
A
l
g
o
r
ith
m
A
in
to
t
w
o
A
l
g
o
r
ith
m
s
A
1
an
d
A
2
,
s
o
th
at
th
r
ee
co
n
d
itio
n
s
ar
e
m
et
:
f
ir
s
tl
y
,
s
o
l
v
i
n
g
a
lg
o
r
it
h
m
s
A
1
an
d
A
2
allo
w
s
s
o
l
v
i
n
g
p
r
o
b
le
m
Z
;
s
ec
o
n
d
l
y
,
t
h
e
A
1
al
g
o
r
ith
m
ca
n
d
ep
en
d
o
n
th
e
s
ec
r
et
p
ar
a
m
e
ter
,
an
d
th
e
A
2
alg
o
r
it
h
m
ei
th
er
d
o
es
n
o
t
d
ep
en
d
o
n
th
e
s
ec
r
et
p
ar
am
ete
r
α
at
all,
o
r
th
e
tim
e
r
eq
u
ir
ed
f
o
r
th
e
s
er
v
er
to
r
ev
e
al
th
e
s
ec
r
et
f
r
o
m
t
h
e
A
2
al
g
o
r
ith
m
is
u
n
ac
ce
p
tab
le
f
o
r
it.
T
h
ir
d
ly
,
t
h
e
clie
n
t c
a
n
ca
lcu
late
A
1
q
u
ick
l
y
e
n
o
u
g
h
,
ii)
t
h
e
clie
n
t
s
o
lv
e
s
A
1
,
an
d
s
e
n
d
s
t
h
e
A
2
to
t
h
e
s
er
v
er
,
iii)
t
h
e
s
er
v
er
s
o
lv
e
s
t
h
e
co
m
p
u
tatio
n
all
y
-
co
m
p
lex
p
r
o
b
le
m
A
2
,
an
d
r
etu
r
n
s
t
h
e
r
esu
lt
o
f
th
e
ca
lcu
latio
n
to
th
e
clien
t
,
iv
)
t
h
e
clie
n
t,
h
av
i
n
g
r
ec
eiv
ed
th
e
r
es
u
lt
o
f
c
o
m
p
u
ti
n
g
t
h
e
co
m
p
u
tatio
n
al
l
y
-
co
m
p
le
x
p
r
o
b
lem
A
2
f
r
o
m
t
h
e
s
er
v
er
,
s
o
lv
es
t
h
e
o
r
ig
in
al
p
r
o
b
le
m
Z
.
I
t
s
h
o
u
ld
b
e
n
o
ted
th
at,
g
e
n
er
all
y
s
p
ea
k
in
g
,
th
e
o
b
tain
ed
s
o
lu
tio
n
to
P
r
o
b
lem
Z
m
a
y
n
o
t
b
e
a
s
ec
r
et.
Fo
r
ex
a
m
p
le,
s
u
p
p
o
s
e
t
h
e
cli
en
t
n
ee
d
s
to
co
m
p
u
te
y
=
x
d
mod
n
,
w
h
er
e
d
is
t
h
e
clie
n
t
'
s
s
ec
r
et
p
ar
am
eter
,
w
h
ile
i
n
te
g
er
s
n
an
d
e
s
u
c
h
th
at
ed
≡
1
(
φ
(
n
)
)
,
ar
e
p
u
b
lic.
T
h
e
in
teg
er
n
i
s
th
e
p
r
o
d
u
ct
o
f
t
h
e
s
ec
r
et
p
r
i
m
e
’
s
p
an
d
q
.
I
f
t
h
e
i
n
ter
ce
p
to
r
k
n
o
w
s
th
e
n
u
m
b
er
s
y
,
x
an
d
n
,
t
h
e
n
it
is
al
m
o
s
t
i
m
p
o
s
s
ib
le
to
d
eter
m
i
n
e
t
h
e
s
ec
r
et
p
ar
am
eter
d
an
y
w
a
y
,
a
n
d
th
i
s
p
r
o
b
lem
is
k
n
o
w
n
as t
h
e
d
is
cr
ete
lo
g
ar
ith
m
p
r
o
b
le
m
.
W
e
n
ee
d
th
e
f
o
llo
w
i
n
g
g
e
n
er
all
y
ac
ce
p
ted
d
ef
in
i
tio
n
s
[
8
]
:
-
Def
i
n
itio
n
1
.
W
e
s
a
y
th
at
a
c
o
m
p
u
tatio
n
all
y
-
co
m
p
lex
p
r
o
b
le
m
i
s
s
o
l
v
ab
le
b
y
s
o
m
e
p
r
o
to
co
l
if
t
h
e
clie
n
t
r
ec
eiv
es
a
s
o
lu
tio
n
to
th
e
o
r
ig
i
n
al
p
r
o
b
lem
a
s
a
r
esu
lt
o
f
e
x
e
cu
ti
n
g
ea
c
h
s
tep
o
f
t
h
is
p
r
o
to
co
l.
I
n
all
ca
s
es,
b
y
a
s
o
lu
tio
n
w
e
m
ea
n
a
n
ap
p
r
o
x
i
m
ate
s
o
l
u
tio
n
.
T
h
e
task
th
a
t
th
e
clien
t
s
e
n
d
s
to
th
e
s
er
v
er
is
f
ir
s
t
r
ed
u
ce
d
to
a
ce
r
tain
s
ch
e
m
e,
ac
co
r
d
in
g
to
w
h
ic
h
it
w
ill
b
e
s
o
lv
ed
o
n
a
s
u
p
er
co
m
p
u
ter
.
T
h
at
is
,
th
e
clie
n
t
o
r
d
er
s
th
e
s
er
v
er
to
s
o
lv
e
t
h
e
p
r
o
b
lem
ac
co
r
d
in
g
to
s
o
m
e
s
c
h
e
m
e
(
alg
o
r
ith
m
)
w
i
th
a
g
iv
e
n
ac
c
u
r
ac
y
.
-
Def
i
n
itio
n
2
.
W
e
w
ill
s
a
y
t
h
at
a
p
r
o
to
co
l
is
s
ec
u
r
e
if
th
e
cli
en
t
'
s
s
ec
r
et
p
ar
a
m
eter
s
ca
n
n
o
t
b
e
d
ec
lass
if
ied
d
u
r
in
g
in
ter
ac
tio
n
w
it
h
th
e
s
er
v
er
.
Mo
r
eo
v
er
,
if
th
e
s
er
v
er
d
eter
m
i
n
es
a
ce
r
tain
s
et,
th
e
elem
en
ts
o
f
w
h
ic
h
ar
e
p
r
o
b
ab
le
s
ec
r
et
p
ar
am
eter
s
,
th
en
th
e
ca
r
d
in
al
it
y
o
f
th
e
s
et
m
u
s
t
b
e
at
least
co
u
n
tab
le
(
th
is
ex
cl
u
d
es
th
e
p
r
o
b
a
b
ilis
tic
ap
p
r
o
ac
h
an
d
th
e
p
o
s
s
ib
ilit
y
o
f
e
n
u
m
er
atio
n
)
.
T
h
e
f
o
llo
w
i
n
g
co
n
ce
p
ts
ar
e
als
o
im
p
o
r
tan
t.
-
Def
i
n
itio
n
3
.
A
n
ac
ti
v
e
attac
k
is
a
ca
s
e
w
h
en
t
h
e
s
er
v
er
ca
n
s
en
d
f
alse
d
ec
is
io
n
s
to
th
e
clien
t.
A
p
r
o
to
co
l
is
ca
lle
d
r
esis
tan
t
to
ac
tiv
e
attac
k
if
th
e
clien
t
ca
n
v
er
if
y
th
e
s
o
lu
tio
n
r
ec
eiv
ed
f
r
o
m
th
e
s
er
v
e
r
w
it
h
i
n
a
r
ea
s
o
n
ab
le
ti
m
e
f
o
r
th
e
clie
n
t.
Fo
r
ex
a
m
p
le,
if
t
h
e
s
er
v
er
s
en
d
s
t
h
e
clie
n
t
a
n
ap
p
r
o
x
i
m
ate
s
o
l
u
ti
o
n
x
o
f
s
o
m
e
m
atr
i
x
eq
u
atio
n
Ax
=f
,
t
h
e
n
t
h
e
clie
n
t
ca
n
v
er
i
f
y
t
h
e
s
er
v
er
's
co
m
p
u
tatio
n
r
e
s
u
lt
b
y
s
i
m
p
l
y
m
u
ltip
l
y
in
g
t
h
e
m
atr
ix
A
b
y
t
h
e
v
ec
to
r
x
,
w
h
ich
s
h
o
u
ld
b
e
ap
p
r
o
x
i
m
atel
y
e
q
u
al
to
t
h
e
v
ec
to
r
f
.
T
h
at
is
,
th
e
clien
t so
l
v
es a
d
ir
ec
t p
r
o
b
lem
.
-
Def
i
n
itio
n
4
.
W
e
s
a
y
t
h
at
a
p
r
o
to
co
l
is
co
r
r
ec
t
if
th
e
to
tal
ti
m
e
r
eq
u
ir
ed
to
i
m
p
le
m
e
n
t
t
h
e
p
r
o
to
co
l
is
less
th
an
th
e
t
i
m
e
t
h
e
clie
n
t
s
o
lv
es
t
h
e
p
r
o
b
le
m
o
n
it
s
o
w
n
,
w
it
h
o
u
t
t
h
e
h
elp
o
f
t
h
e
s
er
v
er
.
I
n
t
h
i
s
ca
s
e,
C
omm
(
α
)
,
C
omp
C
(
β
)
,
C
omp
S
(
γ
)
C
o
m
m
(
α
)
-
d
en
o
te
th
e
ti
m
e
r
eq
u
ir
ed
to
tr
an
s
m
it
a
m
ess
a
g
e
α
b
et
w
ee
n
th
e
s
er
v
er
an
d
t
h
e
cli
en
t,
th
e
t
i
m
e
t
h
e
clie
n
t
e
x
ec
u
t
es
alg
o
r
it
h
m
β
an
d
t
h
e
ti
m
e
it
tak
es
to
e
x
ec
u
te
th
e
alg
o
r
ith
m
γ
b
y
t
h
e
s
er
v
er
,
r
esp
ec
tiv
el
y
.
An
d
b
y
T
(
Z
)
w
e
d
en
o
te
th
e
ti
m
e
r
eq
u
ir
ed
t
o
im
p
le
m
en
t
th
e
p
r
o
to
co
l
Z
.
I
f
s
o
m
e
alg
o
r
i
th
m
β
is
n
o
t
ca
lcu
lated
at
all
o
n
th
e
clien
t's
s
id
e,
th
en
w
e
w
il
l
w
r
ite
C
omp
C
(
β
)
=
∞
.
T
h
e
tim
e
T
(
Z
)
r
eq
u
ir
ed
to
im
p
le
m
en
t
p
r
o
to
co
l
Z
w
ill
n
o
t
in
clu
d
e
t
h
e
ti
m
e
r
eq
u
ir
ed
b
y
t
h
e
clien
t
to
test
th
e
p
r
o
to
co
l
f
o
r
r
esis
tan
c
e
to
an
ac
tiv
e
attac
k
.
T
h
at
is
,
T
(
Z
)
is
th
e
ti
m
e
r
eq
u
ir
ed
to
im
p
le
m
e
n
t
th
e
Z
p
r
o
to
co
l,
if
th
e
s
er
v
er
d
o
es
n
o
t
d
ev
iate
f
r
o
m
t
h
e
p
r
o
to
co
l,
th
at
i
s
,
it
s
en
d
s
o
n
l
y
t
h
e
co
r
r
ec
t
d
ec
is
io
n
s
to
th
e
clien
t
(
in
t
h
i
s
ca
s
e
,
w
e
s
p
ea
k
o
f
a
p
ass
iv
e
attac
k
,
th
at
i
s
,
th
e
r
ea
l
attac
k
o
cc
u
r
s
b
y
an
in
f
o
r
m
atio
n
i
n
ter
ce
p
to
r
)
.
T
h
er
e
is
an
ex
p
lan
atio
n
f
o
r
th
is
:
if
th
e
s
er
v
er
s
e
n
d
s
a
f
alse
s
o
lu
tio
n
to
s
o
m
e
co
m
p
u
t
atio
n
all
y
co
m
p
le
x
p
r
o
b
lem
,
an
d
th
e
c
lien
t
d
etec
t
s
th
i
s
w
it
h
i
n
an
ac
ce
p
tab
le
ti
m
e
f
o
r
it,
t
h
en
t
h
e
g
o
al
is
n
o
t
ac
h
iev
ed
,
t
h
at
is
,
t
h
e
p
r
o
to
co
l is n
o
t i
m
p
le
m
en
ted
.
T
h
er
ef
o
r
e,
it is
ad
v
is
ab
le
to
d
en
o
te
b
y
T
(
Z
)
-
th
e
t
i
m
e
r
eq
u
ir
ed
o
n
l
y
w
i
th
a
c
lear
i
m
p
le
m
en
ta
tio
n
o
f
t
h
e
Z
p
r
o
to
co
l.
A
ll
co
n
s
id
er
ed
p
r
o
to
c
o
ls
in
t
h
e
ar
ticle
w
i
ll
b
e
co
r
r
ec
t,
b
ec
au
s
e
w
e
w
ill
a
s
s
u
m
e
th
a
t
t
h
e
task
i
s
n
o
t
ca
lcu
lated
at
all
o
n
th
e
clie
n
t
'
s
s
id
e,
o
r
it
is
ca
lcu
lated
in
an
u
n
ac
ce
p
tab
le
ti
m
e.
T
h
er
ef
o
r
e,
th
e
co
n
ce
p
t
o
f
co
r
r
ec
tn
ess
w
i
ll
b
e
r
elati
v
e
a
n
d
d
ep
en
d
s
o
n
a
s
p
ec
i
f
ic
cla
s
s
o
f
p
r
o
b
le
m
s
.
E
ac
h
ti
m
e
t
h
e
co
r
r
ec
tn
ess
o
f
t
h
e
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2502
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
22
,
No
.
3
,
J
u
n
e
2
0
2
1
:
1
6
5
0
-
1
6
5
8
1652
p
r
o
to
co
l
w
ill
b
e
s
u
b
s
ta
n
tiated
th
at
th
e
co
m
p
u
tatio
n
all
y
-
co
m
p
lex
p
ar
t
A
2
o
f
th
e
p
r
o
b
lem
Z
(
α
)
is
tr
an
s
f
er
r
ed
to
th
e
s
er
v
er
,
a
n
d
th
e
clie
n
t n
ee
d
s
to
s
o
lv
e
t
h
e
co
m
p
u
tat
io
n
all
y
ea
s
y
tas
k
A
1
.
2.
RE
S
E
ARCH
M
E
T
H
O
D
L
et
M
b
e
a
co
m
p
lete
m
e
tr
ic
s
p
ac
e
an
d
B
a
co
n
tin
u
o
u
s
o
p
er
ato
r
tak
in
g
an
ele
m
en
t
f
r
o
m
M
to
its
elf
,
th
at
is
;
B
∶
M
→
M
.
T
h
e
co
m
p
lete
n
es
s
o
f
th
e
s
p
ac
e
M
is
n
ec
es
s
ar
y
f
o
r
th
e
p
o
s
s
ib
ilit
y
o
f
f
i
n
d
in
g
a
n
ap
p
r
o
x
i
m
ate
s
o
l
u
tio
n
.
Gen
er
all
y
s
p
ea
k
i
n
g
,
if
M
is
as
s
u
m
ed
to
b
e
an
ar
b
itra
r
y
m
e
tr
ic
s
p
ac
e,
th
en
s
o
m
e
p
r
o
b
lem
s
m
a
y
t
u
r
n
o
u
t
to
b
e
alg
eb
r
aic.
Fo
r
ex
am
p
le,
if
M
co
n
s
is
ts
o
f
t
w
o
n
u
m
b
er
s
0
an
d
1
,
th
en
th
e
p
r
o
b
lem
o
f
f
i
n
d
i
n
g
an
ap
p
r
o
x
i
m
ate
s
o
lu
tio
n
as s
u
ch
i
s
n
o
t
w
o
r
th
i
t
.
A
s
s
h
o
w
n
w
h
er
e
x
∈
M,
b
∈
M.
C
o
n
s
id
er
th
e
p
r
o
b
lem
;
Bx
=
b
,
(
1
)
Su
p
p
o
s
e
th
a
t p
r
o
b
le
m
(
1
)
is
u
n
iq
u
el
y
s
o
lv
ab
le.
L
et
t
h
e
clie
n
t n
ee
d
s
to
ap
p
r
o
x
i
m
atel
y
s
o
l
v
e
a
co
m
p
u
tat
io
n
all
y
-
co
m
p
le
x
i
n
(
1
)
w
it
h
r
esp
ec
t
to
th
e
u
n
k
n
o
w
n
x
.
T
o
f
in
d
an
ap
p
r
o
x
i
m
ate
s
o
l
u
tio
n
o
n
a
co
m
p
u
ter
,
in
m
a
n
y
ca
s
es
it
is
r
eq
u
ir
ed
to
r
e
d
u
ce
th
e
eq
u
atio
n
to
a
d
is
cr
ete
an
alo
g
u
e.
Ho
w
ev
er
,
w
e
w
ill
p
r
esen
t
s
e
v
er
al
p
r
o
to
co
ls
f
o
r
s
o
lv
i
n
g
in
(
1
)
o
n
l
y
at
th
e
id
eo
lo
g
ical
lev
el,
s
i
n
ce
th
e
co
n
s
id
er
ed
(
1
)
,
g
en
er
all
y
s
p
ea
k
in
g
,
is
ab
s
tr
ac
t.
T
ask
Z
2
:
T
h
e
clien
t
n
ee
d
s
to
ap
p
r
o
x
i
m
a
tel
y
s
o
lv
e
(
1
)
f
o
r
an
u
n
k
n
o
w
n
x
∈
M.
Su
p
p
o
s
e
t
h
at
tr
a
n
s
f
o
r
m
atio
n
B
i
s
a
s
ec
r
et
ele
m
e
n
t
o
f
t
h
e
clie
n
t,
an
d
t
h
e
r
ig
h
t
-
h
an
d
s
id
e
b
∈
M
is
n
o
t
a
s
ec
r
et.
W
e
also
r
eq
u
ir
e
th
at
th
e
s
o
l
u
tio
n
to
(
1
)
r
e
m
ain
a
s
ec
r
et.
2
.
1
.
P
r
o
t
o
c
o
l
−
T
h
e
clien
t
f
in
d
s
a
b
ij
ec
tiv
e
o
p
er
ato
r
at
r
an
d
o
m
D
:
M
→
M
.
Nex
t,
it
c
alcu
late
s
th
e
co
m
p
o
s
itio
n
BD
≡
G
an
d
s
en
d
s
t
h
e
s
er
v
er
to
s
o
lv
e
t
h
e
eq
u
atio
n
w
i
th
ac
c
u
r
ac
y
ε:
Gy
=
b
,
w
h
ile
t
h
e
clie
n
t k
ee
p
s
o
p
er
ato
r
D
s
ec
r
et.
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
eq
u
atio
n
G
y
=
b
an
d
r
etu
r
n
s
to
t
h
e
clie
n
t a
n
ap
p
r
o
x
i
m
ate
s
o
lu
tio
n
y
.
−
T
h
e
clien
t f
i
n
d
s
a
n
ap
p
r
o
x
i
m
at
e
s
o
lu
tio
n
to
(
1
)
b
y
t
h
e
f
o
r
m
u
l
a
;
x
=
Dy
L
et
T
1
=
C
omp
C
(
D
,
BD
)
b
e
th
e
ti
m
e
r
eq
u
ir
ed
f
o
r
th
e
clie
n
t
to
co
n
s
tr
u
ct
a
b
ij
ec
tiv
e
o
p
er
ato
r
D
an
d
ca
lcu
late
t
h
e
co
m
p
o
s
itio
n
B
D,
T
2
C
omm
(
G
)
is
th
e
ti
m
e
r
eq
u
ir
ed
to
tr
an
s
m
it
a
m
e
s
s
a
g
e
G
to
th
e
s
er
v
er
,
T
3
=
C
omp
s
(
y
:
Gy
=
b
)
is
t
h
e
ti
m
e
it
tak
e
s
f
o
r
th
e
s
er
v
er
to
s
o
lv
e
th
e
eq
u
atio
n
G
y
=b
,
T
4
=
C
omm
(
y
)
is
th
e
ti
m
e
it
tak
e
s
f
o
r
th
e
s
e
r
v
er
to
s
en
d
th
e
m
e
s
s
a
g
e
y
,
a
n
d
T
5
=
C
omp
C
(
Dy
)
is
th
e
ti
m
e
r
eq
u
ir
ed
b
y
th
e
c
lien
t
to
ca
lc
u
late
D
y
.
B
y
C
omp
C
(
x
∶
Bx
=
b
)
w
e
d
en
o
te
t
h
e
ti
m
e
(
w
h
ich
ca
n
b
e
eq
u
al
to
∞)
r
eq
u
ir
ed
f
o
r
th
e
clien
t
to
s
o
lv
e
(
1
)
w
ith
o
u
t
t
h
e
h
elp
o
f
t
h
e
s
er
v
er
.
L
et
T
(
Z
2
)
=
T
1
+
T
2
+
T
3
+
T
4
+
T
5
<
C
omp
C
(
x
:
Bx
=
b
)
.
State
m
e
n
t
1
.
T
ask
Z
2
is
s
o
l
v
ab
le
b
y
p
r
o
to
co
l
Z
2
if
B
D
a
n
d
D
y
ar
e
ca
lcu
lated
o
n
t
h
e
clie
n
t
s
id
e
,
an
d
th
e
eq
u
atio
n
G
y
=
b
is
s
o
lv
e
d
o
n
th
e
s
er
v
er
.
Fu
r
th
er
,
th
e
Z
2
p
r
o
t
o
co
l
is
R
esis
tan
t
to
ac
tiv
e
attac
k
if
G
y
is
ca
lcu
lated
o
n
t
h
e
clien
t sid
e;
a
n
d
s
ec
u
r
e
.
I
n
d
ee
d
,
w
e
h
a
v
e
;
B
(
Dy
)
=
B
(
D
(
G
−
1
b
)
)
=
BD
D
−
1
B
−
1
b
=
b
,
th
er
ef
o
r
e,
i
f
t
h
e
s
er
v
er
d
o
es
n
o
t
d
ev
iate
f
r
o
m
t
h
e
p
r
o
to
co
l,
th
en
th
e
c
lien
t
f
in
d
s
an
ap
p
r
o
x
i
m
at
e
s
o
lu
tio
n
to
(
1
)
b
y
t
h
e
f
o
r
m
u
la
x
=D
y
,
th
a
t is,
t
h
e
p
r
o
b
lem
Z
2
is
s
o
lv
ab
le
b
y
t
h
is
p
r
o
to
c
o
l.
−
R
esi
s
tan
ce
to
ac
tiv
e
attac
k
.
Sin
ce
t
h
e
s
er
v
er
s
en
d
s
t
h
e
s
o
lu
tio
n
y
to
th
e
clie
n
t,
th
e
c
lien
t
v
er
i
f
ie
s
th
e
s
er
v
er
'
s
co
m
p
u
tatio
n
r
esu
lt
b
y
s
i
m
p
l
y
ca
lc
u
lati
n
g
t
h
e
d
ir
ec
t
p
r
o
b
lem
G
y
,
w
h
ic
h
s
h
o
u
ld
b
e
ap
p
r
o
x
im
ate
l
y
eq
u
al
to
b
:
ρ
(
Gy
,
b
)
<
ε
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
Meth
o
d
s
fo
r
s
ec
u
r
e
clo
u
d
p
r
o
c
ess
in
g
o
f b
ig
d
a
t
a
(
Yer
z
h
a
n
N
.
S
eitku
lo
v
)
1653
−
Secu
r
it
y
.
T
h
e
s
er
v
er
k
n
o
w
s
t
h
e
co
m
p
o
s
itio
n
o
f
th
e
t
w
o
o
p
er
ato
r
s
B
D
=
G,
b
u
t
s
ep
ar
ately
t
h
e
o
p
er
ato
r
s
B
an
d
D
ar
e
n
o
t
k
n
o
w
n
to
th
e
s
er
v
er
.
T
h
er
ef
o
r
e,
th
e
s
ec
r
et
p
ar
am
eter
B
,
as
w
ell
a
s
t
h
e
s
o
lu
tio
n
x
o
f
(
1
)
,
r
e
m
ain
s
ec
r
et
f
r
o
m
t
h
e
s
er
v
er
.
C
o
r
r
ec
tn
ess
o
f
t
h
e
p
r
o
to
co
l
Z
2
.
C
o
n
s
tr
u
cti
n
g
an
ar
b
itra
r
y
b
ij
ec
tiv
e
o
p
er
ato
r
D
is
o
f
te
n
le
s
s
d
if
f
ic
u
l
t
th
an
f
i
n
d
in
g
a
s
o
lu
tio
n
to
an
ar
b
itra
r
y
(
1
)
;
th
er
ef
o
r
e,
th
e
ass
u
m
p
tio
n
T
(
Z
2
)
<
C
omp
C
(
x
:
Bx
=
b
)
,
w
h
ic
h
d
eter
m
in
e
s
th
e
co
r
r
ec
tn
es
s
o
f
th
e
p
r
o
to
co
l,
is
j
u
s
tif
ied
.
E
x
a
m
p
le.
S
u
p
p
o
s
e
th
e
clie
n
t
n
ee
d
s
to
s
o
lv
e
t
h
e
eq
u
atio
n
5
x
=1
5
0
,
w
h
er
e
th
e
n
u
m
b
er
5
is
th
e
cl
ien
t
's s
ec
r
et
p
ar
a
m
eter
.
2
.
2
.
P
r
o
t
o
c
o
l
′
−
L
et
3
b
e
a
r
an
d
o
m
s
ec
r
et
n
u
m
b
er
tak
en
b
y
t
h
e
cl
ien
t.
No
w
t
h
e
p
r
o
d
u
ct
5
*
3
=1
5
an
d
t
h
e
r
i
g
h
t
s
id
e
1
5
0
th
e
clien
t se
n
d
s
to
th
e
s
er
v
er
.
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
eq
u
atio
n
1
5
y
=1
5
0
an
d
r
ec
eiv
es th
e
n
u
m
b
er
y
=
1
0
,
w
h
ic
h
it
s
en
d
s
to
th
e
clien
t.
−
T
h
e
clien
t f
i
n
d
s
a
s
o
l
u
tio
n
to
t
h
e
o
r
ig
i
n
al
eq
u
atio
n
b
y
th
e
f
o
r
m
u
la
x
=3
*
1
0
=3
0
.
T
ask
Z
3
:
T
h
e
clien
t
n
ee
d
s
to
ap
p
r
o
x
i
m
atel
y
s
o
lv
e
(
1
)
.
Su
p
p
o
s
e
th
at
t
h
e
clien
t
's
s
ec
r
et
p
ar
am
eter
i
s
th
e
r
ig
h
t
-
h
an
d
s
id
e
b
o
f
th
e
e
q
u
atio
n
,
a
n
d
o
p
er
ato
r
B
is
n
o
t
a
s
ec
r
et.
W
e
also
r
eq
u
ir
e
th
at
th
e
s
o
l
u
tio
n
to
(
1
)
r
e
m
ain
a
s
ec
r
et.
2
.
3
.
P
r
o
t
o
c
o
l
−
T
h
e
clien
t r
an
d
o
m
l
y
f
in
d
s
b
ij
ec
tiv
e
o
p
er
ato
r
s
D,
K:
M
→
M.
Nex
t,
ca
lcu
lates KB
D
≡
G,
K
b
≡
g
an
d
s
en
d
s
th
e
m
to
th
e
s
er
v
er
s
o
th
at
it
s
o
lv
es t
h
e
f
o
llo
w
i
n
g
eq
u
atio
n
w
i
th
ac
cu
r
ac
y
ε
G
y
=
g
,
th
e
clie
n
t k
ee
p
s
t
h
e
D
a
n
d
K
o
p
er
ato
r
s
as secr
ets.
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
eq
u
atio
n
G
y
=
g
a
n
d
r
etu
r
n
s
a
n
ap
p
r
o
x
im
ate
s
o
l
u
tio
n
y
to
th
e
clie
n
t.
−
T
h
e
clien
t f
i
n
d
s
a
n
ap
p
r
o
x
i
m
at
e
s
o
lu
tio
n
to
(
1
)
b
y
t
h
e
f
o
r
m
u
l
a
;
x
=
D
y
.
L
et
T
1
=
C
omp
C
(
D
,
K
,
KBD
)
b
e
th
e
ti
m
e
r
eq
u
ir
ed
f
o
r
th
e
clien
t
to
b
u
ild
r
ev
er
s
ib
le
o
p
er
ato
r
s
D
an
d
K
an
d
ca
lcu
late
t
h
e
co
m
p
o
s
itio
n
KB
D,
T
2
=
C
omm
(
G
,
g
)
is
th
e
ti
m
e
r
eq
u
ir
ed
to
tr
an
s
m
it
t
h
e
m
e
s
s
a
g
es
G,
g
to
th
e
s
er
v
er
,
T
3
=
C
omp
S
(
y
:
Gy
=
g
)
is
th
e
ti
m
e
it
tak
es
f
o
r
th
e
s
er
v
er
to
s
o
lv
e
t
h
e
eq
u
atio
n
G
y
=
g
,
T
4
=
C
omm
(
y
)
is
th
e
ti
m
e
it
ta
k
es
f
o
r
th
e
clie
n
t
to
s
en
d
t
h
e
m
e
s
s
a
g
e
y
to
th
e
s
er
v
er
,
an
d
T
5
=
C
omp
C
(
Dy
)
is
th
e
ti
m
e
it
ta
k
es
f
o
r
th
e
cl
ien
t
to
co
m
p
u
te
D
y
.
B
y
C
omp
C
(
x
∶
Bx
=
b
)
w
e
d
en
o
te
th
e
ti
m
e
(
w
h
ic
h
ca
n
b
e
eq
u
al
to
∞)
r
eq
u
ir
ed
f
o
r
t
h
e
cli
en
t to
s
o
l
v
e
(
1
)
w
ith
o
u
t t
h
e
h
e
lp
o
f
th
e
s
er
v
er
.
L
et
T
(
Z
3
)
=
T
1
+
T
2
+
T
3
+
T
4
+
T
5
<
C
omp
C
(
x
:
Bx
=
b
)
.
State
m
e
n
t
2
.
T
ask
Z
3
is
s
o
lv
ab
le
b
y
p
r
o
to
co
l
Z
3
if
KB
D,
Kb
an
d
Dy
ar
e
co
m
p
u
tab
le
o
n
th
e
clien
t
s
id
e,
an
d
G
y
=
g
is
s
o
lv
ab
le
o
n
th
e
s
er
v
er
.
Fu
r
t
h
er
,
th
e
p
r
o
to
co
l
Z
3
is
r
esis
ta
n
t
to
ac
ti
v
e
attac
k
i
f
G
y
is
co
m
p
u
tab
le
o
n
t
h
e
clien
t sid
e;
an
d
s
ec
u
r
e.
I
n
d
ee
d
,
w
e
h
a
v
e
;
B
(
Dy
)
=
B
(
D
(
G
−
1
g
)
)
=
B
(
D
(
D
−
1
B
−
1
K
−
1
g
))=
K
−
1
g
=b
.
Hen
ce
x
=
D
y
.
T
h
at
is
,
th
e
ta
s
k
Z
3
is
r
eso
lv
ab
le
b
y
t
h
e
p
r
o
to
co
l
Z
3
.
−
R
esi
s
tan
ce
to
ac
tiv
e
attac
k
.
Si
n
ce
th
e
s
er
v
er
s
en
d
s
t
h
e
clien
t
an
ap
p
r
o
x
im
ate
s
o
l
u
tio
n
y
,
th
e
clien
t
v
er
i
f
ie
s
it
b
y
ca
lc
u
lati
n
g
i
t
s
i
m
p
l
y
b
y
s
o
lv
in
g
t
h
e
d
ir
ec
t
p
r
o
b
lem
G
y
,
w
h
ic
h
s
h
o
u
ld
b
e
ap
p
r
o
x
i
m
atel
y
eq
u
al
to
g
∶
ρ
(
G
y
,
g
)
<ε
.
−
Secu
r
it
y
.
T
h
e
s
er
v
er
k
n
o
w
s
t
h
e
co
m
p
o
s
itio
n
o
f
t
h
e
o
p
er
ato
r
s
KB
D
=
G,
b
u
t sep
ar
atel
y
t
h
e
o
p
er
ato
r
s
K
an
d
D
ar
e
n
o
t
k
n
o
w
n
to
t
h
e
s
er
v
er
;
th
e
s
er
v
er
al
s
o
k
n
o
w
s
th
e
r
esu
lt
o
f
ca
lc
u
lat
in
g
t
h
e
t
w
o
s
ec
r
et
ele
m
e
n
ts
K
an
d
b
:
Kb
=
g
,
s
o
th
e
o
p
er
ato
r
K
also
r
e
m
ai
n
s
a
s
ec
r
et.
T
h
i
s
m
ea
n
s
th
a
t
ele
m
en
t
b
r
e
m
ai
n
s
s
ec
r
et.
I
t
also
f
o
llo
w
s
f
r
o
m
t
h
is
t
h
at
t
h
e
s
o
lu
tio
n
x
o
f
(
1
)
r
e
m
ai
n
s
a
s
ec
r
et.
C
o
r
r
ec
tn
ess
o
f
t
h
e
p
r
o
to
co
l
Z
3
.
I
n
th
e
g
en
er
al
ca
s
e,
th
e
co
n
s
tr
u
c
tio
n
o
f
ar
b
itr
ar
y
b
ij
ec
tiv
e
o
p
er
ato
r
s
D
an
d
K
is
o
f
te
n
les
s
d
if
f
ic
u
lt
t
h
an
f
i
n
d
in
g
a
s
o
lu
t
io
n
to
an
ar
b
itra
r
y
(
1
)
;
th
er
e
f
o
r
e,
th
e
a
s
s
u
m
p
tio
n
T
(
Z
3
)
<
C
omp
C
(
x
:
Bx
=
b
)
,
w
h
ic
h
d
eter
m
i
n
es
th
e
co
r
r
ec
tn
es
s
o
f
th
e
p
r
o
to
co
l,
is
j
u
s
tif
ied
.
E
x
a
m
p
le.
S
u
p
p
o
s
e
th
e
clien
t
n
ee
d
s
to
s
o
lv
e
t
h
e
eq
u
at
io
n
5
x
=1
5
0
,
an
d
th
e
n
u
m
b
er
1
5
0
is
th
e
clien
t
's s
ec
r
et
p
ar
a
m
e
ter
.
2
.
4
.
P
r
o
t
o
c
o
l
′
−
L
et
K
=
3
an
d
D
=
1
0
b
e
r
an
d
o
m
s
ec
r
et
n
u
m
b
er
s
ta
k
e
n
b
y
t
h
e
clie
n
t.
No
w
t
h
e
clie
n
t
s
en
d
s
th
e
ca
lcu
la
tio
n
r
esu
lt
s
o
f
t
h
e
p
r
o
d
u
cts 3
*
5
*
1
0
=
1
5
0
an
d
3
*
1
5
0
=
4
5
0
t
o
th
e
s
er
v
er
.
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
eq
u
atio
n
1
5
0
y
=
4
5
0
an
d
r
ec
eiv
es th
e
n
u
m
b
er
y
=
3
,
w
h
ic
h
it
s
en
d
s
to
th
e
clien
t.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2502
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
22
,
No
.
3
,
J
u
n
e
2
0
2
1
:
1
6
5
0
-
1
6
5
8
1654
−
T
h
e
clien
t f
i
n
d
s
a
s
o
l
u
tio
n
to
t
h
e
o
r
ig
i
n
al
eq
u
atio
n
b
y
th
e
f
o
r
m
u
la
x
=
D
*
y
=
1
0
*
3
=
3
0
.
I
n
p
r
o
to
co
ls
Z
2
an
d
Z
3
,
it
w
as
as
s
u
m
ed
th
at
i
n
(
1
)
th
e
s
ec
r
et
p
ar
a
m
eter
is
eit
h
er
o
p
er
ato
r
B
o
r
th
e
r
ig
h
t
-
h
an
d
s
id
e
o
f
b
.
So
m
eti
m
es
it
m
a
y
tu
r
n
o
u
t
th
at
th
e
s
ec
r
et
p
ar
am
eter
s
o
f
th
e
clien
t
ar
e
b
o
th
o
p
er
ato
r
B
an
d
th
e
r
ig
h
t
s
id
e
o
f
b
.
I
n
th
is
ca
s
e,
th
e
task
f
o
r
th
e
clien
t
is
s
i
m
p
li
f
ied
,
s
in
ce
t
h
e
les
s
th
e
s
er
v
er
k
n
o
w
s
ab
o
u
t
th
e
tas
k
i
n
q
u
esti
o
n
,
th
e
m
o
r
e
d
if
f
ic
u
lt i
t is
f
o
r
h
i
m
to
r
ec
o
g
n
ize
it.
P
r
o
b
lem
Z
3
∗
:
S
u
p
p
o
s
e
th
e
clie
n
t
n
ee
d
s
to
ap
p
r
o
x
i
m
atel
y
s
o
l
v
e
i
n
(
1
)
,
k
ee
p
in
g
th
e
o
p
er
ato
r
B
,
th
e
r
ig
h
t
-
h
an
d
s
id
e
b
an
d
th
e
d
esi
r
ed
s
o
lu
tio
n
x
s
ec
r
et.
T
h
e
Z
3
p
r
o
to
co
l
is
u
s
ed
f
o
r
th
i
s
tas
k
.
St
ate
m
e
n
t
2
’
:
T
as
k
Z
3
∗
is
s
o
l
v
ab
le
b
y
p
r
o
to
co
l
Z
3
if
KB
D,
Kb
an
d
D
y
ar
e
co
m
p
u
tab
le
o
n
th
e
clie
n
t
s
id
e,
an
d
p
r
o
to
co
l
Z
3
is
r
esis
ta
n
t
to
ac
tiv
e
attac
k
i
f
G
y
is
co
m
p
u
tab
le
o
n
th
e
cl
ien
t
s
id
e;
an
d
s
ec
u
r
e,
i.e
.
,
th
e
s
ec
r
ec
y
o
f
B
an
d
b
is
m
ai
n
t
ai
n
ed
.
I
t
is
en
o
u
g
h
to
s
h
o
w
t
h
e
s
ec
u
r
it
y
o
f
th
e
p
r
o
to
co
l.
T
h
e
s
er
v
er
k
n
o
w
s
t
h
e
co
m
p
o
s
it
io
n
o
f
t
h
e
o
p
er
ato
r
s
=
,
b
u
t
s
ep
ar
ately
th
e
o
p
er
ato
r
s
K,
B
an
d
D
ar
e
n
o
t
k
n
o
w
n
to
th
e
s
er
v
er
,
w
h
ich
m
e
an
s
th
at
B
r
em
ai
n
s
s
ec
r
et.
Als
o
,
th
e
s
er
v
er
k
n
o
w
s
t
h
e
r
esu
l
t
o
f
ca
lc
u
l
atin
g
t
w
o
s
ec
r
et
ele
m
en
t
s
K
a
n
d
b
*
Kb
=
g
,
s
o
th
e
ele
m
e
n
t b
also
r
e
m
ai
n
s
s
ec
r
et.
I
t a
ls
o
f
o
llo
w
s
f
r
o
m
th
i
s
t
h
at
t
h
e
s
o
lu
tio
n
x
o
f
(
1
)
r
em
ai
n
s
a
s
ec
r
et.
C
o
n
s
id
er
th
e
s
y
s
te
m
o
f
al
g
eb
r
aic
lin
ea
r
eq
u
atio
n
s
Bx
=
b
(
2
)
w
h
er
e
B
is
a
r
ec
tan
g
u
lar
m
×
n
m
atr
ix
w
it
h
ele
m
en
t
s
B
[
i]
[
j
]
,
(
i
=
0
,
.
.
.
,
m
-
1
;
j
=
0
,
.
.
.
,
n
-
1
)
,
an
d
b
is
a
v
ec
to
r
o
f
le
n
g
th
m
w
it
h
ele
m
e
n
ts
b
[
k
]
,
(
k
=
0
,
.
.
.
,
m
-
1
)
.
Su
p
p
o
s
e
th
at
s
y
s
te
m
(
2
)
is
co
n
s
i
s
ten
t,
th
at
is
,
i
t
h
as
at
least
o
n
e
s
o
l
u
tio
n
.
Vec
to
r
b
is
th
e
clie
n
t
's
s
ec
r
et
p
ar
a
m
ete
r
.
T
h
en
p
r
o
b
lem
(
2
)
ac
co
r
d
in
g
to
th
e
L
E
p
r
o
to
co
l
f
r
o
m
[
1
]
is
s
o
lv
ed
as
f
o
llo
w
s
.
2
.
5
.
P
r
o
t
o
c
o
l
−
T
h
e
clien
t ta
k
e
s
an
n
-
d
i
m
e
n
s
io
n
al
v
ec
to
r
at
r
an
d
o
m
w
=
(
w
[
0
]
,
.
.
.
w
[
n
−
1
]
)
and calculates
b
−
Bw
=
g
by the algorithm
for(i = 0; i < m; i + +)
{
c = 0;
for(j = 0; j < n; j + +)
c = c + B[i][j] * w[j];
g[i] = b[i] − c;
}
No
w
t
h
e
clien
t is se
n
d
in
g
to
th
e
s
er
v
er
th
e
eq
u
at
io
n
By
=
g
,
an
d
k
ee
p
s
th
e
v
ec
to
r
w
as secr
et.
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
eq
u
atio
n
By
=
g
an
d
r
etu
r
n
s
an
ap
p
r
o
x
i
m
ate
s
o
lu
tio
n
to
t
h
e
c
lie
n
t
y
=
(
y
[
0
]
,
.
.
.
y
[
n
−
1
]
)
.
−
T
h
e
clien
t f
i
n
d
s
a
s
o
l
u
tio
n
to
(
2
)
u
s
in
g
t
h
e
alg
o
r
it
h
m
for(j = 0; j < n; j + +)
x[j] = y[j] + w[j];
T
h
is
s
h
o
w
s
t
h
at
t
h
e
clien
t
n
ee
d
s
to
d
o
o
n
l
y
a
f
e
w
ar
it
h
m
etic
o
p
er
atio
n
s
to
s
o
lv
e
a
s
y
s
te
m
o
f
lin
ea
r
eq
u
atio
n
s
.
T
h
at
is
,
f
o
r
lar
g
e
n
a
n
d
m
,
t
h
e
co
m
p
u
tatio
n
al
co
s
ts
o
f
th
e
clien
t
ar
e
m
u
c
h
les
s
th
a
n
i
f
t
h
e
clie
n
t
s
o
l
v
ed
th
e
s
y
s
te
m
o
f
li
n
ea
r
alg
eb
r
aic
(
2
)
w
it
h
o
u
t th
e
h
elp
o
f
t
h
e
s
er
v
er
.
3.
RE
SU
L
T
S AN
D
D
I
SCU
SS
I
O
N
L
i
n
ea
r
p
r
o
b
lem
s
ar
e
esp
ec
ial
l
y
co
m
m
o
n
w
h
e
n
m
o
d
eli
n
g
ec
o
n
o
m
ic
p
r
o
b
le
m
s
,
i
n
t
h
e
p
r
o
b
lem
o
f
f
i
n
d
in
g
t
h
e
ex
tr
e
m
u
m
o
f
a
f
u
n
ctio
n
,
an
d
li
n
ea
r
p
r
o
g
r
a
m
m
i
n
g
.
I
n
g
e
n
er
al,
if
a
ce
r
tai
n
p
r
o
ce
s
s
is
d
escr
ib
ed
b
y
a
lin
ea
r
m
at
h
e
m
a
tical
m
o
d
el,
t
h
en
it
ca
n
b
e
ea
s
il
y
s
o
lv
ed
b
y
t
h
e
m
et
h
o
d
s
d
escr
ib
ed
ab
o
v
e.
I
n
t
h
is
s
ec
tio
n
,
w
e
w
il
l
lo
o
k
at
t
w
o
s
p
ec
i
f
ic
p
r
o
b
l
e
m
s
.
Fir
s
t,
w
e
co
n
s
id
er
th
e
p
r
o
b
lem
o
f
f
i
n
d
i
n
g
t
h
e
ex
tr
e
m
u
m
o
f
a
f
u
n
ctio
n
w
it
h
s
ec
r
et
p
ar
am
eter
s
,
an
d
th
e
n
an
ap
p
lied
p
r
o
b
lem
w
it
h
s
ec
r
et
p
ar
am
eter
s
t
h
at
ar
is
es
w
h
e
n
m
o
d
eli
n
g
ec
o
n
o
m
i
c
p
r
o
ce
s
s
es.
3
.
1
.
P
r
o
ble
m
s
o
f
f
ind
ing
t
he
ex
t
re
m
u
m
o
f
a
f
u
nct
io
n w
it
h secr
et
pa
ra
m
et
er
s
C
o
n
s
id
er
th
e
p
r
o
b
lem
o
f
d
eter
m
i
n
in
g
t
h
e
ex
tr
e
m
u
m
o
f
th
e
f
u
n
ctio
n
:
f
(
x
1
,
…
,
x
n
)
=
∑
∑
a
ij
x
i
x
j
−
n
j
=
1
∑
b
k
x
k
n
k
=
1
n
i
=
1
(
3
)
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
Meth
o
d
s
fo
r
s
ec
u
r
e
clo
u
d
p
r
o
c
ess
in
g
o
f b
ig
d
a
t
a
(
Yer
z
h
a
n
N
.
S
eitku
lo
v
)
1655
s
u
b
j
ec
t to
co
m
m
u
n
icat
io
n
.
∑
2
c
i
x
i
=
P
n
i
=
1
(
4
)
Her
e
a
ij
=
a
ji
.
T
h
e
clien
t
n
ee
d
s
to
f
i
n
d
th
e
e
x
tr
e
m
u
m
o
f
th
e
f
u
n
c
tio
n
(
3
)
,
s
u
b
j
ec
t
to
th
e
co
n
n
ec
tio
n
(
4
)
,
u
s
in
g
th
e
co
m
p
u
ti
n
g
f
ac
ili
ties
o
f
th
e
s
er
v
er
.
I
n
th
is
ca
s
e,
t
h
e
s
er
v
er
d
o
es
n
o
t
n
ee
d
to
k
n
o
w
t
h
e
f
o
llo
w
i
n
g
s
ec
r
et
p
ar
am
eter
s
o
f
th
e
cl
ien
t
:
b
1
,
b
2
,
…
,
b
n
и
P
.
Nu
m
b
e
r
s
a
ij
an
d
c
k
ar
e
n
o
t secr
ets.
P
r
o
t
o
co
l
Q
:
−
T
h
e
clien
t c
o
m
p
o
s
es a
s
y
s
te
m
o
f
lin
ea
r
al
g
eb
r
aic
eq
u
atio
n
s
Aq
=
b
(
5
)
w
h
er
e
b
=
(
b
1
,
b
2
,
…
,
b
n
,
P
)
is
f
r
ee
co
lu
m
n
,
q
=
(
x
1
,
x
2
,
…
,
x
n
,
λ
)
−
u
n
k
n
o
w
n
v
ec
to
r
,
an
d
m
atr
ix
A
h
as
t
h
e
f
o
r
m
.
A
=
(
2
a
11
2
a
12
…
2
a
1n
2
c
1
2
a
12
2
a
22
…
2
a
2n
2
c
2
…
…
…
…
…
2
a
1n
2
a
2n
…
2
a
nn
2
c
n
2
c
1
2
c
2
…
2
c
n
0
)
(
6
)
Nex
t,
th
e
cl
ien
t ta
k
e
s
a
r
an
d
o
m
v
ec
to
r
w
,
co
m
p
u
tes
−
=
,
an
d
s
en
d
s
th
e
eq
u
atio
n
to
t
h
e
s
er
v
er
Ay
=
f
(
7
)
−
T
h
e
s
er
v
er
s
o
lv
es (
7
)
an
d
r
etu
r
n
s
s
o
l
u
tio
n
y
to
th
e
clie
n
t.
−
T
h
e
clien
t f
i
n
d
s
a
s
o
l
u
tio
n
to
(
6
)
b
y
th
e
f
o
r
m
u
la
=
+
an
d
f
i
n
d
s
an
e
x
tr
e
m
al
p
o
in
t f
o
r
f
u
n
ctio
n
(
3
)
s
u
b
j
ec
t to
co
n
s
tr
ain
t (
4
)
.
State
m
e
n
t
3
.
P
o
in
t
x
∗
=
(
x
1
,
x
2
,
…
,
x
n
)
is
an
ex
tr
e
m
e
p
o
in
t,
an
d
p
r
o
to
c
o
l
Q
i
s
r
esis
ta
n
t
to
ac
tiv
e
attac
k
;
a
n
d
s
ec
u
r
e.
R
e
s
is
ta
n
ce
to
ac
tiv
e
attac
k
a
n
d
s
ec
u
r
it
y
f
o
llo
w
s
f
r
o
m
t
h
e
L
E
p
r
o
to
co
l f
r
o
m
[
1
]
.
T
o
f
in
d
t
h
e
ex
tr
e
m
u
m
,
th
e
L
a
g
r
an
g
e
m
e
th
o
d
is
u
s
ed
.
T
h
e
L
ag
r
an
g
e
f
u
n
ctio
n
h
a
s
th
e
f
o
r
m
:
L
=
∑
∑
a
ij
x
i
x
j
−
n
j
=
1
∑
b
k
x
k
n
k
=
1
n
i
=
1
+
λ
(
∑
2
c
i
x
i
−
P
)
n
i
=
1
L
et
q
d
en
o
te
t
h
e
co
lu
m
n
(
x
1
,
x
2
,
…
,
x
n
,
λ
)
t
.
T
h
en
t
h
e
ex
tr
e
m
e
p
o
in
t
s
ar
e
f
o
u
n
d
f
r
o
m
t
h
e
s
y
s
te
m
o
f
li
n
e
ar
alg
eb
r
aic
(
5
)
.
3
.
2
.
A
lin
ea
r
pro
g
r
a
m
m
i
ng
t
a
s
k
w
it
h secr
et
pa
ra
m
et
er
s
Ma
n
y
ec
o
n
o
m
ic
tas
k
s
d
ea
l
w
i
th
p
r
o
ce
s
s
i
n
g
a
lar
g
e
s
et
o
f
ec
o
n
o
m
ic
i
n
d
icato
r
s
.
I
n
t
h
is
s
u
b
s
ec
tio
n
we
co
n
s
id
er
a
ty
p
ical
ec
o
n
o
m
ic
p
r
o
b
lem
t
h
at
ca
n
b
e
s
o
lv
ed
o
n
l
y
o
n
v
er
y
p
o
w
er
f
u
l
co
m
p
u
ter
s
.
T
h
e
s
tate
m
e
n
ts
o
f
s
o
m
e
o
f
th
e
p
r
o
b
lem
s
co
n
s
id
er
ed
ar
e
tak
en
f
r
o
m
[
2
5
]
,
an
d
a
ll
co
n
ce
p
ts
o
f
a
p
u
r
ely
ec
o
n
o
m
ic
n
at
u
r
e
ar
e
also
d
ef
in
ed
i
n
th
i
s
w
o
r
k
.
C
o
n
s
id
er
a
m
ac
r
o
ec
o
n
o
m
ic
m
o
d
el
[
2
5
]
,
in
w
h
ic
h
n
p
r
o
d
u
ct
s
G
1
,
…
,
G
n
,
m
co
n
s
u
m
er
s
A
1
,
…
,
A
m
an
d
o
n
e
m
a
n
u
f
ac
t
u
r
er
p
ar
ticip
ate.
L
et
s
o
m
e
p
er
io
d
(
f
o
r
ex
a
m
p
le
,
a
y
ea
r
)
p
r
o
d
u
ce
X
i
u
n
its
o
f
t
h
e
p
r
o
d
u
ct
G
i
.
L
et,
f
u
r
t
h
er
,
t
h
e
v
alu
e
s
P
1
,
…
,
P
m
m
ea
n
,
r
es
p
ec
tiv
el
y
,
th
e
in
co
m
es
o
f
co
n
s
u
m
er
s
A
1
,
…
,
A
m
f
o
r
t
h
e
s
a
m
e
p
er
io
d
.
Su
p
p
o
s
e
th
a
t
ea
ch
co
n
s
u
m
er
s
p
en
d
s
all
h
i
s
i
n
co
m
e
o
n
p
u
r
ch
asi
n
g
p
r
o
d
u
cts
f
r
o
m
t
h
e
m
an
u
f
ac
t
u
r
er
,
an
d
t
h
e
r
elativ
e
u
tili
t
y
o
f
a
u
n
it
o
f
p
r
o
d
u
ct
G
i
f
o
r
co
n
s
u
m
er
A
s
is
esti
m
ated
b
y
t
h
e
n
o
n
-
n
e
g
ati
v
e
n
u
m
b
er
c
i
(
s
)
.
No
n
-
n
eg
at
iv
e
n
-
d
i
m
en
s
io
n
al
v
ec
to
r
x
(
s
)
=
(
x
1
(
s
)
,
…
,
x
n
(
s
)
)
,
w
h
o
s
e
co
m
p
o
n
e
n
t
x
i
(
s
)
is
th
e
n
u
m
b
er
o
f
u
n
it
s
o
f
p
r
o
d
u
ct
G
i
p
u
r
ch
ased
b
y
co
n
s
u
m
er
A
s
,
ass
o
r
t
m
en
t
s
et
o
f
t
h
is
co
n
s
u
m
er
.
L
et
C
=
(
c
ij
)
b
e
a
n
o
n
-
n
e
g
ati
v
e
m
atr
i
x
,
ea
ch
co
lu
m
n
an
d
ea
c
h
r
o
w
o
f
w
h
ic
h
h
a
s
at
least o
n
e
p
o
s
iti
v
e
ele
m
en
t.
L
et
P
1
,
…
,
P
m
b
e
p
o
s
itiv
e
n
u
m
b
er
s
.
P
r
o
b
lem
s
tate
m
en
t: it is r
eq
u
ir
ed
to
f
in
d
a
v
ec
to
r
x
(
s
)
m
a
x
i
m
izi
n
g
f
o
r
m
:
∑
P
s
ln
(
∑
c
i
(
s
)
x
i
(
s
)
n
i
=
1
)
→
ma
x
m
s
=
1
(
8
)
∑
x
i
(
s
)
=
X
i
,
i
=
1
,
…
,
n
,
m
s
=
1
(
9
)
x
i
(
s
)
≥
0
,
i
=
1
,
…
,
n
,
s
=
1
,
…
,
m
(
1
0
)
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2502
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
22
,
No
.
3
,
J
u
n
e
2
0
2
1
:
1
6
5
0
-
1
6
5
8
1656
Her
e
th
e
m
a
x
i
m
izi
n
g
f
u
n
c
tio
n
;
∑
P
s
ln
(
∑
c
i
(
s
)
x
i
(
s
)
)
n
i
=
1
m
s
=
1
is
th
e
e
n
tr
o
p
y
o
f
t
h
e
m
ac
r
o
ec
o
n
o
m
ic
s
y
s
te
m
.
L
et
t
h
e
clie
n
t
n
ee
d
to
s
o
lv
e
p
r
o
b
lem
(
8
)
-
(
1
0
)
.
T
h
e
clien
t
'
s
s
ec
r
et
ele
m
en
t
s
ar
e
m
a
t
r
ix
C
a
n
d
v
ec
to
r
X
=
(
X
1
,
…
,
X
n
)
.
Vec
to
r
P is
n
o
t a
s
ec
r
et.
P
r
o
t
o
co
l
E
:
−
T
h
e
clien
t
f
in
d
s
d
ia
g
o
n
al
m
a
tr
ices
at
r
an
d
o
m
D
j
=
dia
g
(
d
1
j
,
.
.
.
,
d
n
j
)
,
d
i
j
>
0
,
i
=
1
,
2
,
.
.
.
,
n
;
j
=
1
,
…
,
m
an
d
ca
lcu
late
r
i
(
s
)
=
c
i
(
s
)
d
i
(
s
)
.
Fu
r
t
h
er
,
f
o
r
s
=2
,
.
.
.
,
m
co
m
p
u
te
s
n
k
i
(
s
)
=
d
i
s
d
i
1
,
b
i
=
X
i
d
i
1
an
d
s
en
d
s
t
o
th
e
s
er
v
er
task
(
1
1
)
-
(
1
3
)
:
∑
P
S
ln
(
∑
r
i
(
s
)
z
i
(
s
)
)
→
ma
x
n
i
=
1
m
s
=
1
(
1
1
)
z
i
1
+
∑
k
i
(
s
)
z
i
(
s
)
=
b
i
,
i
=
1
,
…
,
n
m
s
=
2
(
1
2
)
z
i
(
s
)
≥
0
,
i
=
1
,
…
,
n
;
s
=
1
,
…
,
m
(
1
3
)
−
T
h
e
s
er
v
er
s
o
lv
es t
h
e
p
r
o
b
lem
(
1
1
)
-
(
1
3
)
an
d
s
o
lu
tio
n
z
i
(
s
)
r
etu
r
n
s
to
th
e
clien
t.
−
T
h
e
clien
t f
i
n
d
s
a
s
o
l
u
tio
n
to
p
r
o
b
lem
(
8
)
-
(
1
0
)
b
y
t
h
e
f
o
r
m
u
l
a
x
i
(
s
)
=
d
i
s
z
i
(
s
)
(
1
4
)
State
m
e
n
t 4
.
T
ask
(
8
)
-
(
1
0
)
is
s
o
lv
ab
le
b
y
p
r
o
to
co
l E
,
an
d
p
r
o
to
co
l E
is
s
ec
u
r
e.
L
et
's
m
a
k
e
a
r
ep
lace
m
e
n
t
;
x
i
(
s
)
=
d
i
s
z
i
(
s
)
.
T
h
en
,
co
n
s
id
er
in
g
t
h
at
r
i
(
s
)
=
c
i
(
s
)
d
i
s
,
k
i
(
s
)
=
d
i
s
d
i
1
,
b
i
=
X
i
d
i
1
,
co
n
d
itio
n
s
(
8
)
an
d
(
9
)
tak
e
th
e
f
o
r
m
(
1
1
)
an
d
(
1
2
)
,
r
esp
ec
tiv
el
y
.
Fu
r
t
h
er
,
s
i
n
ce
d
i
s
ar
e
p
o
s
itiv
e
n
u
m
b
er
s
,
th
e
n
c
o
n
d
itio
n
(
1
0
)
ca
n
b
e
w
r
itte
n
in
t
h
e
f
o
r
m
o
f
co
n
d
itio
n
(
1
3
)
.
Pro
to
c
o
l secu
r
it
y
.
T
h
e
s
er
v
er
r
ec
eiv
es a
s
y
s
te
m
o
f
eq
u
at
io
n
s
;
r
i
(
s
)
=
c
i
(
s
)
d
i
s
(
1
5
)
k
i
(
s
)
=
d
i
s
d
i
1
,
s
=2
,
…,
m
(
1
6
)
b
i
=
X
i
d
i
1
(
1
7
)
s
y
s
te
m
(
1
5
)
-
(
1
7
)
co
n
tain
s
2
+
u
n
k
n
o
w
n
s
,
an
d
eq
u
atio
n
s
2
n
m
.
T
h
er
ef
o
r
e,
s
y
s
te
m
(
1
5
)
-
(
1
7
)
is
n
o
t
u
n
iq
u
el
y
s
o
lv
ab
le,
t
h
at
is
,
t
h
e
s
er
v
er
w
ill
n
o
t b
e
ab
le
to
d
eter
m
i
n
e
th
e
s
ec
r
et
ele
m
e
n
ts
o
f
th
e
clien
t.
4.
CO
NCLU
SI
O
N
Gen
er
all
y
s
p
ea
k
in
g
,
f
o
r
t
h
e
n
u
m
er
ical
s
o
lu
tio
n
o
f
t
h
e
eq
u
at
i
o
n
G
y
=
b
,
t
h
e
b
ij
ec
tiv
it
y
o
f
t
h
e
o
p
er
ato
r
D
is
in
s
u
f
f
icien
t
(
f
o
r
ex
a
m
p
le
,
co
n
tin
u
it
y
i
s
also
r
eq
u
ir
ed
)
.
T
h
er
ef
o
r
e,
th
is
an
d
o
th
er
p
r
o
t
o
co
ls
th
at
s
o
lv
e
t
h
e
ab
s
tr
ac
t
p
r
o
b
lem
(
1
)
s
h
o
u
ld
b
e
p
er
ce
iv
ed
at
th
e
co
n
ce
p
tu
al
lev
el.
Fu
r
t
h
er
,
s
in
ce
B
an
d
D
ar
e
o
n
e
-
to
-
o
n
e
m
ap
s
,
th
e
eq
u
atio
n
G
y
=b
ca
n
h
a
v
e
o
n
l
y
a
u
n
iq
u
e
s
o
l
u
tio
n
.
I
n
th
e
tas
k
Z
3
∗
it
is
a
s
s
u
m
ed
th
a
t
th
e
s
ec
r
et
p
ar
a
m
eter
s
o
f
t
h
e
cl
ien
t
ar
e
all
ele
m
e
n
t
s
o
f
(
1
)
,
t
h
at
is
,
i
n
f
ac
t,
th
e
s
er
v
er
w
i
ll
o
n
l
y
k
n
o
w
th
e
f
o
r
m
o
f
(
1
)
.
No
te
th
at
in
th
i
s
s
etti
n
g
,
th
e
clien
t
'
s
task
b
ec
o
m
es
les
s
d
if
f
ic
u
lt,
s
in
ce
t
h
e
le
s
s
t
h
e
a
d
v
er
s
ar
y
k
n
o
w
s
ab
o
u
t
th
e
ta
s
k
u
n
d
er
co
n
s
id
er
atio
n
,
t
h
e
m
o
r
e
d
if
f
icu
lt
it
is
to
d
eter
m
in
e
th
e
s
ec
r
et
p
ar
a
m
ete
r
s
.
B
u
t
th
is
d
o
es
n
o
t
co
r
r
esp
o
n
d
to
p
r
ac
tice,
s
in
ce
u
s
u
a
ll
y
t
h
e
in
ter
ested
en
e
m
y
k
n
o
w
s
s
o
m
e
p
ar
a
m
eter
s
o
f
t
h
e
t
ask
.
T
h
er
ef
o
r
e,
in
o
r
d
er
f
o
r
th
e
task
s
u
n
d
er
co
n
s
id
er
atio
n
to
h
av
e
a
p
r
ac
tical
m
ea
n
in
g
,
it
is
d
esira
b
le
to
as
s
u
m
e
t
h
at
th
e
en
e
m
y
k
n
o
w
s
as
m
u
c
h
a
s
p
o
s
s
ib
le
ab
o
u
t
t
h
e
co
m
p
u
tat
io
n
all
y
co
m
p
le
x
tas
k
u
n
d
er
co
n
s
id
er
atio
n
.
T
h
e
jo
in
t
s
y
s
te
m
o
f
lin
ea
r
alg
eb
r
aic
(
2
)
ca
n
h
av
e
in
f
i
n
ite
l
y
m
a
n
y
s
o
l
u
tio
n
s
.
T
h
er
ef
o
r
e,
in
th
e
Z
4
p
r
o
to
c
o
l,
at
s
tep
2
,
th
e
s
er
v
er
r
et
u
r
n
s
to
t
h
e
clien
t a
n
ar
b
itra
r
y
ap
p
r
o
x
i
m
ate
s
o
lu
tio
n
o
f
t
h
e
eq
u
atio
n
by
=
g
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
Meth
o
d
s
fo
r
s
ec
u
r
e
clo
u
d
p
r
o
c
ess
in
g
o
f b
ig
d
a
t
a
(
Yer
z
h
a
n
N
.
S
eitku
lo
v
)
1657
ACK
NO
WL
E
D
G
E
M
E
NT
S
T
h
is
r
esear
ch
i
s
f
u
n
d
ed
b
y
t
h
e
Scien
ce
C
o
m
m
i
ttee
o
f
th
e
Min
i
s
tr
y
o
f
E
d
u
ca
tio
n
an
d
Sc
ien
ce
o
f
th
e
R
ep
u
b
lic
o
f
Kaz
ak
h
s
tan
,
g
r
a
n
t
No
.
A
P
0
9
5
5
9
2
4
9
,
an
d
p
a
r
tiall
y
s
u
p
p
o
r
ted
b
y
t
h
e
th
e
Min
i
s
tr
y
o
f
Di
g
ita
l
Dev
elo
p
m
e
n
t,
I
n
n
o
v
atio
n
an
d
A
er
o
s
p
ac
e
o
f
t
h
e
R
ep
u
b
lic
o
f
Kaz
ak
h
s
ta
n
,
g
r
a
n
t
No
A
P
0
6
8
5
0
8
1
7
.
A
ls
o
,
m
a
n
y
th
an
k
to
Mr
s
.
A
i
n
u
r
Z
h
ep
ti
s
p
a
y
ev
a
f
o
r
tech
n
ical
s
u
p
p
o
r
t
.
RE
F
E
R
E
NC
E
S
[1
]
Y.
N.
S
e
it
k
u
lo
v
,
“
Ne
w
m
e
th
o
d
s
o
f
se
c
u
re
o
u
tso
u
rc
i
n
g
o
f
sc
ien
ti
f
ic
c
o
m
p
u
tatio
n
s
,
”
T
h
e
J
o
u
rn
a
l
o
f
S
u
p
e
rc
o
mp
u
ti
n
g
,
v
o
l.
6
5
,
no.
1
,
p
p
.
4
6
9
-
4
8
2
,
2
0
1
3
,
d
o
i:
1
0
.
1
0
0
7
/s1
1
2
2
7
-
0
1
2
-
0
8
0
9
-
3.
[
2
]
J
.
Y
u
,
X
.
W
a
n
g
,
a
n
d
W
e
i
G
a
o
,
“
I
m
p
r
o
v
e
m
e
n
t
a
n
d
a
p
p
l
i
c
a
t
i
o
n
s
o
f
s
e
c
u
r
e
o
u
t
s
o
u
r
c
i
n
g
o
f
s
c
i
e
n
t
i
f
i
c
c
o
m
p
u
t
a
t
i
o
n
s
,
”
J
o
u
r
n
a
l
o
f
A
m
b
i
e
n
t
I
n
t
e
l
l
i
g
e
n
c
e
a
n
d
H
u
m
a
n
i
z
e
d
C
o
m
p
u
t
i
n
g
,
v
o
l
.
6
,
p
p
.
7
6
3
–
7
7
2
,
2
0
1
5
,
d
o
i
:
1
0
.
1
0
0
7
/
s
1
2
6
5
2
-
015
-
0
2
8
0
-
0
.
[3
]
X
.
Hu
a
n
d
C
.
T
a
n
g
,
“
S
e
c
u
re
o
u
ts
o
u
rc
e
d
c
o
m
p
u
tati
o
n
o
f
th
e
c
h
a
ra
c
teristic
p
o
ly
n
o
m
ial
a
n
d
e
ig
e
n
v
a
l
u
e
s
o
f
m
a
tri
x
,
”
J
o
u
rn
a
l
o
f
Clo
u
d
Co
mp
u
ti
n
g
,
v
o
l.
4
,
n
o
.
1
,
2
0
1
5
,
d
o
i
:
1
0
.
1
1
8
6
/s1
3
6
7
7
-
0
1
5
-
0
0
3
3
-
9.
[4
]
C.
W
a
n
g
,
K.
Re
n
,
a
n
d
J.
W
a
n
g
,
“
S
e
c
u
re
Op
t
im
iza
ti
o
n
Co
m
p
u
tat
io
n
Ou
ts
o
u
rc
in
g
in
Clo
u
d
C
o
m
p
u
ti
n
g
:
A
Ca
se
S
tu
d
y
o
f
L
in
e
a
r
P
r
o
g
ra
m
m
in
g
,
”
IEE
E
T
r
a
n
sa
c
ti
o
n
s
o
n
Co
m
p
u
t
e
rs
,
v
o
l.
6
5
,
n
o
.
1
,
p
p
.
2
1
6
-
2
2
9
,
1
Ja
n
.
2
0
1
6
,
d
o
i:
1
0
.
1
1
0
9
/T
C.
2
0
1
5
.
2
4
1
7
5
4
2
.
[5
]
R
.
V
y
a
s,
A
.
S
in
g
h
,
J
.
S
in
g
h
,
G
.
S
o
n
i
,
a
n
d
B.
R.
P
u
ru
s
h
o
t
h
a
m
a
,
“
De
sig
n
o
f
a
n
e
ff
icie
n
t
v
e
ri
f
ic
a
ti
o
n
sc
h
e
m
e
f
o
r
c
o
rre
c
tn
e
ss
o
f
o
u
tso
u
rc
e
d
c
o
m
p
u
tati
o
n
s
in
c
lo
u
d
c
o
m
p
u
ti
n
g
,
”
S
e
c
u
rity
in
Co
m
p
u
ti
n
g
a
n
d
C
o
mm
u
n
ic
a
ti
o
n
s
,
v
o
l.
5
3
6
,
p
p
.
6
6
–
7
7
,
2
0
1
5
,
d
o
i:
1
0
.
1
0
0
7
/
9
7
8
-
3
-
3
1
9
-
2
2
9
1
5
-
7
_
7
.
[6
]
M.
J.
A
tallah
a
n
d
K.
B.
F
rik
k
e
n
,
“
S
e
c
u
re
l
y
o
u
tso
u
rc
in
g
li
n
e
a
r
a
lg
e
b
ra
c
o
m
p
u
tatio
n
s
,
”
AS
IACC
S
'1
0
:
Pro
c
e
e
d
in
g
s o
f
th
e
5
t
h
ACM
S
y
mp
o
siu
m
o
n
In
fo
rm
a
t
io
n
,
Co
m
p
u
ter
a
n
d
C
o
mm
u
n
ic
a
ti
o
n
s
S
e
c
u
rity
,
2
0
1
0
,
p
p
.
4
8
-
5
9
,
d
o
i:
1
0
.
1
1
4
5
/
1
7
5
5
6
8
8
.
1
7
5
5
6
9
5
.
[7
]
D.
Be
n
jam
in
a
n
d
M
.
J.
A
tallah
,
“
P
riv
a
te
a
n
d
C
h
e
a
ti
n
g
-
F
re
e
Ou
tso
u
rc
in
g
o
f
A
lg
e
b
ra
ic
Co
m
p
u
tatio
n
s,”
2
0
0
8
S
ixt
h
An
n
u
a
l
Co
n
fer
e
n
c
e
o
n
Priv
a
c
y
,
S
e
c
u
rity a
n
d
T
ru
st
,
2
0
0
8
,
p
p
.
2
4
0
-
2
4
5
,
d
o
i:
1
0
.
1
1
0
9
/
P
S
T
.
2
0
0
8
.
1
2
.
[8
]
T
.
M
a
tsu
m
o
to
,
K
.
Ka
to
,
a
n
d
H
.
Im
a
i,
“
S
p
e
e
d
in
g
up
S
e
c
re
t
Co
m
p
u
tatio
n
s
w
it
h
In
se
c
u
re
A
u
x
il
iar
y
De
v
ice
s
,
”
Go
ld
wa
ss
e
r
S
.
(
e
d
s)
Ad
v
a
n
c
e
s
in
Cry
p
to
l
o
g
y
-
CRY
P
T
O’
8
8
.
C
RY
PT
O
1
9
8
8
.
L
e
c
t
u
re
No
tes
in
Co
mp
u
ter
S
c
ien
c
e
,
v
o
l.
4
0
3
,
p
p
.
4
9
7
-
5
0
6
,
1
9
88
,
d
o
i:
1
0
.
1
0
0
7
/
0
-
3
8
7
-
3
4
7
9
9
-
2
_
3
5
.
[9
]
T
.
M
e
fe
n
z
a
a
n
d
D
.
V
e
rg
n
a
u
d
,
“
Cr
y
p
tan
a
ly
sis
o
f
S
e
rv
e
r
-
A
id
e
d
RS
A
P
ro
t
o
c
o
ls
w
it
h
P
riv
a
te
-
Ke
y
S
p
li
tt
in
g
”
,
T
h
e
Co
mp
u
ter
J
o
u
rn
a
l
,
v
o
l.
6
2
,
n
o
.
8
,
p
p
.
1
1
9
4
-
1
2
1
3
,
2
0
1
9
,
d
o
i:
1
0
.
1
0
9
3
/co
m
jn
l/
b
x
z
0
4
0
.
[1
0
]
K.
Zh
o
u
,
M
.
H
.
A
f
i
f
i,
a
n
d
J.
Re
n
,
“
Ex
p
S
OS:
S
e
c
u
re
a
n
d
V
e
rif
iab
l
e
Ou
tso
u
rc
i
n
g
o
f
Ex
p
o
n
e
n
ti
a
ti
o
n
Op
e
ra
ti
o
n
s
f
o
r
M
o
b
i
le
Clo
u
d
Co
m
p
u
ti
n
g
,
”
i
n
IEE
E
T
r
a
n
sa
c
t
io
n
s
o
n
I
n
f
o
rm
a
t
io
n
Fo
re
n
sic
s
a
n
d
S
e
c
u
rity
,
v
o
l.
1
2
,
n
o
.
1
1
,
p
p
.
2
5
1
8
-
2
5
3
1
,
No
v
.
2
0
1
7
,
d
o
i:
1
0
.
1
1
0
9
/T
IF
S
.
2
0
1
7
.
2
7
1
0
9
4
1
.
[1
1
]
S
.
Ho
h
e
n
b
e
rg
e
r
a
n
d
A
.
Ly
s
y
a
n
sk
a
y
a
,
“
Ho
w
to
S
e
c
u
re
ly
Ou
tso
u
rc
e
Cr
y
p
to
g
ra
p
h
ic
Co
m
p
u
tatio
n
s
,
”
T
h
e
o
ry
o
f
Cry
p
to
g
ra
p
h
y
C
o
n
fer
e
n
c
e
,
v
o
l.
3
3
7
8
,
2
0
0
5
,
p
p
.
2
6
4
–
2
8
2
,
d
o
i:
1
0
.
1
0
0
7
/9
7
8
-
3
-
5
4
0
-
3
0
5
7
6
-
7
_
1
5
.
[1
2
]
P
.
Bé
g
u
in
a
n
d
J.
Q
u
isq
u
a
ter,
“
F
a
st
S
e
rv
e
r
-
A
id
e
d
RS
A
S
ig
n
a
tu
re
s
S
e
c
u
re
A
g
a
in
st
A
c
ti
v
e
Attac
k
s
,
”
An
n
u
a
l
In
ter
n
a
t
io
n
a
l
Cry
p
to
l
o
g
y
C
o
n
fer
e
n
c
e
,
v
o
l.
9
6
3
,
1
9
9
5
,
p
p
.
5
7
-
6
9
,
d
o
i:
1
0
.
1
0
0
7
/3
-
5
4
0
-
4
4
7
5
0
-
4
_
5
.
[1
3
]
C.
H.
L
i
m
a
n
d
P
.
J.
L
e
e
,
“
S
e
c
u
rit
y
a
n
d
P
e
rf
o
rm
a
n
c
e
o
f
S
e
r
v
e
r
-
A
id
e
d
RS
A
Co
m
p
u
tatio
n
P
ro
t
o
c
o
ls
,
”
An
n
u
a
l
In
ter
n
a
t
io
n
a
l
Cry
p
to
l
o
g
y
C
o
n
fer
e
n
c
e
,
v
o
l.
9
6
3
,
1
9
9
5
,
p
p
.
7
0
–
8
3
,
d
o
i:
1
0
.
1
0
0
7
/3
-
5
4
0
-
4
4
7
5
0
-
4
_
6
.
[1
4
]
C.
Ca
ste
ll
u
c
c
ia,
E.
M
y
k
letu
n
,
a
n
d
G
.
T
su
d
ik
,
“
I
m
p
ro
v
in
g
S
e
c
u
re
S
e
rv
e
r
P
e
rf
o
rm
a
n
c
e
b
y
Re
-
b
a
lan
c
in
g
S
S
L
//
T
L
S
Ha
n
d
sh
a
k
e
s
,
”
AS
IACC
S
'0
6
:
Pro
c
e
e
d
in
g
s
o
f
t
h
e
2
0
0
6
AC
M
S
y
mp
o
si
u
m
o
n
In
fo
rm
a
t
io
n
,
c
o
mp
u
ter
a
n
d
c
o
mm
u
n
ica
t
io
n
s se
c
u
rity
,
2
0
0
6
,
p
p
.
2
6
–
3
4
,
d
o
i:
1
0
.
1
1
4
5
/1
1
2
8
8
1
7
.
1
1
2
8
8
2
6
.
[1
5
]
X
.
Ch
e
n
,
J.
L
i,
J.
M
a
,
Q.
Tan
g
,
a
n
d
W
.
L
o
u
,
“
Ne
w
A
lg
o
rit
h
m
s
f
o
r
S
e
c
u
re
Ou
tso
u
rc
in
g
o
f
M
o
d
u
lar
Ex
p
o
n
e
n
ti
a
ti
o
n
s,”
IEE
E
T
ra
n
s
a
c
ti
o
n
s
o
n
P
a
ra
l
lel
a
n
d
Distri
b
u
te
d
S
y
ste
ms
,
v
o
l.
2
5
,
n
o
.
9
,
p
p
.
2
3
8
6
-
2
3
9
6
,
S
e
p
t.
2
0
1
4
,
d
o
i:
1
0
.
1
1
0
9
/T
P
DS.
2
0
1
3
.
1
8
0
.
[1
6
]
Y.
W
a
n
g
,
e
t
a
l
.
,
“
S
e
c
u
re
ly
Ou
tso
u
rc
in
g
Ex
p
o
n
e
n
t
iatio
n
s
w
it
h
S
in
g
le
Un
tru
ste
d
P
r
o
g
ra
m
f
o
r
Clo
u
d
S
t
o
ra
g
e
,
”
Eu
ro
p
e
a
n
S
y
mp
o
si
u
m
o
n
Res
e
a
rc
h
in
Co
m
p
u
ter
S
e
c
u
rity
,
v
o
l
.
8
7
1
2
,
p
p
.
3
2
6
–
3
4
3
,
2
0
1
4
,
d
o
i
:
1
0
.
1
0
0
7
/9
7
8
-
3
-
3
1
9
-
1
1
2
0
3
-
9
_
1
9
.
[1
7
]
P.
Q.
Ng
u
y
e
n
a
n
d
I.
S
h
p
a
rli
n
s
k
i,
“
On
t
h
e
In
se
c
u
rit
y
o
f
a
S
e
rv
e
r
-
A
id
e
d
RS
A
P
r
o
to
c
o
l
,
”
A
S
I
ACR
Y
PT
'
0
1
:
Pro
c
e
e
d
in
g
s
o
f
t
h
e
7
th
In
ter
n
a
ti
o
n
a
l
C
o
n
fer
e
n
c
e
o
n
t
h
e
T
h
e
o
ry
a
n
d
A
p
p
li
c
a
ti
o
n
o
f
Cry
p
to
l
o
g
y
a
n
d
I
n
f
o
rm
a
ti
o
n
S
e
c
u
rity: A
d
v
a
n
c
e
s in
Cry
p
t
o
l
o
g
y
,
v
o
l.
2
2
4
8
,
2
0
0
1
,
p
p
.
2
1
–
3
5
,
d
o
i:
1
0
.
1
0
0
7
/
3
-
5
4
0
-
4
5
6
8
2
-
1
_
2
.
[1
8
]
J.
M
e
rk
le,
“
M
u
lt
i
-
r
o
u
n
d
P
a
ss
iv
e
A
tt
a
c
k
s
o
n
S
e
rv
e
r
-
A
id
e
d
RS
A
P
r
o
to
c
o
ls”
,
CCS
'0
0
:
Pro
c
e
e
d
i
n
g
s
o
f
t
h
e
7
t
h
ACM
c
o
n
fer
e
n
c
e
o
n
C
o
mp
u
ter
a
n
d
C
o
mm
u
n
ica
ti
o
n
s
S
e
c
u
rity
,
2
0
0
0
,
p
p
.
1
0
2
–
1
0
7
,
d
o
i:
1
0
.
1
1
4
5
/3
5
2
6
0
0
.
3
5
2
6
1
6
.
[1
9
]
B
.
P
f
i
t
z
m
a
n
n
a
n
d
M
.
W
a
i
d
n
e
r
,
“
A
t
t
a
c
k
s
o
n
P
r
o
t
o
c
o
l
s
f
o
r
S
e
r
v
e
r
-
A
i
d
e
d
R
S
A
C
o
m
p
u
t
a
t
i
o
n
,”
W
o
r
k
s
h
o
p
o
n
t
h
e
T
h
e
o
r
y
a
n
d
A
p
p
l
i
c
a
t
i
o
n
o
f
o
f
C
r
y
p
t
o
g
r
a
p
h
i
c
T
e
c
h
n
i
q
u
e
s
,
v
o
l
.
6
5
8
,
p
p
.
1
5
3
–
1
6
2
,
1
9
9
3
,
d
o
i
:
1
0
.
1
0
0
7
/
3
-
540
-
4
7
5
5
5
-
9
_
1
3
.
[2
0
]
M
.
Ja
k
o
b
ss
o
n
a
n
d
S
.
W
e
tze
l,
“
S
e
c
u
re
S
e
rv
e
r
-
A
id
e
d
S
ig
n
a
tu
re
G
e
n
e
r
a
ti
o
n
,
”
I
n
ter
n
a
ti
o
n
a
l
W
o
rk
sh
o
p
o
n
Pu
b
li
c
Ke
y
Cry
p
to
g
ra
p
h
y
,
v
o
l.
1
9
9
2
,
p
p
.
3
8
3
–
4
0
1
,
2
0
0
1
,
d
o
i:
1
0
.
1
0
0
7
/3
-
5
4
0
-
4
4
5
8
6
-
2
_
2
8
.
[2
1
]
J.
M
e
rk
le
a
n
d
R.
W
e
rc
h
n
e
r,
“
On
th
e
S
e
c
u
rit
y
o
f
S
e
rv
e
r
-
A
id
e
d
RS
A
P
ro
to
c
o
ls
,
”
In
ter
n
a
ti
o
n
a
l
W
o
rk
sh
o
p
o
n
Pu
b
li
c
Ke
y
Cry
p
to
g
ra
p
h
y
,
v
o
l
.
1
4
3
1
,
p
p
.
9
9
–
1
1
6
,
1
9
9
8
,
d
o
i
:
1
0
.
1
0
0
7
/BF
b
0
0
5
4
0
1
8
.
[2
2
]
Y.
A
o
n
o
,
“
A
Ne
w
L
a
tt
ic
e
Co
n
stru
c
ti
o
n
f
o
r
P
a
rti
a
l
Ke
y
Ex
p
o
su
re
A
tt
a
c
k
f
o
r
RS
A
,
”
In
ter
n
a
ti
o
n
a
l
W
o
rk
sh
o
p
o
n
Pu
b
li
c
Ke
y
Cry
p
t
o
g
r
a
p
h
y
,
v
o
l.
5
4
4
3
,
p
p
.
3
4
–
5
3
,
2
0
0
9
,
d
o
i:
1
0
.
1
0
0
7
/9
7
8
-
3
-
6
4
2
-
0
0
4
6
8
-
1
_
3
.
[2
3
]
J.
Blö
m
e
r
a
n
d
A
.
M
a
y
,
“
Ne
w
P
a
rti
a
l
Ke
y
Ex
p
o
su
re
A
tt
a
c
k
s
o
n
RS
A
,
”
An
n
u
a
l
In
ter
n
a
ti
o
n
a
l
Cry
p
to
lo
g
y
Co
n
fer
e
n
c
e
,
v
o
l.
2
7
2
9
,
2
0
0
3
,
p
p
.
2
7
–
4
3
,
d
o
i:
1
0
.
1
0
0
7
/9
7
8
-
3
-
5
4
0
-
4
5
1
4
6
-
4
_
2
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2502
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
22
,
No
.
3
,
J
u
n
e
2
0
2
1
:
1
6
5
0
-
1
6
5
8
1658
[2
4
]
M
.
Ern
st
,
E.
J
o
c
h
e
m
sz
,
A
.
M
a
y
,
a
n
d
B.
d
e
W
e
g
e
r,
“
P
a
rti
a
l
Ke
y
Ex
p
o
su
re
A
tt
a
c
k
s
o
n
RS
A
u
p
to
F
u
l
l
S
ize
Ex
p
o
n
e
n
ts
,
”
An
n
u
a
l
In
ter
n
a
ti
o
n
a
l
Co
n
fer
e
n
c
e
o
n
th
e
T
h
e
o
ry
a
n
d
Ap
p
li
c
a
ti
o
n
s
o
f
Cry
p
to
g
ra
p
h
ic
T
e
c
h
n
iq
u
e
s
,
v
o
l.
3
4
9
4
,
p
p
.
3
7
1
–
3
8
6
,
2
0
0
5
,
d
o
i:
1
0
.
1
0
0
7
/
1
1
4
2
6
6
3
9
_
2
2
.
[2
5
]
S.
E.
Ke
rimk
u
lo
v
,
“
M
a
th
e
m
a
ti
c
a
l
m
e
th
o
d
s
f
o
r
stu
d
y
in
g
m
a
c
ro
e
c
o
n
o
m
ic
p
ro
c
e
ss
e
s
in
Ka
z
a
k
h
sta
n
,
”
Dise
rtatio
n
,
D
e
p
a
rtme
n
t
E
c
o
n
o
m
i
S
c
ien
c
e
s,
Alm
a
t
y
,
Ka
z
a
k
h
sta
n
,
p
p
.
2
3
0
,
2
0
0
3
.
B
I
O
G
RAP
H
I
E
S O
F
AUTH
O
RS
Ye
r
z
h
a
n
N.
S
e
it
k
u
lo
v
,
w
a
s
b
o
rn
1
9
7
9
,
Ka
z
a
k
h
sta
n
.
Cu
rre
n
t
p
o
siti
o
n
is
P
h
D,
A
ss
o
c
iate
P
r
o
f
e
ss
o
r,
Dire
c
to
r
o
f
In
f
o
rm
a
ti
o
n
S
e
c
u
r
it
y
a
n
d
Cry
p
to
lo
g
y
In
stit
u
te,
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
Un
iv
e
rsit
y
,
Ka
z
a
k
h
sta
n
.
His
i
n
tere
st
is
i
n
f
o
rm
a
ti
o
n
se
c
u
rit
y
.
S
c
o
p
u
s
a
u
t
h
o
r
ID:
2
4
2
8
0
1
7
2
2
0
0
a
n
d
r
e
se
a
rc
h
e
r
ID
w
e
b
o
f
sc
i
e
n
c
e
:
P
-
4
9
0
5
-
2
0
1
4
S
e
i
k
h
a
n
N.
B
o
r
a
n
b
a
y
e
v
,
w
a
s
b
o
rn
1
9
5
3
,
Ka
z
a
k
h
sta
n
.
Cu
r
re
n
t
p
o
siti
o
n
is
P
h
D,
P
ro
f
e
ss
o
r,
d
e
p
a
rtn
a
e
n
t
o
f
in
f
o
rm
a
ti
o
n
siste
m
s,
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
Un
iv
e
rsity
,
Ka
z
a
k
h
sta
n
.
His
in
tere
st
is
in
f
o
rm
a
ti
o
n
se
c
u
rit
y
.
sc
o
p
u
s
a
u
t
h
o
r
ID:
3
6
2
3
8
7
1
8
0
0
0
a
n
d
w
e
b
o
f
sc
ien
c
e
ID:
P
-
7
5
8
5
-
2
0
1
4
G
u
l
d
e
n
B
.
Ul
y
u
k
o
v
a
,
w
a
s
b
o
rn
1
9
9
0
,
Ka
z
a
k
h
sta
n
.
Cu
rre
n
t
p
o
si
ti
o
n
is
sc
ien
ti
f
ic
re
se
a
rc
h
e
r,
in
f
o
rm
a
ti
o
n
se
c
u
rit
y
a
n
d
c
ry
p
t
o
lo
g
y
In
s
ti
tu
te,
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
U
n
iv
e
rsity
,
Ka
z
a
k
h
sta
n
.
He
r
in
tere
st
is
i
n
f
o
rm
a
ti
o
n
s
e
c
u
rit
y
.
S
c
o
p
u
s
a
u
th
o
r
I
D:
5
7
1
9
2
1
8
3
9
2
1
.
B
a
n
u
B
.
Ye
r
g
a
li
y
e
v
a
,
wa
s
b
o
rn
1
9
8
5
,
Ka
z
a
k
h
sta
n
.
Cu
rre
n
t
p
o
si
ti
o
n
is
sc
ien
ti
f
ic
re
se
a
r
c
h
e
r,
in
f
o
rm
a
ti
o
n
se
c
u
rit
y
a
n
d
c
ry
p
t
o
lo
g
y
In
stit
u
te,
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
U
n
iv
e
rsity
,
Ka
z
a
k
h
sta
n
.
He
r
in
tere
st
is
i
n
f
o
rm
a
ti
o
n
s
e
c
u
rit
y
.
S
c
o
p
u
s
A
u
th
o
r
I
D:
5
7
1
9
1
2
4
1
7
4
9
.
Din
a
S
a
ty
b
a
ld
i
n
a
,
w
a
s
b
o
rn
1
9
7
1
,
Ka
z
a
k
h
sta
n
.
Cu
rre
n
t
p
o
si
ti
o
n
is
Dr,
A
c
c
o
c
iate
P
ro
f
e
ss
o
r,
He
a
d
o
f
In
f
o
r
m
a
ti
o
n
S
e
c
u
rit
y
De
p
a
rten
t,
G
u
m
il
y
o
v
Eu
ra
sia
n
Na
ti
o
n
a
l
Un
iv
e
rsity
,
Ka
z
a
k
h
sta
n
.
He
r
s
c
ien
ti
f
ic
in
tere
st
is
i
n
f
o
rm
a
ti
o
n
s
e
c
u
rit
y
.
sc
o
p
u
s
a
u
th
o
r
ID
:
5
7
1
9
3
7
4
0
6
6
9
a
n
d
w
e
b
o
f
sc
ien
c
e
ID:
P
-
1
1
2
0
-
2
0
1
4
Evaluation Warning : The document was created with Spire.PDF for Python.