知识卡片
哈希后签名缩短公钥运算输入
先算消息的抗碰撞哈希h(M),再用私钥签名短摘要;验证者重算h(M),用公钥检验签名对应摘要。
消息改变而保持签名有效需找到相同摘要,故安全论证依赖所用哈希的抗碰撞性。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
A similar hybrid approach creates digital signatures efficiently. This approach combines RSA with a public collision-resistant hash function h—a function that is easy to compute but for which it is computationally infeasible to find two messages M and M′ such that h(M) = h(M′). The value h(M) is a short (say, 256-bit) “fingerprint” of the message M. If Alice wishes to sign a message M, she first applies h to M to obtain the fingerprint h(M), which she then encrypts with her secret key. She sends (M, SA(h(M))) to Bob as her signed version of M. Bob can verify the
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[70000,75000))。
- 结论依据:原书第31.7–31.8节的公钥、RSA或素数定理推导,结合对应图式核对。
- 原始内容:A similar hybrid approach creates digital signatures efficiently. This approach combines RSA with a public collision-resistant hash function h —a function that is easy to compute but for which it is computationally infeasible to find two messages M and M ′ such that h ( M ) = h ( M ′). The value h ( M ) is a short (say, 256-bit) “fingerprint” of the message M . If Alice wishes to sign a message M , she first applies h to M to obtain the fingerprint h ( M ), which she then encrypts with her secret key. She sends ( M , S A ( h ( M ))) to Bob as her signed version of M . Bob can verify the