{"id":2316,"date":"2023-05-08T18:57:45","date_gmt":"2023-05-08T18:57:45","guid":{"rendered":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/?post_type=chapter&#038;p=2316"},"modified":"2024-10-18T20:53:31","modified_gmt":"2024-10-18T20:53:31","slug":"cryptography-learn-it-5","status":"web-only","type":"chapter","link":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/chapter\/cryptography-learn-it-5\/","title":{"raw":"Cryptography: Learn It 5","rendered":"Cryptography: Learn It 5"},"content":{"raw":"<h2>Public Key Cryptography<\/h2>\r\nSuppose that you are connecting to your bank\u2019s website. It is possible that someone could intercept any communication between you and your bank, so you\u2019ll want to encrypt the communication. The problem is that all the encryption methods we\u2019ve discussed require that both parties have already agreed on a shared secret encryption key. How can you and your bank agree on a key if you haven\u2019t already?\r\n\r\nThis becomes the goal of <strong>public key cryptography<\/strong> \u2013 to provide a way for two parties to agree on a key without a snooping third party being able to determine the key. The method relies on a one-way function; something that is easy to do one way, but hard to reverse. We will explore the Diffie-Hellman-Merkle key exchange method.\r\n\r\n<section class=\"textbox keyTakeaway\">\r\n<div>\r\n<h3>public key cryptography<\/h3>\r\n<strong>Public key cryptography<\/strong> is a method of securing digital communication by using two mathematically related keys: a public key and a private key. The public key is used for encrypting data, while the private key is used for decrypting it.\r\n\r\n<\/div>\r\n<\/section>Public key cryptography involves the use of <strong>key pairs<\/strong>, which consist of a public key and a private key. The public key is available to everyone and is used to encrypt data, while the private key is kept secret and is used to decrypt the data. The keys are mathematically related, so if one key is used to encrypt data, only the corresponding key can decrypt it. This ensures secure communication between parties.\r\n\r\nThe encryption process in public key cryptography involves using the recipient's public key to encrypt the data, which can then be safely transmitted over a public network. Only the recipient's private key can decrypt the data, ensuring that it remains confidential. Similarly, when the recipient needs to send a message back to the sender, they can use the sender's public key to encrypt the data, which can only be decrypted using the sender's private key.\r\n\r\nPublic key cryptography also allows for the creation of <strong>digital signatures<\/strong>, which provide a way to verify the authenticity of data or messages. A digital signature is created by applying a mathematical algorithm to the data using the sender's private key. The resulting signature can be sent along with the data and can be verified by anyone who has access to the sender's public key. If the data has been tampered with or altered in any way, the digital signature will not match, indicating that the data is not authentic.","rendered":"<h2>Public Key Cryptography<\/h2>\n<p>Suppose that you are connecting to your bank\u2019s website. It is possible that someone could intercept any communication between you and your bank, so you\u2019ll want to encrypt the communication. The problem is that all the encryption methods we\u2019ve discussed require that both parties have already agreed on a shared secret encryption key. How can you and your bank agree on a key if you haven\u2019t already?<\/p>\n<p>This becomes the goal of <strong>public key cryptography<\/strong> \u2013 to provide a way for two parties to agree on a key without a snooping third party being able to determine the key. The method relies on a one-way function; something that is easy to do one way, but hard to reverse. We will explore the Diffie-Hellman-Merkle key exchange method.<\/p>\n<section class=\"textbox keyTakeaway\">\n<div>\n<h3>public key cryptography<\/h3>\n<p><strong>Public key cryptography<\/strong> is a method of securing digital communication by using two mathematically related keys: a public key and a private key. The public key is used for encrypting data, while the private key is used for decrypting it.<\/p>\n<\/div>\n<\/section>\n<p>Public key cryptography involves the use of <strong>key pairs<\/strong>, which consist of a public key and a private key. The public key is available to everyone and is used to encrypt data, while the private key is kept secret and is used to decrypt the data. The keys are mathematically related, so if one key is used to encrypt data, only the corresponding key can decrypt it. This ensures secure communication between parties.<\/p>\n<p>The encryption process in public key cryptography involves using the recipient&#8217;s public key to encrypt the data, which can then be safely transmitted over a public network. Only the recipient&#8217;s private key can decrypt the data, ensuring that it remains confidential. Similarly, when the recipient needs to send a message back to the sender, they can use the sender&#8217;s public key to encrypt the data, which can only be decrypted using the sender&#8217;s private key.<\/p>\n<p>Public key cryptography also allows for the creation of <strong>digital signatures<\/strong>, which provide a way to verify the authenticity of data or messages. A digital signature is created by applying a mathematical algorithm to the data using the sender&#8217;s private key. The resulting signature can be sent along with the data and can be verified by anyone who has access to the sender&#8217;s public key. If the data has been tampered with or altered in any way, the digital signature will not match, indicating that the data is not authentic.<\/p>\n","protected":false},"author":15,"menu_order":8,"template":"","meta":{"_candela_citation":"[]","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"part":2245,"module-header":"learn_it","content_attributions":[],"internal_book_links":[],"video_content":null,"cc_video_embed_content":{"cc_scripts":"","media_targets":[]},"try_it_collection":null,"_links":{"self":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapters\/2316"}],"collection":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/wp\/v2\/users\/15"}],"version-history":[{"count":12,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapters\/2316\/revisions"}],"predecessor-version":[{"id":5160,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapters\/2316\/revisions\/5160"}],"part":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/parts\/2245"}],"metadata":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapters\/2316\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/wp\/v2\/media?parent=2316"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/pressbooks\/v2\/chapter-type?post=2316"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/wp\/v2\/contributor?post=2316"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/content.one.lumenlearning.com\/quantitativereasoning\/wp-json\/wp\/v2\/license?post=2316"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}