信息安全概论课件-lecture041.ppt

  1. 1、本文档共49页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
信息安全概论课件-lecture041.ppt

The Secure Hill Cipher The Scenario The Scenario The Scenario The Scenario The Scenario The Scenario Beforehand… Alice and Bob privately share matrix K, invertible over Zm To encrypt a matrix X over Zm… Compute Y = KX Send Y To decrypt Y… Compute X = K–1Y Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Why the Hill Cipher Isn’t Secure Beforehand… Alice and Bob privately share matrix K, invertible over Zm To encrypt a matrix X over Zm… Compute Y = KX Send Y To decrypt Y… Compute X = K–1Y Permutation Matrices Permutation Matrices Permutation Matrices Permutation Matrices Vector Representation Beforehand… Alice and Bob privately share matrix K, invertible over Zm To encrypt a matrix X over Zm… Compute Y = KX Send Y To decrypt Y… Compute X = K–1Y The Easy Way to Encrypt Require t to be the vector representation of a permutation matrix N.B.: This is for example only—it is not practical “in the field.” An Example An Example An Example An Example An Example An Example An Example The Scenario The Scenario The Scenario The Scenario An Example An Example An Example An Example An Example The Actual Really Secure Hill Cipher Jeff Overbey MA464-01 ? Dr. Jerzy Wojdy?o ? April 29, 2003 The Actual Really Secure Hill Cipher or How to Secure the Secure Hill Cipher Ensuring Security X should have two columns Why? Suppose K is n × n and X is n × s. If s ? n… If 2 s n… If s = 2… Pt should be different for each encryption Theoretically, this can be ensured by choosing a different t for each encryption We did this by requiring t to be a vector representation of a permutation matrix, but this is not the best solution. The ? Function Let ?n denote the set of n × n permutation matrices. ?: Zmn ? ?n The ? Function Let ?n denote the set of n × n permutation matrices. ?: Zmn

文档评论(0)

xinshengwencai + 关注
实名认证
内容提供者

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

版权声明书
用户编号:5311233133000002

1亿VIP精品文档

相关文档