{"doi":"10.1145/359340.359342","title":"A method for obtaining digital signatures and public-key cryptosystems","abstract":"<jats:p>\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: (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 intented 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            <jats:italic>n</jats:italic>\n            , of two large secret primer 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            <jats:italic>n</jats:italic>\n            .\n          </jats:p>","journal":"Communications of the ACM","year":1978,"id":4147,"datarank":53.35152928997506,"base_score":9.472858470764415,"endowment":9.472858470764415,"self_citation_contribution":1.4209287706146625,"citation_network_contribution":51.9306005193604,"self_endowment_contribution":1.4209287706146625,"citer_contribution":51.9306005193604,"corpus_percentile":100.0,"corpus_rank":606,"citation_count":13001,"citer_count":195,"citers_with_citation_signal":195,"citers_with_endowment":195,"datacite_reuse_total":0,"is_dataset":false,"is_oa":true,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"1978-02-01","authors":[{"id":41805,"name":"L. Adleman","orcid":null,"position":2,"is_corresponding":false},{"id":41806,"name":"Ronald L. Rivest","orcid":null,"position":3,"is_corresponding":false},{"id":41807,"name":"Adi Shamir","orcid":"0000-0002-5422-905X","position":4,"is_corresponding":false},{"id":41808,"name":"Leonard M. Adleman","orcid":null,"position":5,"is_corresponding":false},{"id":41803,"name":"R. L. Rivest","orcid":null,"position":0,"is_corresponding":true}],"reference_count":14,"raw_metadata":{"citation_network_status":"fetched"},"created_at":"2026-03-01T18:20:47.508186Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}