Cryptography Reference
In-Depth Information
Table 3.
Message Ordering in HAS-V (Common between
w
j
and
w
j
)
Step
Round 0
1 2
3
4
5
6
7 8
9 10 11 12 13 14 15 116 17 18 19
0
18
0 1
2
3 19
4
5 6
7 16
8
9 10 11 17
12 13 14 15
1
18 36 9121915 25 8161114 1 417
71013 0
2
1812514 719 0 921116 413 61517
8 110 3
3
18
7 2 13
8 19
3 14 9
4 16 15 10
5
0 17
11
6
1 12
4
18 15 9
5
3 19 12
8 6
2 16 13 11
7
1 17
14 10
4
0
Table 4.
Extra Message Words for HAS-V
j
Round 0 Round 1 Round 2 Round 3 Round 4
16 0,1,2,3 3,6,9,12 12,5,14,7 7,2,13,8 15,9,5,3
17 4,5,6,7 15,2,5,8 0,9,2,11 3,14,9,4 12,8,6,2
18 8,9,10,11 11,14,1,4 4,13,7,15 15,10,5,0 13,11,7,1
19 12,13,14,15 7,10,13,0 8,1,10,3 11,6,1,12 14,10,4,0
Table 5.
Amount of Shift for HAS-V Step Function
j
mod 20 0 12 3 45 678 910111213141516171819
s
j
511713156139511 712 81513 815 6 714
State Update Transformation.
The state update transformation updates in-
termediate value
H
i
=
p
0
p
0
in two parallel lines using the same step function
in both lines:
⎨
p
0
p
0
←
H
i
,
p
j
+1
p
j
+1
←
R
j
(
p
j
,w
j
)
R
j
(
p
j
,w
j
)
j
=0
,
1
,...,
99)
,
⎩
H
i
+(
p
100
p
100
)
.
H
i
+1
←
160
32
160
R
j
:
{
0
,
1
}
×{
0
,
1
}
→{
0
,
1
}
is the step function of HAS-V described
below. It is used to update the
p
j
and
p
j
in 5 rounds of 20 steps each using
w
j
and
w
j
computed by the message schedule.
p
j
and
p
j
are swapped after
each round to make the two lines dependent on each other.
For each “
” (left side) and “
” (right side), step function
R
j
(
p
j
,w
j
)iscom-
puted as follows.
⎧
⎨
A
≪
s
j
j
+
f
r
(
B
j
,C
j
,D
j
,E
j
)+
w
j
+
K
r
(for left side “
”)
A
j
+1
←
A
≪
s
j
j
+
f
4
−r
(
B
j
,C
j
,D
j
,E
j
)+
w
j
+
K
r
(for right side “
”)
B
j
+1
←
A
j
,
⎩
B
≫
2
j
C
j
+1
←
D
j
+1
←
C
j
E
j
+1
←
D
j
(3)
where
r
is
j/
20
,
K
r
is a constant defined by the specification, and
s
j
is defined
in Table 5.
Search WWH ::
Custom Search