13
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: − + Line 28:
Line 28: − − ==Example== − # − Fred needs to send documents to many people. They dont need to be secure , but its important that they know for certain that the messge actually came from Fred. − * Fred '''encrypts''' the message using his ''private key''. (only fred knows this key) − * Fred sends the message − * George gets the message (so do many other people , its not important) − * George '''decrypts''' the message using Freds ''Public key''. − * Only a message coded with the private key can be decoded wth the public key so George knows it came from Fred. − # − * George drafts a reply and '''encrypts''' it with Freds ''Public key''. − * only Freds ''private key'' can '''decrypt''' the message , so it is secure − * Fred receives the message and decrypts it − * its a valid message but Fred cant know who sent it , anyone with the public key could send to him. − − This form of public key encryption works best with sets of private and public keys. − − − * [http://www.networkworld.com/news/64452_05-17-1999.html | Public key encryption for Dummies] − * http://www2.krellinst.org/UCES/archive/modules/charlie/pke/ −
undo edit by User:Markr. That "example" confuses me
'''Public-key encryption''' is a kind of [[encryption]] in which both the message and the public key are public. There is a private key used known only to the individual. This differs from the traditional (so-called "private-key") encryption, in which the key is kept secret from the intended recipient. Public-key encryption is a form of ''[[symmetry|asymmetric]] encryption'', meaning that it is much easier to encrypt a message than to decrypt it, at least without knowing the encryption key; this is the reason that the key has to be made public.
'''Public-key encryption''' is a kind of [[encryption]] in which both the message and the key are public. This differs from the traditional (so-called "private-key") encryption, in which the key is kept secret from the intended recipient. Public-key encryption is a form of ''[[symmetry|asymmetric]] encryption'', meaning that it is much easier to encrypt a message than to decrypt it, at least without knowing the encryption key; this is the reason that the key has to be made public.
Well-known public-key encryption algorithms include '''Diffie-Hellman''',
Well-known public-key encryption algorithms include '''Diffie-Hellman''',
The RSA algorithm was put to the test in 1991, when RSA Laboratories released the "RSA Factoring Challenge". The challenge consisted of a list of progressively larger numbers, which, when fully decrypted, read "The magic words are [[squeamish ossifrage]]."<ref>[http://citeseer.ist.psu.edu/1393.html "The Magic Words Are Squeamish Ossifrage"], by Atkins, Graff, Lenstra, and Leyl</ref> Although the challenge was withdrawn in 2007, the RSA algorithm is still widely considered acceptable for business purposes.
The RSA algorithm was put to the test in 1991, when RSA Laboratories released the "RSA Factoring Challenge". The challenge consisted of a list of progressively larger numbers, which, when fully decrypted, read "The magic words are [[squeamish ossifrage]]."<ref>[http://citeseer.ist.psu.edu/1393.html "The Magic Words Are Squeamish Ossifrage"], by Atkins, Graff, Lenstra, and Leyl</ref> Although the challenge was withdrawn in 2007, the RSA algorithm is still widely considered acceptable for business purposes.
==References==
==References==
<references/>
<references/>
[[Category:Cryptography]]
[[Category:Cryptography]]