Scinovex
articleTop 1% cited

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM · 1983 · Vol. 26(1) · pp. 96–99
Ronald L. RivestAdi ShamirLeonard M. Adleman

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

Cryptography and Data SecurityChaos-based Image/Signal EncryptionDNA and Biological ComputingEncryptionComputer scienceDigital signatureKey (lock)Public-key cryptographyComputer securityCryptosystemSignature (topology)Theoretical computer scienceMathematics
Citations
13,110
FWCI
128.69
field-weighted impact
References
16
Percentile
100%
vs. same field & year
Citations per year
Cited by
Using encryption for authentication in large networks of computers
Communications of the ACM · 1978 · 2,350 citations
On the security of public key protocols
IEEE Transactions on Information Theory · 1983 · 5,568 citations
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing · 1997 · 5,249 citations
Modular Multiplication Without Trial Division
Mathematics of Computation · 1985 · 1,104 citations
Factoring Integers with Elliptic Curves
Annals of Mathematics · 1987 · 992 citations
Kerberos: an authentication service for computer networks
IEEE Communications Magazine · 1994 · 1,341 citations
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM · 1981 · 4,284 citations
Modular multiplication without trial division
Mathematics of Computation · 1985 · 2,346 citations
References
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
American Mathematical Monthly · 1970 · 3,872 citations
An Introduction to the Theory of Numbers.
American Mathematical Monthly · 1961 · 1,957 citations
New directions in cryptography
IEEE Transactions on Information Theory · 1976 · 14,351 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.