网络信s息安全第二次作业.docxVIP

Internet Security, Principles and Practices Homework Assignment #2 03-31-2012 1 John K. Zao 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. 由于DES文本块有64位，但是DES密钥仅仅有56位，平均来讲每个文本块只占一小部分, 大约是256分之一，注意：部分密钥被当做是DES的算法弱点。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. 如果DES的混乱功能仅仅产生0那么每一轮的DES将被简化至仅仅交换大写和小写的32位碎片。随着16轮初始到最终的交换，修改后的DES是等价于一个恒等功能，相当于和输入一致。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.) 有一种说法是最初和最后的所有64位的排列并没有增加加密算法的强度，你能简单说明下为什么？请不要使用复杂的数学理论。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. 这最初的排列是一个一对一的满映射将文本块进行转换，它的作用只是文本的简单替换，这样的操作并不能增加算法的安全性。 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 jus