12.11 Consider the following key wrapping algorithm: 1. Initialize variables. A = A6A6A6A6A6A6A6A6 for i = 1 to n R(i) = Pi 2. Calculate intermediate values. for j = 0 to 5 for i = 1 to n B = E(K, [A || R(i)]) t = (n × j)+i A = t + MSB64(B) R(i) = LSB64(B) 3. Output results. C0 = A for i = 1 to n Ci = R(i) a. Compare this algorithm, functionally, with the algorithm specified in SP 800-38F and described in Section 12.8. b. Write the corresponding unwrap algorithm. | |
| View Solution | |
| << Back | |