- 1、本文档共42页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
网络安全-08:公钥密码学与RSA
* To speed up the operation of the RSA algorithm using the private key, can use the Chinese Remainder Theorem (CRT) to compute mod p q separately, and then combine results to get the desired answer. This is approx 4 times faster than calculating “C^d mod n” directly. Note that only the owner of the private key details (who knows the values of p q) can do this, but of course that’s exactly where help is needed, since if e is small then d will be likely be large! * Before the application of the public-key cryptosystem, each participant must generate a pair of keys, which requires finding primes and computing inverses. Both the prime generation and the derivation of a suitable pair of inverse exponents may involve trying a number of alternatives. Typically make random guesses for a possible p or q, and check using a probabalistic primality test whether the guessed number is indeed prime. If not, try again. Note that the prime number theorem shows that the average number of guesses needed is not too large. Then compute decryption exponent d using Euclid’s Inverse Algorithm, which is quite efficient. * Note some possible possible approaches to attacking the RSA algorithm, as shown. The defense against the brute-force approach is the same for RSA as for other cryptosystems, namely, use a large key space. Thus the larger the number of bits in d, the better. However because the calculations involved both in key generation and in encryption/decryption are complex, the larger the size of the key, the slower the system will run. Will now review the other possible types of attacks. * We can identify three approaches to attacking RSA mathematically, as shown. Mathematicians currently believe all equivalent to factoring. See Stallings Table 9.4 for progress in factoring, where see slow improvements over the years, with the biggest improvements coming from improved algorithms. The best current algorithm is the “Lattice Sieve” (LS), which replaced the “Generalized Number Field S
您可能关注的文档
最近下载
- 岐黄天使中医西学中专项128学时试题答案.doc
- 2024年人工智能(AI)训练师职业技能鉴定考试题库(浓缩500题).docx VIP
- 特应性皮炎治疗药物应用管理专家共识(2024版).pptx
- 《语文课程与教学论》(王文彦)课后答案.docx VIP
- 饲料中钙的测定课件(共52张PPT)《畜禽营养与饲料》.pptx VIP
- 网架结构安全性检测鉴定.pdf
- 部编版小学语文四年级上册第三单元单元整体教学解读教材分析(新版).pptx
- 2024年NX省生态环境监测专业技术人员大比武模拟试卷及答案-3应急监测.pdf
- 天天特卖售后第二天售后场景考试.doc VIP
- 《饲料中磷的测定导学案-畜禽营养与饲料》.docx VIP
文档评论(0)