METHOD FOR OBTAINING DIGITAL SIGNATURES AND PUBLIC-KEY CRYPTOSYSTEMS
METHOD FOR OBTAINING DIGITAL SIGNATURES AND PUBLIC-KEY CRYPTOSYSTEMS
复制标题
DOI：
10.1145/357980.358017
复制
发表时间：
1978-01-01
影响因子：
22.7
通讯作者：
ADLEMAN, L
中科院分区：
文献类型：
--
作者：
RIVEST, RL;SHAMIR, A;ADLEMAN, L
提出了一种加密方法，其具有公开地揭示加密密钥并不由此揭示对应的解密密钥的新颖性质。这有两个重要的后果：不需要信使或其他安全手段来传输密钥，因为可以使用预期接收者公开透露的加密密钥来加密消息。只有他才能破译信息，因为只有他知道相应的解密密钥。任何人都可以使用相应的公开披露的加密密钥验证此签名。签名是不能伪造的，签名人以后也不能否认其签名的有效性。这在“电子邮件”和“电子资金转帐”系统中有明显的应用。一个消息通过将其表示为一个数字M，将M提升到一个公开指定的幂e，然后当结果除以两个大的秘密素数p和q的公开指定的乘积n时取余数来加密。解密是类似的;仅使用不同的秘密幂d，其中e * d = 1（mod（p - 1）*（q - 1））。该系统的安全性部分取决于分解公布的除数n的难度。
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences:Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key.A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product,n, of two large secret prime numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d = 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor,n.