杭州交通信息网在gif图片上添加文字:有关网络安全的题目
来源：百度文库 编辑：杭州交通信息网 时间：2024/04/28 04:55:34
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?
计算64位编成密码操作的数量进行为一份n 位纯文本使用CBC, k 位OFB 和k 位CFP 。 计数所有编成密码操作, 不仅操作执行了在纯文本。
2.扭转XOR-ing 和编成密码次序在CBC 编成密码[ 考夫曼, 无花果。 4-5, p.98 ], i.e., c1 被计算作为E(m1) xor IV 。 这工作吗? 它事关吗? 辩解您的答复使用弱点和问题被辨认在书和在类。
3.在RSA 算法, 什么是某事被编成密码不会是在Z*n 的可能性?
4.在可能的防御的描述反对人在这中间攻击[ 考夫曼.2i6.4.2, 3], 它声明那编成密码Diffie-Hellman 价值以另一sides..s 公开密钥将防止攻击。 为什么这个案件假定是, 攻击者可能编成密码什么它想要以另一sides.. 公开密钥?