《lecture3》-公开·课件设计.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
2011-09-07 Lecture 3 Remarks Public key systems are slow Use public key system to encrypt symmetric key Use symmetric key to encrypt the data Send encrypted data and encrypted key to receiver * * * * * * * * * * * * * Perhaps the most widely used public-key algorithms are RSA and Diffie-Hellman. One of the first public-key schemes was developed in 1977 by Ron Rivest, Adi Shamir, and Len Adleman at MIT and first published in 1978. The RSA scheme has since that time reigned supreme as the most widely accepted and implemented approach to public-key encryption. RSA is a block cipher in which the plaintext and ciphertext are integers between 0 and n – 1 for some n. Encryption and decryption are of the following form, for some plaintext block M and ciphertext block C: C = Me mod n M = Cd mod n = (Me)d mod n = Med mod n Both sender and receiver must know the values of n and e, and only the receiver knows the value of d. This is a public-key encryption algorithm with a public key of PU = {e, n} and a private key of PR = {d, n}. See text for details of how these values are derived, and their requirements. * An example is shown in Figure 20.6. For this example, the keys were generated as: 1. Select two prime numbers, p = 17 and q = 11. 2. Calculate n = pq = 17 ? 11 = 187. 3. Calculate ?(n) = (p – 1)(q – 1) = 16 ? 10 = 160. 4. Select e s.t. e is relatively prime to ?(n) = 160 and less than ?(n); we choose e = 7. 5. Determine d such that de mod 160 = 1 and d 160. The correct value is d = 23, because 23 ? 7 = 161 = (1 ? 160) + 1. The resulting keys are public key PU = {7, 187} and private key PR = {23, 187}. The example shows the use of these keys for a plaintext input of M = 88. For encryption, we need to calculate C = 887 mod 187 = 11, which can be done efficiently by exploiting the properties of modular arithmetic, as shown in the text. For decryption, we calculate M = 1123 mod 187 = 88. * Lecture 3 Computer Security Lecture 3 security Cryptography in Java Public Key

文档评论(0)

花好月圆 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档