|
|
|
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.
See also Knapsack Problem, RSA Encryption
References
Diffie, W. and Hellman, M. ``New Directions in Cryptography.'' IEEE Trans. Info. Th. 22, 644-654, 1976.
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, 1982.
Wagon, S. ``Public-Key Encryption.'' §1.2 in Mathematica in Action. New York: W. H. Freeman, pp. 20-22, 1991.