中科新闻网led light:有关网络安全的题目
来源：百度文库 编辑：中科新闻网 时间：2024/04/29 06:38:20
1.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 the plaintext itself.
2.Reverse the order of XOR-ing and encryption in CBC encryption [Kaufman, Fig. 4-5, p.98] , i.e., c1 is computed as E(m1) xor IV. Does this work? Does it matter? Justify your answer using the vulnerabilities and issues identified in the book and in class.
3.In RSA algorithm, what is the probability that something to be encrypted will not be in Z*n?
4.In the description of possible defense against Man-in-the-Middle Attack [Kaufman §6.4.2, 3], it stated that encrypting the Diffie-Hellman value with the other sides’s public key shall prevent the attack. Why is this case assumption that an attacker can encrypt whatever it wants with the other sides’ public key?
2.Reverse the order of XOR-ing and encryption in CBC encryption [Kaufman, Fig. 4-5, p.98] , i.e., c1 is computed as E(m1) xor IV. Does this work? Does it matter? Justify your answer using the vulnerabilities and issues identified in the book and in class.
3.In RSA algorithm, what is the probability that something to be encrypted will not be in Z*n?
4.In the description of possible defense against Man-in-the-Middle Attack [Kaufman §6.4.2, 3], it stated that encrypting the Diffie-Hellman value with the other sides’s public key shall prevent the attack. Why is this case assumption that an attacker can encrypt whatever it wants with the other sides’ public key?
晕哦。发外语怎么让不懂 的回答啊。没事出来现的啊。