Cryptography Reference
In-Depth Information
Input:
1. A partially resolved permutation P
1 over Z N
in the form of an array Next.
2. A set of conflict pairs in an array Conflict.
Output: A partially resolved permutation P 2 ≥P 1 in the form of
the array Next.
for u = 1 to NumConflicts do
1
for ρ = 0 to R−2 do
2
for y = 1 to N −2 do
3
if Conflict[u].first = z (ρ+1)N+(y+1) and
4
Conflict[u].second = z ρN+y then
5
Set Next[Conflict[u].value] = Conflict[u].first;
6
Set
7
Next[Next[Conflict[u].value]] = Conflict[u].second;
end
if Conflict[u].second = z (ρ+1)N+(y+1) and
8
Conflict[u].first = z ρN+y then
9
Set Next[Conflict[u].value] = Conflict[u].second;
10
Set
11
Next[Next[Conflict[u].value]] = Conflict[u].first;
end
end
end
end
Algorithm 8.4.3: ResolveConflicts
Search WWH ::




Custom Search