A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
Ronald L. Rivest, Adi Shamir, Leonard Adleman
Abstract
This landmark paper introduces the RSA (Rivest-Shamir-Adleman) cryptosystem, the cornerstone of public-key cryptography. The authors demonstrate that by relying on the difficulty of factoring large composite numbers, two parties can securely exchange information without a pre-shared secret. This work provided the essential framework for digital signatures and secure communication that enables modern internet security, and by extension, secure asset ownership in blockchain networks. The ability to generate public/private key pairs is fundamental to the concept of a crypto-wallet, where the private key serves as the unique authorization factor for moving funds or interacting with smart contracts. The mathematical rigor of RSA remains a model for how cryptographic research transitions into practical applications. In the blockchain context, the RSA cryptosystem (and its successors) provides the identity layer that defines who owns what in an immutable, trustless database.
Key Findings
- 1Describes the first practical public-key encryption and signature algorithm (RSA).
- 2Establishes the mathematical foundation for secure digital authentication.
- 3Enables trustless communication between anonymous parties.
- 4Introduces the concept of asymmetric keys as a mechanism for asset ownership.
Topics
Citation
BibTeX
@misc{amethod1978,
title = {A Method for Obtaining Digital Signatures and Public-Key Cryptosystems},
author = {Ronald L. Rivest and Adi Shamir and Leonard Adleman},
year = {1978},
howpublished = {\url{https://dl.acm.org/doi/10.1145/359340.359342}},
}Knowledge Explorer
Explore Related Concepts
See how A Method for Obtaining Digital Signatures and Public-Key Cryptosystems connects to glossary terms, books, and other research in the Knowledge Graph.