• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978)

Cached

  • Download as a PDF
  •  
  • Download as a PS

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]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by R.L. Rivest , A. Shamir , L. Adleman
Venue:Communications of the ACM
Citations:2506 - 27 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

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...

Citations

2292 New Directions in Cryptography - Diffie, Hellman
265 The Art of Computer Programming; vol. 2, Seminumerical Algorithms - Knuth - 1969
256 An improved algorithm for computing logarithms over GF (p) and its cryptographic significance - Pohlig, Hellman - 1978
234 New directions in cryptography - e, Hellman - 1976
181 Riemann’s hypothesis and tests for primality - Miller - 1976
140 An Introduction to the Theory of Numbers - Niven, Zuckerman - 1960
122 A fast Monte-Carlo test for primality - Solovay, Strassen - 1977
117 Secure communications over insecure channels - Merkle - 1982
79 Probabilistic algorithms - Rabin - 1976
55 Exhaustive Cryptanalysis of the NBS Data Encryption Standard - Diffie, Hellman - 1977
5 Some cryptographic applications of permutation polynomials - Levine, Brawley - 1977
3 Theorems on factorization and primality - Pollard - 1974
3 Electronic mail - Potter - 1977
2 A comment on this article may be found in the Technical Correspondence section of this issue - No - 1975
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University