Cryptography Reference
In-Depth Information
Input: The RN many keystream output bytes from the first
R(≥ 2) runs of StuckPRGA.
Output:
1. A partially resolved permutation in the form of an array Next.
2. A set of conflict pairs in an array Conflict.
for u = 0 to N −1 do
1
Set Next[u] = −1;
2
end
NumConflicts = 0;
3
for ρ = 0 to R−2 do
4
for y = 1 to N −2 do
5
if z
ρN+y
= z
(ρ+1)N+(y+1)
then
6
Set S
0
[N −ρ + y] = z
ρN+y
;
7
end
else
8
if Next[z
(ρ+1)N+(y+1)
] = −1 then
9
Set Next[z
(ρ+1)N+(y+1)
] = z
ρN+y
;
10
end
else if Next[z
(ρ+1)N+(y+1)
] = z
ρN+y
then
11
Set NumConflicts = NumConflicts + 1;
12
Set Conflict[NumConflicts].value = z
(ρ+1)N+(y+1)
;
13
Set Conflict[NumConflicts].first =
14
Next[z
(ρ+1)N+(y+1)
];
Set Conflict[NumConflicts].second = z
ρN+y
;
15
end
end
end
end
Algorithm 8.4.2: PartResolvePerm
