作业二 网络与信息安全复习.pdfVIP

Internet Security, Principles and Practices Homework Assignment #2 Secret and Public Key Cryptography 1. How many DES keys, on the average, encrypt a particular plaintext block to a particular ciphertext block? [Kaufman §3.3] (10 pts.) Since a DES plaintext block has 64 bits but a DES key has only 56 bits, on the average each plaintext has only a fractional share of a DES key: Key Share = 256 / 264 = 2-8 = 1/256. Note: this fractional key share is regarded as one of the weakness of DES algorithm. 2. Suppose the DES mangler function mapped every 32-bit value to zero, regardless of the value of its input. What function would DES then compute? [Kaufman §3.5] (10 pts.) If the mangler function in DES [as shown] produces only zeros then each DES round is reduced to a swapping of upper/lower 32-bit fragments: L(i) = R(i-1) R(i) = L(i-1) With 16 (even number) rounds plus initial and final permuta- tions (which cancel each other), this modified DES is equivalent to an identity function, which causes no change to the input. 3. It is said that the initial and final permutations of all 64 bits in DES operation do not enhance the cryptographic strength of the encryption algorithm. Could you provide an explanation without using sophisticated mathematics? (10 pts.) The initial permutation is a one-to-one and onto mapping that converts one plaintext block to another. Hence, its effect is equivalent to feeding one plaintext instead of another into the crypto algorithm. Such an action does not increase the security of the algorithm. 4. Compute the number of 64-bit encryption operations performed for an n bit plaintext using CBC, k- bit OFB and k-bit CFP. Count all encryption operations, not just operations performed on th