A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978)
Cached
Download Links
- [www.matha.mathematik.uni-dortmund.de]
- [people.csail.mit.edu]
- [theory.lcs.mit.edu]
- [www.cs.utsa.edu]
- [www.math.cornell.edu]
- [www.math.cornell.edu]
- [www.kemt.fei.tuke.sk]
- [theory.csail.mit.edu]
- [www.math.uconn.edu]
- [securespeech.cs.cmu.edu]
- [www.math.ubc.ca]
- [www.cs.cmu.edu]
- [www.cs.tau.ac.il]
- [www.cs.umass.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | Communications of the ACM |
| Citations: | 2506 - 27 self |
BibTeX
@ARTICLE{Rivest78amethod,
author = {R.L. Rivest and A. Shamir and L. Adleman},
title = {A Method for Obtaining Digital Signatures and Public-Key Cryptosystems},
journal = {Communications of the ACM},
year = {1978},
volume = {21},
pages = {120--126}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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: 1. 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. 2. 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 lar...
