chap13-数字签名.pptVIP

* * Digital Signature Algorithm (DSA) 产生320 bit的签名值 可以提供512-1024 bit 的安全性 比RSA小且快 仅是一个数字签名方案（不能用于加密） 安全性依赖于计算里算对数的困难性 是ElGamal 和Schnorr 方案的变体 * * Digital Signature Algorithm (DSA) * * DSA 密钥的生成 全局公钥 (p, q, g): 选择q, 位长为160 bit 选择一个大的素数 p = 2L 其中 L= 512 to 1024 bits 且L 是64的倍数 q 是 (p-1)的素因子 选择 g = h(p-1)/q mod p 其中 hp-1, h(p-1)/q (mod p) 1 用户选择私钥并计算对应的公钥: 随机选择私钥 0xq 计算公钥 y = gx (mod p) * * DSA 签名的生成 为了对消息M进行签名，发送者: 产生一个随机签名密钥k, kq 注意 k 必须是一个随机数，用后就扔掉，不再使用。 计算签名对: r = ( gk ( mod p ) ) (mod q) s = ( k-1.H( M ) + x.r) (mod q) 和消息M一同发送签名值( r, s ) * * DSA 数字签名的验证 已经收到消息M 和签名值 (r,s) 为了验证签名, 接收者计算: w = s-1(mod q) u1= (H(M).w)(mod q) u2= (r.w)(mod q) v = (gu1.yu2(mod p)) (mod q) 如果 v = r 则签名正确 证明（略） * 西安电子科技大学计算机学院 * * 西安电子科技大学计算机学院 * * * 小 结 数字签名 RSA数字签名 Elgamal数字签名 Schnorr数字签名 DSA及其DSS * * 第13章作业 习题：第13.7 * The most important development from the work on public-key cryptography is the digital signature. Message authentication protects two parties who exchange messages from any third party. However, it does not protect the two parties against each other. A digital signature is analogous to the handwritten signature, and provides a set of security capabilities that would be difficult to implement in any other way. It must have the following properties: ? It must verify the author and the date and time of the signature ? It must to authenticate the contents at the time of the signature ? It must be verifiable by third parties,to resolve disputes Thus, the digital signature function includes the authentication function. Stallings Figure 13.1 is a generic model of the process of making and using digital signatures. Bob can sign a message using a digital signature generation algorithm. The inputs to the algorithm are the message and Bobs private key. Any other user, say Alice, can verify the signature using a verification algorithm, whose inputs are the message, the signature, and Bobs public key. * In simplified terms, the essence of the digital signature me