Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 465

The DOI matches its Crossref record.

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems

Rivest, R. L., Shamir, A., Adleman, L.·1978

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

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.21236/ada606588

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 465

Metadata

Authors
Rivest, R. L., Shamir, A., & Adleman, L.
Published
1978-01-01
OpenAlex
W4248305857
Cited by
465
References
0
Type
report
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. https://app.cochat.ai/papers/10.21236/ada606588
The paper
Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. https://doi.org/10.21236/ada606588

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.