Abstract
One of the principal motivations for the flurry of work that has been done on factorization and primality testing over the past decade has been the invention by Rivest, Shamir, and Adleman in 1977 of a “public key cryptosystem” based on the fact that multiplication of two large primes is much easier then factoring the resulting product.
“Three may keep a secret, if two of them are dead.”
- Benjamin Franklin
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Inform. Theory, IT-22(1976), 644–654.
P. J. Hoogendoorn, “On a Secure Public-key Cryptosystem,” in Computational Methods in Number Theory, edited by H. W. Lenstra, Jr. and R. Tijdeman, Mathematisch Centrum, Amsterdam, 1982.
R. C. Merkle, “Secure Communications over Insecure Channels,” Comm. ACM, 21(1978), 294–299.
R. L. Rivest, A. Shamir, & L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, 21(1978), 120–126.
G. J. Simmons, “Cryptology: The Mathematics of Secure Communication,” The Mathematical Intelligencer, 1(1979), 233–246.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Bressoud, D.M. (1989). The RSA Public Key Crypto-System. In: Factorization and Primality Testing. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4544-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4544-5_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8871-8
Online ISBN: 978-1-4612-4544-5
eBook Packages: Springer Book Archive