A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.
Public-Key Cryptography
See also
Cayley-Purser Algorithm, Knapsack Problem, RSA EncryptionExplore with Wolfram|Alpha
References
Diffie, W. and Hellman, M. "New Directions in Cryptography." IEEE Trans. Info. Th. 22, 644-654, 1976.Flannery, S. and Flannery, D. In Code: A Mathematical Journey. Profile Books, 2000.Hellman, M. E. "The Mathematics of Public-Key Cryptography." Sci. Amer. 241, 130-139, Aug. 1979.Rivest, R.; Shamir, A.; and Adleman, L. "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems." MIT Memo MIT/LCS/TM-82, 1977.Rivest, R.; Shamir, A.; and Adleman, L. "A Method for Obtaining Digital Signatures and Public Key Cryptosystems." Comm. ACM 21, 120-126, 1978.Wagon, S. "Public-Key Encryption." §1.2 in Mathematica in Action. New York: W. H. Freeman, pp. 20-22, 1991.Referenced on Wolfram|Alpha
Public-Key CryptographyCite this as:
Weisstein, Eric W. "Public-Key Cryptography." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Public-KeyCryptography.html