Cryptography Reference
In-Depth Information
Input:
1. Secret key array K[0...N −1].
2. Precomputed random array a[0...N −1].
Output:
1. Scrambled array S[0...N −1].
2. Key-dependent secret variable k.
Initialization:
for i = 0,...,N −1 do
S[i] = a i ;
j = k = 0;
end
Scrambling:
repeat
for i = 0,...,N −1 do
j = (j + S[i] + κ[i mod l]) mod N;
Swap(S[i],S[j]);
S[i] = (S[i] + S[j]) mod M;
k = (k + S[i]) mod M;
end
until r iterations ;
Algorithm 9.2.3: GGHN KSA
Search WWH ::




Custom Search