Multivariate Digital Signature Schemes.ppt

  1. 1、本文档共38页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Multivariate Digital Signature Schemes Jiun-Ming Chen .tw/~jmchen Outline Elements of Cryptography Applications of Public-Key Cryptography Multivariate Digital Signatures Tame Transformation Signature Performance and Cryptanalysis Basics A cryptosystem consists of an algorithm, all possible keys, plaintexts, and ciphertexts. Its security is based on the privacy of its keys, not the privacy of its algorithm. In math language: the type of the function is known, but its parameters are secret. Two Types of Cryptosystems Symmetric Key Cryptosystems (Secret Key) Public Key Cryptosystems (Asymmetric Key) Symmetric Key Cryptosystems Encrypt 加密 ↗ ▲ ↘ Plaintext 明文 Symmetric key Ciphertext 密文 ↖ ▼ ↙ Decrypt 解密 DES (Data Encryption Standard) AES (Advanced Encryption Standard) — bytes are treated as elements of GF (28) Public Key Cryptosystems Public key ▼ Plaintext 明文 → Encrypt 加密 ↖ ↘ Decrypt 解密 ← Ciphertext 密文 ▲ Private key The most famous and important PKC: RSA (Ron Rivest – Adi Shamir – Len Adleman, 1977) In Math Language … Find a function f such that f ?1 exists but hard to find (computationally infeasible). Given x , easy to compute y = f ( x ) with public f . Given y , hard to find x = f ?1 ( y ) , unless some secret information about f ?1 is known. Such f is called a trapdoor one-way function. Digital Signatures 數位簽章 Private key 私鑰 ▼ Message → Sign 簽章 ↖ ↘ Verify 驗章 ← Signature ▲ Public key 公鑰 Public Key Infrastructure CA (Certificate Authority) – 憑證管理中心 RA (Registration Authority) – 憑證註冊中心 ? Confidentiality (秘密

文档评论(0)

叮当文档 + 关注
实名认证
内容提供者

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

1亿VIP精品文档

相关文档