I
nte
rna
t
io
na
l J
o
urna
l o
f
E
lect
rica
l a
nd
Co
m
pu
t
er
E
ng
ineering
(
I
J
E
CE
)
Vo
l.
14
,
No
.
6
,
Dec
em
b
er
20
24
,
p
p
.
6
7
5
3
~
6
7
7
2
I
SS
N:
2088
-
8
7
0
8
,
DOI
: 1
0
.
1
1
5
9
1
/ijece.
v
14
i
6
.
pp
6
7
5
3
-
6
7
7
2
6753
J
o
ur
na
l ho
m
ep
a
g
e
:
h
ttp
:
//ij
ec
e.
ia
esco
r
e.
co
m
Text
encryp
t
io
n u
sing
secure and
e
x
pedi
tious
multi
p
ro
cess
ing
using
log
istic ma
p
H
uwa
ida
T
.
E
ls
ho
us
h
1
,
Dua
a
M
.
Ahm
ed
1
,
Abda
lm
a
j
id A.
I
s
ha
g
1
,
M
ua
wia
A.
E
l
s
a
dig
2
,
Abdelra
hm
a
n Alt
ig
a
ni
3
1
C
o
m
p
u
t
e
r
S
c
i
e
n
c
e
D
e
p
a
r
t
me
n
t
,
F
a
c
u
l
t
y
o
f
M
a
t
h
e
mat
i
c
a
l
S
c
i
e
n
c
e
s
a
n
d
I
n
f
o
r
mat
i
c
s,
U
n
i
v
e
r
s
i
t
y
o
f
K
h
a
r
t
o
u
m,
K
h
a
r
t
o
u
m,
S
u
d
a
n
2
C
o
l
l
e
g
e
o
f
C
o
m
p
u
t
e
r
S
c
i
e
n
c
e
a
n
d
I
n
f
o
r
mat
i
o
n
Te
c
h
n
o
l
o
g
y
,
I
mam
A
b
d
u
l
r
a
h
ma
n
B
i
n
F
a
i
sa
l
U
n
i
v
e
r
s
i
t
y
,
D
a
mm
a
m,
S
a
u
d
i
A
r
a
b
i
a
3
C
o
m
p
u
t
e
r
I
n
f
o
r
ma
t
i
o
n
S
c
i
e
n
c
e
,
H
i
g
h
e
r
C
o
l
l
e
g
e
s
o
f
Te
c
h
n
o
l
o
g
y
,
A
l
A
i
n
,
U
n
i
t
e
d
A
r
a
b
Em
i
r
a
t
e
s
Art
icle
I
nfo
AB
S
T
RAC
T
A
r
ticle
his
to
r
y:
R
ec
eiv
ed
Dec
1
0
,
2
0
2
3
R
ev
is
ed
J
u
l 1
4
,
2
0
2
4
Acc
ep
ted
Au
g
6
,
2
0
2
4
Un
a
rg
u
a
b
l
y
p
e
rf
o
rm
a
n
c
e
is
a
c
r
it
ica
l
fa
c
to
r
to
th
e
su
c
c
e
ss
o
f
a
n
y
c
ip
h
e
r.
Al
-
Be
it
S
e
rp
e
n
t
is
m
o
re
se
c
u
re
th
a
n
a
d
v
a
n
c
e
d
e
n
c
ry
p
ti
o
n
sta
n
d
a
rd
(AES
),
i
t
fa
c
e
s
li
m
it
a
ti
o
n
s
su
c
h
a
s
sp
e
e
d
a
n
d
m
e
m
o
ry
re
q
u
irem
e
n
t.
He
n
c
e
,
th
is
p
a
p
e
r
p
ro
ffe
rs
a
tex
t
e
n
c
ry
p
t
io
n
m
e
th
o
d
S
−
th
a
t
a
m
e
li
o
ra
tes
th
e
p
e
rfo
rm
a
n
c
e
b
y
r
u
n
n
i
n
g
S
e
r
p
e
n
t
i
n
p
a
ra
ll
e
l
u
si
n
g
t
h
e
c
o
u
n
t
e
r
(CTR)
e
n
c
ry
p
ti
o
n
m
o
d
e
a
n
d
fu
rt
h
e
r
e
n
h
a
n
c
e
s
th
e
se
c
u
rit
y
b
y
g
e
n
e
ra
ti
n
g
su
b
-
k
e
y
s
fo
r
e
a
c
h
b
l
o
c
k
u
si
n
g
lo
g
isti
c
m
a
p
.
Th
e
in
tri
c
a
te
lo
g
isti
c
m
a
p
g
e
n
e
r
a
ted
k
e
y
s
a
d
d
s
r
o
b
u
stn
e
ss
t
o
th
e
p
r
o
p
o
se
d
a
l
g
o
rit
h
m
.
C
o
m
p
re
h
e
n
siv
e
e
x
p
e
rime
n
ts
u
sin
g
P
y
th
o
n
3
.
9
o
n
c
o
m
m
o
n
ly
u
se
d
m
e
tri
c
s
v
e
rify
th
e
e
ffica
c
y
o
f
t
h
e
p
ro
p
o
se
d
m
e
th
o
d
in
term
s
o
f
e
x
e
c
u
ti
o
n
ti
m
e
,
c
e
n
tral
p
ro
c
e
ss
in
g
u
n
it
(CP
U)
u
sa
g
e
,
se
c
u
rit
y
a
n
a
ly
sis
i
n
c
lu
d
in
g
k
e
y
sp
a
c
e
,
strict
a
v
a
lan
c
h
e
e
ffe
c
t
a
n
d
it
s
ra
n
d
o
m
n
e
ss
.
T
h
e
e
n
c
ry
p
ti
o
n
/
d
e
c
ry
p
ti
o
n
re
d
u
c
ti
o
n
ra
te
re
a
c
h
e
d
u
p
to
8
0
.
8
1
%
.
I
t
is
wo
r
th
y
o
f
n
o
te
t
h
a
t
it
is
e
ffe
c
tu
a
ll
y
re
sista
n
t
t
o
b
ru
te
fo
rc
e
a
tt
a
c
k
s
h
a
v
in
g
a
larg
e
k
e
y
sp
a
c
e
i
n
a
d
d
i
ti
o
n
t
o
it
s
d
e
p
e
n
d
e
n
c
y
o
n
t
h
e
n
u
m
b
e
r
o
f
b
lo
c
k
s
b
e
sid
e
s
th
e
ra
n
d
o
m
ly
g
e
n
e
ra
ted
k
e
y
s.
Th
e
e
n
h
a
n
c
e
d
S
e
rp
e
n
t
wa
s
e
x
a
m
in
e
d
u
sin
g
th
e
sta
ti
stica
l
tes
t
su
it
e
(S
TS
)
re
c
o
m
m
e
n
d
e
d
b
y
t
h
e
Na
ti
o
n
a
l
In
stit
u
te
o
f
S
tan
d
a
rd
s
a
n
d
Tec
h
n
o
lo
g
y
(NIST
)
a
n
d
v
e
rifi
e
d
i
ts
ra
n
d
o
m
n
e
ss
b
y
p
a
ss
in
g
a
ll
tes
ts.
F
u
rth
e
rm
o
re
,
it
e
ffica
c
io
u
sly
re
siste
d
sta
ti
stica
l
a
n
a
ly
sis,
p
a
rti
c
u
larly
h
ist
o
g
ra
m
a
n
d
c
o
rr
e
latio
n
c
o
e
fficie
n
t
a
n
a
ly
sis.
M
o
re
o
v
e
r,
it
p
re
v
a
il
s
o
v
e
r
c
u
rre
n
t
m
e
th
o
d
s
wh
e
n
ju
x
tap
o
se
d
with
t
h
e
m
in
term
s
o
f
p
e
rfo
rm
a
n
c
e
,
k
e
y
s
p
a
c
e
,
k
e
y
se
n
s
it
iv
it
y
,
a
v
a
la
n
c
h
e
e
ffe
c
t,
h
ist
o
g
ra
m
a
n
a
ly
sis
a
n
d
c
o
rre
lati
o
n
c
o
e
fficie
n
t,
e
rg
o
a
ffir
m
in
g
i
ts efficie
n
c
y
.
K
ey
w
o
r
d
s
:
C
r
y
p
to
g
r
ap
h
y
C
T
R
m
o
d
e
L
o
g
is
tic
m
ap
Mu
ltip
r
o
ce
s
s
in
g
Par
allel
co
m
p
u
tin
g
Ser
p
en
t
T
ex
t
en
cr
y
p
tio
n
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
:
Hu
waid
a
T
.
E
ls
h
o
u
s
h
C
o
m
p
u
ter
Scien
ce
Dep
ar
tm
e
n
t,
Facu
lty
o
f
Ma
th
em
atica
l Sci
en
ce
s
an
d
I
n
f
o
r
m
atics,
Un
iv
er
s
ity
o
f
Kh
ar
to
u
m
Kh
ar
to
u
m
,
Su
d
an
E
m
ail:
h
tels
h
o
u
s
h
@
h
o
tm
ail.
co
m
1.
I
NT
RO
D
UCT
I
O
N
S
e
n
d
i
n
g
a
n
d
r
e
c
e
i
v
i
n
g
d
a
t
a
i
s
a
k
e
y
e
l
e
m
e
n
t
o
f
c
o
m
p
u
t
e
r
n
e
t
w
o
r
k
.
T
h
e
t
y
p
e
o
f
d
a
t
a
e
x
c
h
a
n
g
e
d
d
i
f
f
e
r
s
i
n
s
e
c
r
e
c
y
.
D
a
t
a
c
a
n
b
e
c
l
a
s
s
i
f
i
e
d
a
s
s
e
c
r
et
s
u
c
h
a
s
i
n
p
e
r
s
o
n
a
l
i
n
f
o
r
m
a
t
i
o
n
,
a
n
d
c
o
n
f
i
d
e
n
t
i
a
l
o
r
p
r
i
v
a
t
e
i
n
m
i
l
i
t
a
r
y
a
n
d
b
a
n
k
i
n
g
t
r
a
n
s
a
ct
io
n
s
.
O
n
e
o
f
t
h
e
m
o
s
t
i
m
p
o
r
t
an
t
r
e
q
u
i
r
e
m
e
n
t
s
o
f
t
h
e
s
e
n
e
t
wo
r
k
s
i
s
t
o
p
r
o
v
i
d
e
s
e
c
u
r
e
t
r
a
n
s
m
i
s
s
i
o
n
o
f
i
n
f
o
r
m
a
t
i
o
n
.
C
r
y
p
t
o
g
r
a
p
h
y
i
s
o
n
e
o
f
t
h
e
t
e
c
h
n
i
q
u
e
s
t
o
p
r
o
v
i
d
e
t
h
e
s
e
cu
r
e
w
a
y
t
o
t
r
a
n
s
f
e
r
t
h
e
i
m
p
o
r
t
a
n
t
i
n
f
o
r
m
a
t
i
o
n
[
1
]
.
I
n
1
9
9
7
,
t
h
e
U
S
N
a
t
i
o
n
a
l
I
n
s
t
it
u
t
e
o
f
S
t
a
n
d
a
r
d
s
a
n
d
T
e
c
h
n
o
lo
g
y
[
2
]
i
s
s
u
e
d
t
h
a
t
t
h
e
y
n
e
e
d
t
o
c
h
o
o
s
e
a
n
a
l
te
r
n
a
t
i
v
e
t
o
d
at
a
e
n
c
r
y
p
t
i
o
n
s
t
a
n
d
a
r
d
(
D
E
S
)
;
h
e
n
ce
a
p
p
e
a
r
e
d
t
h
e
c
h
o
s
e
n
a
lt
e
r
n
a
t
i
v
e
w
h
i
c
h
is
k
n
o
w
n
as
a
d
v
a
n
c
e
en
c
r
y
p
t
i
o
n
s
t
a
n
d
a
r
d
(
A
E
S
)
.
M
an
y
a
l
g
o
r
i
t
h
m
s
w
e
r
e
p
r
o
p
o
s
e
d
a
s
c
a
n
d
i
d
at
e
s
,
a
n
d
S
e
r
p
e
n
t
,
w
h
ic
h
is
a
ls
o
a
s
y
m
m
e
t
r
i
c
b
l
o
c
k
,
w
a
s
o
n
e
o
f
t
h
e
A
E
S
c
o
m
p
e
t
it
i
o
n
f
i
n
a
li
s
t
s
.
S
e
r
p
e
n
t
a
n
d
R
i
j
n
d
a
e
l
-
AE
S
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
0
8
8
-
8
7
0
8
I
n
t J E
lec
&
C
o
m
p
E
n
g
,
Vo
l.
14
,
No
.
6
,
Dec
em
b
e
r
20
24
:
6
7
5
3
-
6
7
7
2
6754
w
i
n
n
e
r
-
h
a
v
e
m
a
n
y
s
i
m
il
a
r
it
i
es;
t
h
e
m
a
i
n
d
i
f
f
e
r
e
n
c
e
is
t
h
at
R
ij
n
d
a
e
l
is
f
as
t
e
r
b
u
t
S
e
r
p
e
n
t
i
s
m
o
r
e
s
e
c
u
r
e
[
2
]
–
[
5
]
.
S
e
r
p
e
n
t
r
u
n
s
o
n
f
o
u
r
3
2
-
b
i
t
wo
r
d
s
(
1
2
8
-
b
i
t
s
)
d
a
t
a
b
l
o
c
k
a
n
d
t
h
r
e
e
d
i
f
f
e
r
e
n
t
k
e
y
s
i
z
es
,
n
a
m
el
y
1
2
8
,
1
9
2
,
o
r
2
5
6
b
i
t
s
.
I
t
h
as
3
2
r
o
u
n
d
s
,
w
h
e
r
e
ea
c
h
r
o
u
n
d
u
t
i
l
i
z
es
o
n
e
o
f
e
i
g
h
t
4
×
4
S
-
b
o
x
e
s
.
I
t
s
f
u
n
c
t
i
o
n
s
w
er
e
d
e
v
e
l
o
p
e
d
t
o
b
e
i
m
p
l
e
m
e
n
t
e
d
i
n
p
a
r
a
l
l
e
l
,
u
s
i
n
g
3
2
b
i
t
s
l
i
c
e
s
,
h
e
n
c
e
b
o
o
s
t
i
n
g
p
a
r
a
l
l
e
li
s
m
[
6
]
–
[1
6
]
.
T
h
e
n
o
n
l
i
n
e
a
r
l
a
y
e
r
i
n
A
E
S
u
s
e
s
a
n
8
×
8
S
-
b
o
x
w
h
e
r
e
a
s
S
e
r
p
e
n
t
u
s
e
s
e
i
g
h
t
d
i
f
f
e
r
e
n
t
4
×
4
S
-
b
o
x
e
s
.
T
h
e
3
2
r
o
u
n
d
s
m
e
a
n
s
t
h
a
t
S
e
r
p
e
n
t
h
a
s
a
h
i
g
h
e
r
s
e
c
u
r
it
y
m
a
r
g
i
n
t
h
a
n
R
i
j
n
d
a
e
l
;
h
o
w
e
v
e
r
,
R
ij
n
d
a
e
l
w
i
th
1
0
r
o
u
n
d
s
is
f
as
t
e
r
a
n
d
e
as
ie
r
t
o
i
m
p
l
e
m
e
n
t
f
o
r
s
m
a
l
l
b
l
o
c
k
s
,
as
t
h
e
3
2
r
o
u
n
d
s
o
f
S
e
r
p
e
n
t
m
a
k
e
i
t
a
b
i
t
s
l
o
w
e
r
a
n
d
c
o
m
p
l
e
x
t
o
i
m
p
l
e
m
e
n
t
o
n
s
m
a
l
l
b
l
o
c
k
s
.
T
h
u
s
,
S
e
r
p
e
n
t
a
n
d
R
ij
n
d
a
e
l
a
r
e
s
o
m
ew
h
a
t
s
i
m
i
l
a
r
;
t
h
e
m
a
i
n
d
i
f
f
e
r
e
n
c
e
i
s
t
h
a
t
R
ij
n
d
a
e
l
is
f
a
s
t
e
r
(
h
a
v
i
n
g
f
e
w
e
r
r
o
u
n
d
s
)
y
e
t
S
e
r
p
e
n
t
is
m
o
r
e
s
e
c
u
r
e
.
C
o
m
p
a
r
e
d
t
o
3
D
E
S
,
S
e
r
p
e
n
t
is
e
as
y
t
o
i
m
p
l
e
m
e
n
t
,
f
as
t
a
n
d
m
o
r
e
s
e
c
u
r
e
[
1
4
]
–
[
1
7
]
.
S
e
r
p
e
n
t
u
s
es
2
5
6
b
i
t
k
e
y
t
o
e
n
c
r
y
p
t
1
2
8
b
i
t
o
f
p
l
a
i
n
t
e
x
t
i
n
t
h
r
e
e
m
a
i
n
f
u
n
c
t
i
o
n
s
,
n
a
m
e
l
y
i
n
i
t
i
al
p
e
r
-
m
u
t
a
t
i
o
n
(
I
P
)
,
r
o
u
n
d
f
u
n
c
t
i
o
n
(
R
)
a
n
d
f
i
n
a
l
p
e
r
m
u
t
a
t
i
o
n
(
F
P
)
[
1
8
]
.
I
t
i
s
s
e
c
u
r
e
,
a
n
d
s
p
e
c
i
f
i
c
a
l
l
y
h
as
s
u
i
t
a
b
le
f
u
n
c
t
i
o
n
i
n
g
f
o
r
p
r
o
t
e
c
t
i
n
g
a
g
a
i
n
s
t
p
o
w
e
r
a
n
d
t
i
m
i
n
g
a
t
t
a
c
k
s
[
1
9
]
.
Y
e
t
,
i
t
f
a
c
e
s
l
i
m
i
t
a
ti
o
n
s
s
u
c
h
a
s
m
e
m
o
r
y
r
e
q
u
i
r
e
m
e
n
t
a
n
d
e
x
e
c
u
t
i
o
n
t
i
m
e
.
T
h
e
n
u
m
b
e
r
o
f
r
o
u
n
d
s
i
n
S
e
r
p
e
n
t
,
w
h
i
c
h
is
3
2
,
a
f
f
e
c
t
t
h
e
p
e
r
f
o
r
m
a
n
c
e
d
i
r
e
c
t
l
y
.
T
h
e
p
r
o
p
o
s
e
d
a
p
p
r
o
a
c
h
e
n
h
a
n
c
e
s
t
h
e
e
x
e
c
u
t
i
o
n
t
i
m
e
o
f
S
e
r
p
e
n
t
b
y
u
s
i
n
g
p
a
r
a
l
l
e
l
c
o
m
p
u
t
i
n
g
t
o
s
p
e
e
d
-
u
p
e
n
c
r
y
p
t
i
o
n
a
n
d
d
e
c
r
y
p
t
i
o
n
p
r
o
c
e
s
s
.
F
u
r
t
h
e
r
m
o
r
e
,
t
h
e
p
r
o
p
o
s
e
d
a
p
p
r
o
a
c
h
e
n
h
a
n
c
e
s
t
h
e
s
e
c
u
r
i
t
y
b
y
g
e
n
e
r
a
t
i
n
g
s
u
b
k
e
y
s
f
o
r
e
a
c
h
b
l
o
c
k
u
s
i
n
g
L
o
g
i
s
t
i
c
M
a
p
b
l
o
ck
k
e
y
g
e
n
e
r
a
t
i
o
n
a
l
g
o
r
i
t
h
m
[
2
0
]
–
[
2
9
]
.
M
o
r
e
o
v
e
r
,
t
h
e
a
l
g
o
r
i
t
h
m
i
s
r
u
n
i
n
c
o
u
n
t
e
r
(
C
T
R
)
mode
[
3
0
]
–
[
3
4
]
.
T
h
i
s
w
o
r
k
is
a
n
e
x
t
e
n
s
i
o
n
o
f
r
es
e
a
r
c
h
[
1
8
]
.
T
h
e
i
n
a
u
g
u
r
a
t
i
o
n
o
f
t
h
i
s
r
e
s
e
a
r
c
h
is
e
n
t
i
r
el
y
t
o
im
p
r
o
v
e
t
h
e
p
e
r
f
o
r
m
a
n
c
e
a
s
w
e
l
l
a
s
t
h
e
s
e
cu
r
i
t
y
o
f
S
e
r
p
e
n
t
a
l
g
o
r
i
t
h
m
.
H
e
n
c
e
,
t
h
e
p
r
o
p
o
s
e
d
m
e
t
h
o
d
e
n
h
a
n
c
e
d
t
h
e
e
x
e
c
u
t
i
o
n
p
e
r
f
o
r
m
a
n
c
e
t
i
m
e
b
y
r
u
n
n
i
n
g
S
e
r
p
e
n
t
i
n
C
T
R
u
s
i
n
g
m
u
lt
i
-
p
r
o
c
e
s
s
es
.
F
u
r
t
h
e
r
m
o
r
e
,
l
o
g
is
ti
c
m
a
p
is
u
t
il
i
z
e
d
t
o
g
e
n
e
r
a
t
e
b
l
o
c
k
k
e
y
s
r
a
n
d
o
m
l
y
a
n
d
h
e
n
c
e
b
o
o
s
t
i
n
g
t
h
e
s
e
cu
r
i
t
y
o
f
t
h
e
p
r
o
p
o
s
e
d
m
e
t
h
o
d
.
A
d
d
i
t
i
o
n
a
l
l
y
,
it
i
s
j
u
x
t
a
p
o
s
e
d
wi
t
h
p
r
e
v
ai
l
i
n
g
m
et
h
o
d
s
a
n
d
t
r
a
d
i
t
i
o
n
a
l
Se
r
p
e
n
t
an
d
p
r
o
v
e
d
i
t
s
e
f
f
i
c
ie
n
c
y
.
T
h
e
c
o
n
t
r
i
b
u
t
i
o
n
o
f
t
h
i
s
r
e
s
e
a
r
c
h
ca
n
b
e
s
u
m
m
a
r
i
z
e
d
h
e
r
e
a
f
t
e
r
:
i
)
T
h
e
S
e
r
p
e
n
t
is
e
x
p
e
d
i
t
e
d
b
y
s
p
l
it
t
i
n
g
t
h
e
p
l
ai
n
t
e
x
t
i
n
p
u
t
i
n
t
o
b
l
o
c
k
s
,
a
n
d
m
o
r
e
o
v
e
r
g
e
n
e
r
a
t
i
n
g
s
u
b
-
k
e
y
s
u
s
i
n
g
l
o
g
i
s
t
i
c
m
a
p
,
a
n
d
f
i
n
a
l
l
y
r
u
n
n
i
n
g
t
h
e
p
r
o
p
o
s
e
d
a
l
g
o
r
i
t
h
m
i
n
C
T
R
mode
;
i
i
)
Us
i
n
g
l
o
g
i
s
t
i
c
m
a
p
b
o
o
s
t
t
h
e
p
r
o
p
o
s
e
d
a
l
g
o
r
i
t
h
m
f
r
o
m
t
h
e
s
e
c
u
r
i
t
y
f
a
c
et
a
s
a
co
n
s
e
q
u
e
n
c
e
o
f
t
h
e
s
u
b
-
k
e
y
c
o
m
p
l
e
x
i
t
y
a
n
d
r
a
n
d
o
m
n
e
s
s
.
M
o
r
e
o
v
e
r
,
d
i
f
f
e
r
e
n
t
s
u
b
-
k
e
y
s
f
o
r
e
a
c
h
b
l
o
c
k
d
i
s
g
u
i
s
e
t
h
e
p
l
a
i
n
t
e
x
t
p
a
t
t
e
r
n
s
;
i
ii
)
T
h
e
p
e
r
f
o
r
m
a
n
c
e
o
f
t
h
e
p
r
o
p
o
s
e
d
m
e
t
h
o
d
wa
s
t
es
t
e
d
a
n
d
e
v
i
n
c
e
it
s
e
f
f
i
c
ie
n
t
s
p
ee
d
a
n
d
s
e
c
u
r
it
y
;
a
n
d
i
v
)
F
u
r
t
h
e
r
m
o
r
e
,
w
h
e
n
j
u
x
t
a
p
o
s
e
d
w
i
t
h
t
r
a
d
i
t
i
o
n
a
l
S
e
r
p
e
n
t
a
n
d
c
u
r
r
e
n
t
s
c
h
e
m
e
s
,
t
h
e
p
r
o
p
o
s
ed
m
e
t
h
o
d
s
u
r
p
a
s
s
e
d
t
h
e
m
a
n
d
g
a
v
e
f
a
v
o
r
a
b
l
e
a
n
d
s
u
p
r
e
m
e
r
e
s
u
l
ts
.
T
h
e
r
e
m
a
i
n
d
e
r
o
f
t
h
e
p
a
p
e
r
i
s
s
t
r
u
c
t
u
r
e
d
a
s
f
o
l
l
o
ws
:
T
h
e
r
e
c
e
n
t
s
c
h
e
m
es
i
n
i
m
p
r
o
v
i
n
g
t
h
e
p
e
r
f
o
r
m
a
n
c
e
a
n
d
s
e
c
u
r
i
t
y
o
f
t
h
e
S
e
r
p
e
n
t
a
r
e
e
x
p
l
o
r
e
d
i
n
s
e
c
t
i
o
n
2
.
S
e
c
t
i
o
n
3
e
l
u
c
i
d
a
t
e
s
t
h
e
p
r
o
p
o
s
e
d
m
e
t
h
o
d
,
t
o
g
e
t
h
e
r
w
i
t
h
i
t
s
d
e
t
a
i
l
e
d
a
l
g
o
r
it
h
m
s
.
T
h
e
r
e
s
u
lts
a
n
d
d
i
s
c
u
s
s
i
o
n
a
r
e
p
r
e
s
e
n
t
e
d
i
n
s
e
c
t
i
o
n
4
.
F
i
n
al
l
y
,
s
ec
t
i
o
n
5
c
o
n
c
l
u
d
e
s
t
h
e
p
a
p
e
r
a
s
w
el
l
as
r
e
c
o
m
m
e
n
d
i
n
g
s
o
m
e
f
u
t
u
r
e
w
o
r
k
.
2.
RE
L
AT
E
D
WO
RK
Her
ea
f
ter
,
a
r
ev
iew
o
f
s
o
m
e
r
esear
ch
attem
p
ts
to
im
p
r
o
v
e
t
h
e
s
p
ee
d
o
f
Ser
p
en
t.
So
m
e
r
e
s
ea
r
ch
er
s
s
u
ch
as
[
3
5
]
–
[
3
8
]
im
p
r
o
v
ed
S
er
p
en
t
b
y
c
h
an
g
i
n
g
t
h
e
f
u
n
cti
o
n
ality
o
f
th
e
alg
o
r
ith
m
.
Fo
r
i
n
s
tan
ce
,
r
esear
ch
er
s
[
3
5
]
m
o
d
if
ied
t
h
e
o
r
ig
in
al
S
-
b
o
x
to
c
o
n
s
u
m
e
less
tim
e.
I
n
a
s
im
ilar
f
ash
io
n
,
r
esear
c
h
er
s
[
3
6
]
also
m
o
d
if
ied
Ser
p
en
t
b
y
m
o
d
if
y
in
g
S
-
b
o
x
.
T
h
ey
u
s
e
4
×4
S
-
b
o
x
co
n
s
is
ti
n
g
o
f
b
y
tes
in
s
tead
o
f
n
ib
b
les
an
d
ac
h
iev
ed
less
s
p
ee
d
b
y
1
6
.
5
4
%
th
an
th
e
tr
a
d
itio
n
Ser
p
en
t.
On
th
e
o
th
e
r
h
an
d
,
r
esear
ch
e
r
s
[
3
7
]
,
[
3
8
]
u
ti
lize
ch
ao
tic
m
ap
to
en
h
an
ce
Ser
p
en
t.
I
n
p
ar
ticu
l
ar
,
E
lk
am
c
h
o
u
c
h
i
et
a
l.
[
3
7
]
r
ep
lace
d
th
e
S
-
b
o
x
with
ch
ao
tic
m
ap
p
in
g
a
n
d
cy
clin
g
g
r
o
u
p
an
d
r
e
d
u
ce
d
th
e
n
u
m
b
er
o
f
r
o
u
n
d
s
to
1
0
.
W
h
il
e
Yo
u
s
if
[
3
8
]
e
x
ch
an
g
ed
t
h
e
s
tatic
p
er
m
u
tatio
n
an
d
s
u
b
s
titu
tio
n
with
d
y
n
am
ic
al
p
r
o
p
er
ties
u
s
in
g
lo
g
is
tic
ch
ao
s
m
ap
,
h
en
ce
y
ield
in
g
g
r
ea
t
r
an
d
o
m
n
ess
wh
en
ju
x
tap
o
s
ed
with
tr
ad
itio
n
al
Se
r
p
en
t.
T
h
e
u
s
e
o
f
ch
a
o
tic
m
ap
en
h
an
ce
d
t
h
e
s
ec
u
r
ity
an
d
Se
r
p
en
t
b
ec
am
e
m
o
r
e
r
o
b
u
s
t.
L
i
k
ewise,
s
tu
d
ies
[
3
9
]
an
d
[
4
0
]
c
o
n
s
id
er
ed
th
e
u
s
e
o
f
ch
a
o
tic
m
ap
in
tex
t
en
c
r
y
p
tio
n
.
Par
ticu
lar
l
y
,
E
k
h
las
et
a
l.
[
3
9
]
u
tili
ze
d
c
h
ao
tic
to
en
cr
y
p
t te
x
t f
iles
b
y
d
if
f
u
s
in
g
th
e
p
o
s
itio
n
s
o
f
th
e
p
lai
n
tex
t A
SC
I
I
v
alu
es.
T
h
eir
m
eth
o
d
h
as
a
lar
g
e
k
e
y
s
p
ac
e,
a
u
n
if
o
r
m
h
is
to
g
r
am
a
n
d
is
s
en
s
itiv
e
to
an
y
b
it
alter
in
g
in
tex
t
o
r
k
e
y
.
W
h
er
ea
s
,
th
e
wo
r
k
o
f
C
h
ar
al
am
p
id
is
et
a
l.
[
4
0
]
p
r
esen
ted
a
n
o
v
el
1
-
D
ch
ao
tic
m
ap
th
at
d
is
p
lay
s
zo
n
es
o
f
co
n
s
tan
t
ch
ao
s
,
an
d
h
ig
h
v
alu
es
o
f
L
y
ap
u
n
o
v
ex
p
o
n
en
t
to
g
en
er
ate
a
p
s
eu
d
o
r
an
d
o
m
b
it
g
en
er
ato
r
.
Z
ag
i
an
d
Ma
o
lo
o
d
[
4
1
]
s
u
g
g
ested
a
n
ew
d
esig
n
to
th
e
k
ey
g
en
e
r
atio
n
as
th
e
s
ec
u
r
ity
o
f
an
y
en
c
r
y
p
tio
n
alg
o
r
ith
m
r
elies
s
o
lely
o
n
th
e
s
ec
u
r
ity
o
f
th
e
g
en
er
ated
k
ey
s
.
Sin
g
h
an
d
Sin
g
h
[
4
2
]
in
t
r
o
d
u
ce
d
th
e
id
ea
o
f
r
u
n
n
in
g
ea
c
h
b
lo
c
k
in
p
ar
allel
an
d
g
en
er
atin
g
d
if
f
er
en
t k
ey
s
f
o
r
ev
e
r
y
b
l
o
ck
.
I
n
a
r
ec
en
t
r
esear
ch
,
E
ls
h
o
u
s
h
et
a
l.
[
4
3
]
p
r
o
f
f
er
e
d
r
u
n
n
in
g
th
e
Ser
p
en
t
in
p
ar
allel
a
n
d
f
u
r
th
e
r
g
en
er
atin
g
b
lo
c
k
k
ey
s
u
s
in
g
L
o
r
en
z
9
6
ch
ao
tic
m
ap
.
T
h
eir
m
eth
o
d
attain
ed
a
r
ed
u
ctio
n
o
f
5
3
.
2
%
co
m
p
ar
ed
to
class
ical
Ser
p
en
t,
wh
er
ea
s
p
r
elim
in
ar
y
v
e
r
s
io
n
o
f
th
e
p
r
o
p
o
s
ed
m
eth
o
d
in
[
1
8
]
ac
h
iev
e
d
u
p
to
9
1
%
wh
en
r
u
n
n
in
g
in
f
iv
e
p
r
o
ce
s
s
es
as
th
ey
u
s
ed
C
T
R
m
o
d
e.
Hu
s
s
ain
et
a
l.
[
4
4
]
m
o
d
if
ied
Ser
p
e
n
t
b
y
u
s
in
g
p
o
wer
ass
o
ciativ
e
lo
o
p
a
n
d
g
r
o
u
p
o
f
p
er
m
u
tatio
n
s
.
T
h
eir
tech
n
iq
u
e
’
s
s
p
ee
d
is
co
m
p
ar
ab
le
to
3
-
D
E
S,
an
d
h
as
h
ig
h
er
s
ec
u
r
ity
,
s
en
s
itiv
ity
an
d
is
r
esis
tan
t to
cr
y
p
to
a
n
aly
tic
attac
k
s
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J E
lec
&
C
o
m
p
E
n
g
I
SS
N:
2088
-
8
7
0
8
Text
en
cryp
tio
n
u
s
in
g
s
ec
u
r
e
a
n
d
ex
p
e
d
itio
u
s
mu
ltip
r
o
ce
s
s
in
g
…
(
Hu
w
a
id
a
T.
E
ls
h
o
u
s
h
)
6755
3.
RE
S
E
ARCH
M
E
T
H
O
D
3
.
1
.
K
ey
g
ener
a
t
io
n
T
h
e
p
r
o
p
o
s
e
d
−
m
e
t
h
o
d
h
a
s
t
w
o
o
p
t
i
o
n
s
f
o
r
g
e
n
e
r
a
t
i
n
g
t
h
e
k
e
y
:
a
u
t
o
m
a
t
e
d
k
e
y
g
e
n
e
r
a
t
i
o
n
u
s
i
n
g
t
h
e
u
s
e
r
k
e
y
a
s
i
n
p
u
t
o
r
u
t
i
l
i
z
i
n
g
l
o
g
is
t
i
c
m
a
p
.
L
o
g
i
s
t
i
c
m
a
p
is
a
o
n
e
-
d
i
m
e
n
s
i
o
n
a
l
d
i
s
c
r
e
te
-
t
i
m
e
m
a
p
t
h
a
t
e
x
h
i
b
i
t
s
u
n
p
r
e
d
i
c
t
e
d
d
e
g
r
e
e
o
f
c
o
m
p
l
e
x
i
t
y
[
1
8
]
.
T
h
e
a
u
t
o
m
a
t
i
c
g
e
n
e
r
a
t
i
o
n
is
m
o
r
e
s
e
c
u
r
e
a
n
d
t
h
u
s
p
r
e
f
e
r
r
e
d
a
s
t
h
e
k
e
y
i
s
g
e
n
e
r
a
t
e
d
r
a
n
d
o
m
l
y
u
s
i
n
g
A
l
g
o
r
i
t
h
m
1
.
I
n
t
h
e
f
i
r
s
t
i
n
s
t
a
n
c
e
,
t
w
o
i
n
i
ti
a
l v
a
l
u
e
s
a
n
d
a
r
e
r
a
n
d
o
m
l
y
g
e
n
e
r
a
t
e
d
b
e
t
w
e
e
n
[
0
,
1
]
a
n
d
[
0
,
4
]
r
e
s
p
e
c
t
i
v
e
l
y
t
o
3
d
e
c
i
m
a
l
p
l
a
ce
s
.
T
h
e
v
al
u
e
t
h
e
n
r
e
m
a
i
n
s
c
o
n
s
t
a
n
t
.
N
e
x
t
,
t
h
e
k
e
y
is
g
e
n
e
r
at
e
d
a
f
t
er
+
1
i
te
r
a
t
i
o
n
s
t
o
g
i
v
e
a
d
e
c
i
m
al
n
u
m
b
e
r
w
h
i
c
h
a
f
t
e
r
c
o
n
v
e
r
t
i
n
g
i
t
t
o
b
i
n
a
r
y
y
i
e
l
d
s
a
2
5
6
-
b
i
t
k
e
y
.
Alg
o
r
ith
m
1
.
Key
g
e
n
er
atio
n
u
s
in
g
lo
g
is
tic
m
ap
Input: KeySize
Output: HexaKey
// Hexadecimal 256 Key
1.
Function Logist icMap (KeySize):
2.
←
randomnumber (0, 1),
3;
// generating an initial value X
0
between 0 and 1 (to 3 decimal places)
3.
←
randommunber
(
0,4
),
3;4
//generating a positive constant r between 0 and 4 (to 3 decimal places)
4.
HexaKey
←
empty
5.
for i=0 to KeySize do
6.
(
+
1
)
←
∗
(
1
−
)
//
Logistic
map equation
7.
HexaKey
←
HexaKey.append(ConvertDecToHexa(DecValueOf (X*10
ᴵ
⁶
)/256));
//Each time get one Hexadecimal Value
8.
E
nd
9.
Return: HexaKey
3
.
2
.
E
ncry
ptio
n/
decr
y
ptio
n
us
ing
t
he
pro
po
s
e
d
−
T
h
e
p
r
o
p
o
s
e
d
−
e
n
c
r
y
p
t
i
o
n
/
d
e
c
r
y
p
t
i
o
n
A
l
g
o
r
i
t
h
m
2
r
u
n
s
t
h
e
S
er
p
e
n
t
u
s
i
n
g
C
T
R
m
o
d
e
,
a
n
d
a
l
l
o
w
s
i
t
t
o
e
n
c
r
y
p
t
/
d
e
c
r
y
p
t
m
u
l
ti
p
l
e
b
l
o
c
k
s
i
n
p
a
r
a
l
l
e
l
u
s
i
n
g
m
u
l
ti
p
l
e
C
PU
s
,
an
d
t
h
a
t
i
s
d
o
n
e
b
y
d
i
v
i
d
i
n
g
t
h
e
i
n
p
u
t
p
l
a
i
n
t
e
x
t
i
n
to
d
a
t
a
c
h
u
n
k
s
.
E
a
c
h
c
h
u
n
k
w
i
l
l
b
e
h
a
n
d
l
e
d
b
y
o
n
e
C
P
U
a
n
d
t
h
e
d
a
t
a
c
h
u
n
k
s
i
z
e
i
s
b
a
s
e
d
o
n
t
h
e
n
u
m
b
e
r
o
f
C
PU
s
.
H
e
n
c
e
,
m
u
lt
i
p
l
e
C
P
Us
wi
l
l
b
e
r
u
n
n
i
n
g
w
i
t
h
p
a
r
t
o
f
a
n
i
n
it
i
a
l
i
n
p
u
t
,
a
n
d
h
a
n
d
l
es
t
h
e
i
n
p
u
t
t
h
e
s
a
m
e
w
a
y
t
h
at
t
h
e
n
o
r
m
a
l
S
e
r
p
e
n
t
w
o
r
k
s
.
Al
g
o
r
i
t
h
m
2
t
a
k
es
a
s
i
n
p
u
t
t
h
e
t
o
b
e
e
n
c
r
y
p
t
e
d
/
d
e
c
r
y
p
t
e
d
,
a
K
e
y
g
e
n
e
r
a
t
e
d
a
s
e
x
p
l
a
i
n
e
d
p
r
e
v
i
o
u
s
l
y
i
n
A
l
g
o
r
i
t
h
m
1
,
a
n
d
i
n
i
t
i
a
l
v
e
c
t
o
r
I
V
a
n
d
w
h
i
c
h
i
s
t
h
e
n
u
m
b
e
r
o
f
c
o
n
c
u
r
r
e
n
t
p
r
o
c
e
s
s
e
s
.
Fi
r
s
t
,
i
t
c
a
l
ls
A
l
g
o
r
i
t
h
m
3
(
,
)
w
i
t
h
p
a
r
a
m
e
t
e
r
s
a
n
d
t
o
s
p
l
i
t
t
h
e
t
e
x
t
i
n
t
o
b
l
o
c
k
s
t
o
b
e
p
r
o
c
e
s
s
e
d
e
x
p
e
d
i
t
i
o
u
s
l
y
u
s
i
n
g
m
u
l
t
i
p
l
e
C
P
Us
a
n
d
r
e
t
u
r
n
s
S
p
li
t
B
l
o
c
k
s
,
w
h
i
c
h
i
s
a
l
is
t
o
f
s
p
lit
b
l
o
c
k
s
.
I
n
t
h
e
f
i
r
s
t
i
n
s
t
a
n
c
e
,
Al
g
o
r
i
t
h
m
3
(
,
)
t
a
k
es
as
i
n
p
u
t
p
a
r
a
m
e
t
e
r
s
,
a
n
d
t
h
e
.
F
i
r
s
t
,
it
c
h
e
c
k
s
i
f
t
h
e
t
e
x
t
t
o
b
e
s
p
l
i
t
is
d
i
v
is
i
b
l
e
b
y
t
h
e
b
l
o
c
k
s
i
z
e
,
a
n
d
f
i
n
a
l
l
y
r
e
t
u
r
n
s
a
l
i
s
t
o
f
s
p
l
it
u
p
b
l
o
c
k
s
,
t
o
b
e
p
a
s
s
e
d
b
a
c
k
t
o
al
g
o
r
i
t
h
m
2
.
T
h
i
s
i
s
d
e
p
i
c
te
d
i
n
t
h
e
f
l
o
w
c
h
a
r
t
s
h
o
w
n
F
i
g
u
r
e
1
.
N
e
x
t
,
A
l
g
o
r
i
t
h
m
2
c
o
n
t
i
n
u
es
t
o
p
r
e
p
a
r
e
t
h
e
l
is
t
o
f
b
l
o
c
k
s
t
o
b
e
s
c
h
e
d
u
l
e
d
f
o
r
ea
c
h
C
PU
.
I
t
t
h
e
n
c
a
ll
s
A
l
g
o
r
i
t
h
m
4
w
it
h
p
a
r
a
m
e
t
e
r
s
I
V
a
n
d
,
w
h
i
c
h
is
t
h
e
i
n
d
ex
o
f
t
h
e
li
s
t
o
f
b
l
o
c
k
s
.
Fi
n
a
l
l
y
,
A
l
g
o
r
i
t
h
m
4
r
et
u
r
n
s
a
N
o
n
c
e
f
o
r
e
a
c
h
C
PU
t
o
b
e
u
s
e
d
as
a
n
i
n
p
u
t
t
o
A
l
g
o
r
ith
m
5
w
i
t
h
t
h
e
o
t
h
e
r
t
w
o
p
a
r
a
m
et
e
r
s
a
n
d
.
S
u
b
s
e
q
u
e
n
t
l
y
,
A
l
g
o
r
i
t
h
m
5
e
n
c
r
y
p
t
/
d
e
c
r
y
p
t
e
a
c
h
b
l
o
c
k
u
s
i
n
g
t
h
e
p
r
o
p
o
s
e
d
S
e
r
p
e
n
t
u
s
i
n
g
l
o
g
i
s
t
i
c
m
a
p
a
n
d
C
T
R
m
o
d
e
.
T
h
e
r
e
a
f
t
e
r
,
t
h
e
e
n
c
r
y
p
t
e
d
/
d
e
c
r
y
p
t
e
d
b
l
o
c
k
s
a
r
e
j
o
i
n
e
d
t
o
g
e
t
h
e
r
t
o
f
o
r
m
t
h
e
f
i
n
al
c
i
p
h
e
r
-
t
e
x
t
/
p
l
a
i
n
t
e
x
t
t
o
b
e
r
e
tu
r
n
e
d
a
s
b
y
t
h
e
m
a
i
n
A
l
g
o
r
it
h
m
2
.
I
t
i
s
w
o
r
t
h
y
o
f
m
e
n
t
i
o
n
t
h
at
w
h
en
d
e
c
r
y
p
t
i
n
g
,
c
i
p
h
e
r
t
e
x
t
d
a
t
a
w
i
l
l
b
e
s
p
li
t
a
n
d
at
t
h
e
e
n
d
,
t
h
e
p
r
o
d
u
c
e
d
b
l
o
c
k
s
a
r
e
a
m
a
l
g
a
m
a
t
e
d
t
o
g
et
h
e
r
t
o
c
o
n
s
t
r
u
c
t
t
h
e
f
i
n
a
l
p
l
ai
n
t
e
x
t
.
Alg
o
r
ith
m
2
.
Pro
p
o
s
ed
−
en
cr
y
p
tio
n
/d
ec
r
y
p
tio
n
p
r
o
ce
s
s
Input: InputText, Key, IV, ConcProcesses
// InputText
= plaintext/ciphortext;
Key=256
-
bits user key; IV=64
-
bits initial
-
vector;
ConcProcesses no. of concurrent processes
Output: OutputTert,
1.
Function EncDeCTR (InputText, Key, IV,ConcProcesses) :
2.
BlockSize
←
128
3.
SplitBlocks
←
call SplitBlocks
(BlockSize, InputText) // Calling method SplitBlocks
with parameters Blocksize and InputText to be encrypted/decrypted & output SpluBlocks
4.
if there is an error in SplitBlocks method then
5.
go to step 30
6.
end
7.
DataSize
←
length (SplitBlocks)
8.
ChunkSizelnt
←
DataSize/
ConcProcesses
9.
if ChunkSizelnt is 0 then
10.
ChunkSizeInt
←
1
11.
end
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
0
8
8
-
8
7
0
8
I
n
t J E
lec
&
C
o
m
p
E
n
g
,
Vo
l.
14
,
No
.
6
,
Dec
em
b
e
r
20
24
:
6
7
5
3
-
6
7
7
2
6756
//If the number of processes is more than number of blocks, then each process will
handle one block
12.
Task Datalndex
←
1
13.
RunningProcessesHolder
←
empty
14.
while TaskDatalndex < DataSize do
15.
TakeBlocks
←
Split Blocks.take Blocks(from TaskDatalndex,..., to (TaskDatalndex +
ChunkSizeInt))
16.
Task Nonce
←
call GenerateNonce(IV.Task Datalndex) // Calling method GenenuteNoec
with parameters TaskDataIndex & output variable Nonce
17.
StartNewProcess
←
call Bulk EncDec(Task Blocks, TaskNonce. Key)
// Calling mathod
BulkEnDec with parameter TaskBlocks, TaskNonce and key & outputEncrDecTaskBlocks
18.
RunningProcessesHolder.add (StartNewProcess)
19.
Task DataIndex
←
Task DataIndex
-
ChunkSizeInt // update chunk index
20.
end
21.
Wait until all processes are done
22.
RunningP rocessIndex
←
1
23.
OutputText
←
empty
24.
NumberOfTasks
←
length(RunningP rocessesHolder)
25.
while RunningProcessIndex < NumberOfTasks do
26.
OutputText.join(
RunningProcessesHolder[RunningProcessIndex].result)
27.
RunningProcessIndex
←
RunningProcessIndex + 1 // next process index
28.
end
29.
Return: OutputText
30.
End Function
Alg
o
r
ith
m
3
.
Sp
litt
in
g
th
e
b
lo
ck
s
alg
o
r
ith
m
Input: BlockSize, T extT oSplit
; // Expected block size is 128
Output: SplitBlocks; // A list of split blocks
1.
Function SplitBlocks(BlockSize, TextToSplit):
2.
TextT oSplitBits
←
length(TextT oSplit)
3.
if TextToSplitBits mod BlockSize ≠ 0 then
4.
raise error and go to step 14
5.
end
;
// should be divisible by block size
6.
SplitBlocks
←
empty
7.
BlockIndex
←
1
8.
while BlockIndex < TextToSplitBits do
9.
TakeBlockF romT ext
←
TextToSplit.split(from BlockIndex to (BlockIndex + BlockSize))
10.
SplitBlocks.add(TakeBlockF romText)
11.
BlockIndex
←
BlockIndex + BlockSize ; // update next block start point
12.
end
13.
Return: SplitBlocks; // List of split blocks
14.
End Function
Alg
o
r
ith
m
4
.
Get
No
n
ce
b
y
I
V
-
b
ase
an
d
I
D
al
g
o
r
ith
m
Input: IV base, ID;
// IV
-
base is 64 bits; ID is an integer
Output: Nonce
1.
Function GenerateNonce(IV base, ID):
2.
NoncePostf ix
←
ConvertDecTo64Bits(ID)
3.
Nonce
←
IV base.append(NonceP ostf ix)
4.
Return: Nonce
5.
End Function
Alg
o
r
ith
m
5
.
B
u
lk
en
cr
y
p
t/d
ec
r
y
p
t a
lg
o
r
ith
m
Input: TaskBlocks, TaskNonce, Key
Output: EncDecTaskBlocks
1.
Function BulkEncDec(TaskBlocks, TaskNonce, Key):
2.
TaskBlocksSize
←
Length (TaskBlocks)
3.
EncDecTaskBlocks
←
empty
4.
BlockIndex
←
1
5.
while BlockIndex <
TaskBlocksSize do
6.
EncDecBlcok
←
BinaryXOR(TaskBlocks.getBlockAt[BlockIndex], SerpentEncDec(TaskNonce, Key))
7.
EncDecTaskBlocks.add(EncDecBlcok)
8.
TaskNonce ← IncrementNonce(TaskNonce
) ; // Add 1 to the current nonce
9.
BlockIndex ← BlockIndex + 1; // Go to the next block
10.
end
11.
Return: EncrDecTaskBlocks
12.
End Function
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J E
lec
&
C
o
m
p
E
n
g
I
SS
N:
2088
-
8
7
0
8
Text
en
cryp
tio
n
u
s
in
g
s
ec
u
r
e
a
n
d
ex
p
e
d
itio
u
s
mu
ltip
r
o
ce
s
s
in
g
…
(
Hu
w
a
id
a
T.
E
ls
h
o
u
s
h
)
6757
Fig
u
r
e
1
.
T
h
e
p
r
o
p
o
s
ed
e
n
cr
y
p
tio
n
/d
ec
r
y
p
tio
n
−
alg
o
r
ith
m
f
lo
wch
ar
t
3.
RE
SU
L
T
S AN
D
D
I
SCU
SS
I
O
N
T
h
i
s
s
e
c
ti
o
n
p
r
e
s
e
n
ts
s
e
r
i
es
o
f
e
x
p
e
r
i
m
e
n
t
s
t
o
e
v
a
l
u
a
t
e
th
e
p
e
r
f
o
r
m
a
n
c
e
a
n
d
d
e
m
o
n
s
tr
a
t
i
n
g
t
h
e
e
f
f
i
c
i
e
n
c
y
o
f
t
h
e
p
r
o
p
o
s
e
d
ex
p
e
d
i
t
i
o
u
s
n
e
s
s
−
i
n
r
e
l
a
ti
o
n
t
o
t
h
e
e
x
ec
u
t
i
o
n
ti
m
e
,
a
n
d
c
o
m
p
a
r
i
n
g
i
t
s
p
e
r
f
o
r
m
a
n
c
e
wi
th
t
h
e
t
r
a
d
it
i
o
n
a
l
S
e
r
p
e
n
t
.
F
r
o
m
t
h
e
s
e
c
u
r
i
t
y
a
s
p
e
ct
,
t
h
e
k
e
y
s
p
a
c
e
o
f
t
h
e
p
r
o
p
o
s
e
d
m
e
t
h
o
d
h
a
s
b
e
e
n
i
n
v
e
s
t
i
g
a
t
e
d
.
M
o
r
e
o
v
e
r
,
c
o
m
p
a
r
i
s
o
n
s
t
o
r
el
a
te
d
s
c
h
e
m
e
s
a
r
e
a
ls
o
c
o
n
d
u
c
t
e
d
.
4
.
1
.
P
re
li
m
ina
ries
T
h
e
p
r
o
p
o
s
ed
−
an
d
tr
a
d
itio
n
al
Ser
p
en
t
wer
e
im
p
lem
e
n
ted
u
s
in
g
Py
th
o
n
3
.
9
.
All
th
e
ex
p
er
im
en
tal
r
esu
lts
wer
e
test
ed
o
n
a
lap
to
p
with
W
in
d
o
ws
6
4
b
it
OS.
T
h
e
lap
to
p
s
p
ec
if
icatio
n
s
wer
e
4
GB
R
AM
an
d
C
o
r
e
i5
p
r
o
ce
s
s
o
r
with
2
.
2
0
GHz
s
p
ee
d
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
0
8
8
-
8
7
0
8
I
n
t J E
lec
&
C
o
m
p
E
n
g
,
Vo
l.
14
,
No
.
6
,
Dec
em
b
e
r
20
24
:
6
7
5
3
-
6
7
7
2
6758
4
.
2
.
P
er
f
o
r
m
a
nce
t
esting
T
h
e
e
x
ec
u
t
io
n
ti
m
e
is
o
n
e
o
f
th
e
m
o
s
t
s
i
g
n
i
f
ic
an
t
m
e
tr
ic
s
t
h
at
r
e
f
l
ec
ts
t
h
e
p
e
r
f
o
r
m
a
n
ce
o
f
a
n
y
en
cr
y
p
ti
o
n
a
lg
o
r
it
h
m
.
He
n
c
e,
th
e
p
er
f
o
r
m
an
ce
o
f
p
r
o
p
o
s
e
d
m
et
h
o
d
−
was
t
este
d
u
s
i
n
g
1
0
d
if
f
e
r
en
t
b
lo
c
k
s
iz
es
a
n
d
d
i
f
f
er
e
n
t
n
u
m
b
e
r
o
f
C
PUs
a
n
d
t
h
e
e
x
ec
u
t
io
n
tim
es
w
er
e
m
eti
c
u
l
o
u
s
ly
r
ec
o
r
d
e
d
i
n
s
ec
o
n
d
s
.
E
a
ch
b
l
o
c
k
s
iz
e
is
te
s
ted
t
wic
e
f
o
r
b
o
t
h
en
c
r
y
p
t
io
n
a
n
d
d
e
c
r
y
p
t
io
n
,
h
e
n
ce
a
t
o
t
al
o
f
8
0
e
x
p
e
r
i
m
e
n
ts
wer
e
p
er
f
o
r
m
ed
u
s
i
n
g
d
if
f
e
r
en
t
p
r
o
ce
s
s
o
r
s
y
iel
d
i
n
g
a
g
r
an
d
t
o
ta
l
o
f
1
6
0
e
x
p
e
r
i
m
e
n
t
s
.
Fu
r
t
h
e
r
m
o
r
e
,
t
h
e
p
e
r
f
o
r
m
a
n
c
e
o
f
t
h
e
p
r
o
p
o
s
e
d
m
et
h
o
d
is
s
c
r
u
ti
n
i
ze
d
a
n
d
j
u
x
t
ap
o
s
e
d
ag
ai
n
s
t
t
h
e
tr
ad
iti
o
n
al
Ser
p
e
n
t
as
d
e
p
ic
te
d
in
T
ab
le
1
a
n
d
T
a
b
l
e
2
.
T
h
ese
ta
b
l
es
we
r
e
s
p
lit
i
n
t
o
tw
o
g
r
o
u
p
s
o
f
s
m
al
l
an
d
la
r
g
e
b
l
o
c
k
s
izes
.
T
h
e
las
t
t
h
r
e
e
co
l
u
m
n
s
in
ea
c
h
t
ab
le
e
x
p
o
u
n
d
t
h
e
e
n
c
r
y
p
ti
o
n
/
d
ec
r
y
p
ti
o
n
r
e
d
u
cti
o
n
r
at
es
wh
en
co
m
p
a
r
e
d
wit
h
th
e
tr
a
d
iti
o
n
a
l
Ser
p
e
n
t
.
T
ab
le
1
.
E
n
cr
y
p
tio
n
ex
ec
u
tio
n
tim
e
an
d
r
e
d
u
ctio
n
r
ate
(
in
%)
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
ed
with
tr
ad
itio
n
al
Ser
p
en
t
f
o
r
d
if
f
er
en
t b
lo
c
k
s
izes
B
l
o
c
k
S
i
z
e
(
i
n
b
i
t
s)
En
c
r
y
p
t
i
o
n
e
x
e
c
u
t
i
o
n
t
i
m
e
(
i
n
s
e
c
)
En
c
r
y
p
t
i
o
n
r
e
d
u
c
t
i
o
n
r
a
t
e
(
i
n
%)
Tr
a
d
i
t
i
o
n
a
l
S
e
r
p
e
n
t
P
r
o
p
o
se
d
−
2
C
P
U
s
4
C
P
U
s
8
C
P
U
s
2
C
P
U
s
4
C
P
U
s
8
C
P
U
s
S
mal
l
B
l
o
c
k
S
i
z
e
s
64
0
.
8
8
0
.
5
9
0
.
4
1
0
.
3
4
3
2
.
2
3
5
4
.
1
3
6
1
.
4
2
1
2
8
1
.
5
3
0
.
9
9
0
.
6
1
0
.
4
7
3
5
.
1
8
6
0
.
1
2
6
9
.
2
7
2
5
6
3
.
1
8
1
.
9
1
1
.
0
9
0
.
7
7
3
9
.
8
5
6
5
.
7
2
7
5
.
6
5
5
1
2
6
.
3
5
3
.
6
7
1
.
9
8
1
.
3
6
4
2
.
0
8
6
8
.
7
9
7
8
.
5
3
1
0
2
4
1
2
.
9
7
7
.
0
4
3
.
7
5
2
.
4
9
4
5
.
7
2
7
1
.
0
6
8
0
.
8
1
La
r
g
e
B
l
o
c
k
S
i
z
e
s
1
0
0
0
0
1
2
3
.
3
3
1
0
1
.
3
1
4
7
.
8
9
2
8
.
9
5
1
7
.
8
5
6
1
.
1
7
7
6
.
5
2
2
5
0
0
0
3
7
6
.
2
4
2
3
2
.
9
9
1
2
6
.
2
9
7
5
.
9
8
3
8
.
0
8
6
6
.
4
3
7
9
.
8
1
5
0
0
0
0
6
1
7
.
8
5
4
7
1
.
4
8
2
5
8
.
8
7
1
5
2
.
5
5
2
3
.
6
9
5
8
.
1
0
7
5
.
3
1
1
0
0
0
0
0
1
2
1
8
.
8
4
9
5
5
.
7
4
5
1
5
.
9
8
3
0
5
.
2
8
2
1
.
5
8
5
7
.
6
6
7
4
.
9
5
2
5
0
0
0
0
3
0
4
0
.
8
6
2
4
3
2
.
8
9
1
2
9
1
.
0
2
7
7
3
.
5
6
1
9
.
9
9
5
7
.
5
4
7
4
.
5
6
T
ab
le
2
.
Dec
r
y
p
tio
n
e
x
ec
u
tio
n
tim
e
an
d
r
e
d
u
ctio
n
r
ate
(
in
%)
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
ed
with
tr
ad
itio
n
al
Ser
p
en
t
f
o
r
d
if
f
er
en
t b
lo
c
k
s
izes
B
l
o
c
k
s
i
z
e
(
i
n
b
i
t
s)
D
e
c
r
y
p
t
i
o
n
e
x
e
c
u
t
i
o
n
t
i
me
(
i
n
se
c
)
D
e
c
r
y
p
t
i
o
n
r
e
d
u
c
t
i
o
n
r
a
t
e
(
i
n
%)
Tr
a
d
i
t
i
o
n
a
l
S
e
r
p
e
n
t
P
r
o
p
o
se
d
−
2
C
P
U
s
4
C
P
U
s
8
C
P
U
s
2
C
P
U
s
4
C
P
U
s
8
C
P
U
s
S
mal
l
b
l
o
c
k
si
z
e
s
64
0
.
7
4
0
.
6
1
0
.
3
9
0
.
3
2
1
7
.
7
5
4
6
.
6
5
5
6
.
5
5
1
2
8
1
.
4
7
0
.
9
5
0
.
6
1
0
.
4
6
3
5
.
3
7
5
8
.
7
8
6
8
.
4
3
2
5
6
2
.
9
8
2
.
0
2
1
.
1
1
0
.
7
6
3
2
.
2
3
6
2
.
8
7
7
4
.
3
3
5
1
2
5
.
8
9
3
.
6
9
1
.
9
9
1
.
3
3
3
7
.
1
7
6
6
.
2
7
7
7
.
4
5
1
0
2
4
1
1
.
8
1
6
.
9
3
3
.
7
7
2
.
6
4
4
1
.
2
8
6
8
.
1
0
7
7
.
6
6
La
r
g
e
B
l
o
c
k
S
i
z
e
s
1
0
0
0
0
1
1
4
.
8
3
9
2
.
9
5
4
9
.
4
9
3
0
.
1
2
1
9
.
0
5
5
6
.
9
0
7
3
.
7
7
2
5
0
0
0
2
8
9
.
6
2
2
3
5
.
7
3
1
2
8
.
8
4
7
6
.
1
5
1
8
.
6
1
5
5
.
5
1
7
3
.
7
1
5
0
000
5
6
5
.
5
8
4
6
9
.
9
5
2
6
0
.
0
6
1
5
3
.
5
4
1
6
.
9
1
5
4
.
0
2
7
2
.
8
5
1
0
0
0
0
0
1
1
3
6
.
4
6
9
8
2
.
2
7
5
1
3
.
7
3
3
0
6
.
3
2
1
3
.
5
7
5
4
.
7
9
7
3
.
0
5
2
5
0
0
0
0
2
8
2
9
.
7
3
2
3
4
9
.
8
6
1
3
0
0
.
5
2
7
5
8
.
8
9
1
6
.
9
6
5
4
.
0
4
7
3
.
1
8
4
.
2
.
1
.
T
he
encr
y
ptio
n pro
ce
s
s
perf
o
rm
a
nce
us
ing
2
,
4
,
a
nd
8
CP
Us
L
o
o
k
i
n
g
at
T
a
b
le
1
,
Fi
g
u
r
e
2
(
a
)
a
n
d
2
(
b
)
i
t
is
v
e
r
y
o
b
v
i
o
u
s
t
h
at
t
h
e
p
r
o
p
o
s
e
d
−
m
et
h
o
d
o
u
t
p
e
r
f
o
r
m
e
d
t
h
e
tr
a
d
i
tio
n
a
l
Se
r
p
e
n
t
i
n
t
h
e
e
n
c
r
y
p
ti
o
n
p
r
o
c
ess
.
R
eg
ar
d
i
n
g
s
m
al
l
b
l
o
c
k
s
i
ze
s
,
it
is
v
er
y
b
la
ta
n
t
th
at
th
e
en
cr
y
p
ti
o
n
t
i
m
e
is
m
u
ch
less
es
p
e
cia
ll
y
w
h
e
n
co
n
s
i
d
er
i
n
g
8
C
PUs
.
T
h
e
m
o
r
e
t
h
e
n
u
m
b
e
r
o
f
C
PUs
,
th
e
less
t
h
e
e
n
cr
y
p
ti
o
n
e
x
e
cu
ti
o
n
t
im
e.
T
h
e
r
e
d
u
c
ti
o
n
r
ates
f
o
r
t
h
e
t
h
r
ee
t
este
d
C
P
Us
a
r
e
p
r
ese
n
t
e
d
i
n
th
e
l
ast
t
h
r
ee
c
o
l
u
m
n
s
o
f
T
ab
le
1
,
a
n
d
t
h
e
p
r
o
p
o
s
e
d
m
e
th
o
d
a
ch
i
e
v
e
d
u
p
to
7
7
.
6
6
%
r
e
d
u
ct
io
n
r
a
te
f
o
r
1
,
0
2
4
b
i
ts
o
f
d
ata
c
o
m
p
ar
ed
wit
h
t
h
e
t
r
a
d
it
io
n
a
l
Se
r
p
e
n
t
.
E
v
en
f
o
r
m
u
ch
la
r
g
e
r
b
lo
c
k
s
iz
es,
t
h
e
r
e
d
u
ct
io
n
r
a
te
was
o
n
av
er
ag
e
7
3
%
w
h
e
n
ju
x
t
a
p
o
s
e
d
w
it
h
t
r
a
d
it
i
o
n
al
S
er
p
en
t.
Fi
g
u
r
e
s
3
(
a
)
a
n
d
3
(
b
)
d
e
p
i
cts
th
e
r
e
d
u
c
ti
o
n
r
ates
f
o
r
d
i
f
f
er
e
n
t
b
l
o
c
k
s
iz
es
(
s
m
all
s
iz
e
a
n
d
l
a
r
g
e
s
i
ze
)
,
r
es
p
e
cti
v
e
ly
.
I
t
is
n
o
tew
o
r
t
h
y
t
o
p
r
o
m
u
l
g
a
te
th
a
t t
h
e
e
n
cr
y
p
ti
o
n
r
e
d
u
ct
io
n
r
at
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
m
et
h
o
d
p
a
r
a
lle
l
e
x
ec
u
t
io
n
o
f
s
m
all
b
l
o
c
k
s
i
ze
s
is
c
er
t
ain
ly
l
ess
a
n
d
will
in
c
r
ea
s
e
j
u
s
t
as
th
e
b
lo
c
k
s
i
ze
i
n
c
r
e
ases
.
No
n
e
t
h
el
ess
,
t
h
e
i
n
cr
ea
s
e
will
r
e
m
a
in
r
o
u
g
h
ly
c
o
n
s
ta
n
t
af
te
r
a
p
a
r
ti
c
u
la
r
v
al
u
e
as
cl
ea
r
l
y
m
a
n
if
es
te
d
in
T
a
b
le
1
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J E
lec
&
C
o
m
p
E
n
g
I
SS
N:
2088
-
8
7
0
8
Text
en
cryp
tio
n
u
s
in
g
s
ec
u
r
e
a
n
d
ex
p
e
d
itio
u
s
mu
ltip
r
o
ce
s
s
in
g
…
(
Hu
w
a
id
a
T.
E
ls
h
o
u
s
h
)
6759
(
a
)
(
b
)
Fig
u
r
e
2
.
E
n
cr
y
p
tio
n
ex
ec
u
tio
n
tim
e
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
e
d
with
tr
ad
itio
n
al
Ser
p
en
t
u
s
in
g
d
if
f
er
en
t b
lo
c
k
s
izes,
(
a)
lar
g
e
s
ize,
(
b
)
s
m
all
s
ize
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
0
8
8
-
8
7
0
8
I
n
t J E
lec
&
C
o
m
p
E
n
g
,
Vo
l.
14
,
No
.
6
,
Dec
em
b
e
r
20
24
:
6
7
5
3
-
6
7
7
2
6760
(
a
)
(
b
)
Fig
u
r
e
3
.
R
ed
u
ctio
n
r
ate
o
f
en
cr
y
p
tio
n
e
x
ec
u
tio
n
tim
e
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
e
d
with
tr
ad
itio
n
al
Ser
p
en
t
u
s
in
g
d
if
f
e
r
en
t b
lo
ck
s
izes,
(
a)
s
m
all
s
ize,
(
b
)
lar
g
e
s
ize
4
.
2
.
2
.
T
he
decr
y
ptio
n pro
ce
s
s
perf
o
rm
a
nce
us
ing
2
,
4
a
nd
8
CP
Us
T
a
b
le
2
an
d
Fi
g
u
r
e
s
4
(
a)
a
n
d
4
(
b
)
m
an
if
est
t
h
e
s
u
r
p
ass
o
f
th
e
p
r
o
p
o
s
e
d
−
m
et
h
o
d
i
n
t
h
e
d
e
cr
y
p
ti
o
n
e
x
ec
u
ti
o
n
ti
m
e
.
Usi
n
g
8
C
PUs
,
a
lle
v
i
at
ed
th
e
r
e
d
u
cti
o
n
r
at
e
u
p
t
o
7
7
.
6
6
%
f
o
r
1
0
2
4
b
y
tes
o
f
b
lo
c
k
d
ata
a
n
d
a
n
a
v
e
r
a
g
e
o
f
7
3
.
5
%
f
o
r
l
ar
g
e
d
ata
b
l
o
c
k
s
.
Sc
r
u
ti
n
iz
i
n
g
th
e
las
t
th
r
e
e
c
o
l
u
m
n
s
o
f
T
a
b
le
2
,
ev
id
e
n
tl
y
p
r
o
cl
ai
m
t
h
at
t
h
e
p
r
o
p
o
s
e
d
m
et
h
o
d
o
u
t
co
m
p
et
es
th
e
s
ta
n
d
a
r
d
S
er
p
e
n
t
a
n
d
less
en
ed
t
h
e
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J E
lec
&
C
o
m
p
E
n
g
I
SS
N:
2088
-
8
7
0
8
Text
en
cryp
tio
n
u
s
in
g
s
ec
u
r
e
a
n
d
ex
p
e
d
itio
u
s
mu
ltip
r
o
ce
s
s
in
g
…
(
Hu
w
a
id
a
T.
E
ls
h
o
u
s
h
)
6761
d
e
cr
y
p
ti
o
n
ti
m
e
g
r
ea
t
ly
.
T
h
is
is
e
v
i
n
c
e
d
in
Fi
g
u
r
e
s
5
(
a)
a
n
d
5
(
b
)
f
o
r
s
m
all
a
n
d
la
r
g
e
d
at
a
b
lo
c
k
s
ap
ie
ce
.
C
o
n
s
eq
u
en
tl
y
,
u
s
i
n
g
p
a
r
al
lel
p
r
o
ce
s
s
i
n
g
a
n
d
h
e
n
c
e
m
u
lti
p
l
e
C
PUs
a
b
a
te
t
h
e
e
x
e
cu
ti
o
n
p
e
r
f
o
r
m
a
n
ce
t
o
a
g
r
ea
t
ex
t
e
n
t.
(
a
)
(
b
)
Fig
u
r
e
4
.
Dec
r
y
p
tio
n
ex
ec
u
tio
n
tim
e
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
e
d
with
tr
ad
itio
n
al
Ser
p
en
t
u
s
in
g
d
if
f
er
en
t b
lo
c
k
s
izes,
(
a)
lar
g
e
s
ize,
(
b
)
s
m
all
s
ize
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
0
8
8
-
8
7
0
8
I
n
t J E
lec
&
C
o
m
p
E
n
g
,
Vo
l.
14
,
No
.
6
,
Dec
em
b
e
r
20
24
:
6
7
5
3
-
6
7
7
2
6762
(
a
)
(
b
)
Fig
u
r
e
5
.
R
ed
u
ctio
n
r
ate
o
f
d
e
cr
y
p
tio
n
e
x
ec
u
tio
n
tim
e
o
f
p
r
o
p
o
s
ed
−
co
m
p
ar
e
d
with
tr
ad
itio
n
al
Ser
p
en
t
u
s
in
g
d
if
f
e
r
en
t b
lo
ck
s
izes,
(
a)
lar
g
e
s
ize,
(
b
)
s
m
all
s
ize
4
.
2
.
3
.
CP
U
us
a
g
e
a
na
ly
s
is
Fig
u
r
e
6
d
is
p
la
y
s
t
h
e
C
PU
u
s
a
g
e
o
f
t
h
e
tr
ad
iti
o
n
al
Se
r
p
e
n
t
(
u
s
i
n
g
o
n
e
C
PU)
t
o
g
et
h
e
r
wi
th
th
a
t
o
f
th
e
p
r
o
p
o
s
e
d
−
m
et
h
o
d
wh
en
u
s
in
g
2
,
4
,
an
d
8
C
PUs
r
esp
ec
ti
v
ely
.
I
n
Fi
g
u
r
e
6
(
a
)
,
o
n
l
y
C
PU
6
is
u
ti
liz
ed
f
u
ll
y
,
w
h
il
e
Fig
u
r
e
6
(
b
)
s
h
o
ws
th
e
f
u
l
l
u
s
a
g
e
o
f
b
o
t
h
C
PU
5
a
n
d
C
PU
6
.
O
n
t
h
e
o
t
h
er
h
a
n
d
,
Fig
u
r
e
s
6
(
c)
a
n
d
6
(
d
)
d
is
p
l
a
y
t
h
e
e
x
p
l
o
it
ati
o
n
o
f
u
tt
er
ly
m
u
lti
p
le
C
PUs
an
d
h
e
n
c
e
t
h
e
s
u
p
er
i
o
r
u
t
iliz
ati
o
n
o
f
t
h
e
C
PUs
.
T
h
is
h
as
a
h
ig
h
e
f
f
ec
t
o
n
t
h
e
C
PU
u
s
a
g
e
a
n
d
cl
ea
r
l
y
t
h
e
p
r
o
p
o
s
ed
m
et
h
o
d
p
r
ev
ail
e
d
o
v
e
r
th
e
tr
ad
iti
o
n
al
Ser
p
e
n
t
wi
th
r
es
p
e
ct
t
o
C
PU
u
s
ag
e.
Evaluation Warning : The document was created with Spire.PDF for Python.