Editing Key exchange

{{Short description|Cryptographic method}}
{{For|the film|Key Exchange}}
{{Redirect|Kex|other uses|KEX (disambiguation)|and|KEXS (disambiguation)}}
{{More citations needed|date=November 2014}}

'''Key exchange''' (also '''key establishment''') is a method in [[cryptography]] by which [[cryptographic keys]] are exchanged between two parties, allowing use of a cryptographic [[algorithm]].
[[File:Public key shared secret.svg|thumb|250px|right| In the [[Diffie–Hellman key exchange]] scheme, each party generates a public/private key pair and distributes the public key. After obtaining an authentic copy of each other's public keys, Alice and Bob can compute a shared secret offline. The shared secret can be used, for instance, as the key for a [[Symmetric-key algorithm|symmetric cipher]].]]

If the sender and receiver wish to exchange encrypted messages, each must be equipped to encrypt messages to be sent and decrypt messages received. The nature of the equipping they require depends on the [[encryption]] technique they might use. If they use a [[code (cryptography)|code]], both will require a copy of the same [[codebook]]. If they use a [[cipher]], they will need appropriate keys. If the cipher is a [[symmetric key|symmetric key cipher]], both will need a copy of the same key. If it is an [[public key|asymmetric key cipher]] with the public/private key property, both will need the other's public key.

==Channel of exchange==
Key exchange is done either in-band or out-of-band.<ref>{{cite book |title=CompTIA Security+ Study Guide: Exam SY0-501 |author=Emmett Dulaney, [[Chuck Easttom]] |publisher=John Wiley & Sons |date=October 5, 2017 |isbn=9781119416906 |url=https://books.google.com/books?id=MLg4DwAAQBAJ&q=out-of-band+key+exchange,+in-band+key+exchange&pg=PA242}}</ref>

==The key exchange problem==
The key exchange problem describes ways to exchange whatever keys or other information are needed for establishing a secure communication channel so that no one else can obtain a copy. Historically, before the invention of [[public-key cryptography]] (asymmetrical cryptography), [[Symmetric-key algorithm|symmetric-key cryptography]] utilized a single key to encrypt and decrypt messages. For two parties to communicate confidentially, they must first exchange the secret key so that each party is able to encrypt messages before sending, and decrypt received ones. This process is known as the key exchange.

The overarching problem with symmetrical cryptography, or single-key cryptography, is that it requires a secret key to be communicated through trusted [[courier]]s, [[diplomatic bag]]s, or any other [[secure channel|secure communication channel]]. If two parties cannot establish a secure initial key exchange, they won't be able to communicate securely without the risk of messages being intercepted and decrypted by a third party who acquired the key during the initial key exchange.

Public-key cryptography uses a two-key system, consisting of the public and the private keys, where messages are encrypted with one key and decrypted with another. It depends on the selected cryptographic algorithm which key—public or private—is used for encrypting messages, and which for decrypting. For example, in [[RSA (cryptosystem)|RSA]], the private key is used for decrypting messages, while in the [[Digital Signature Algorithm]] (DSA), the private key is used for authenticating them. The public key can be sent over non-secure channels or shared in public; the private key is only available to its owner.

Known as the Diffie-Hellman key exchange, the encryption key can be openly communicated as it poses no risk to the confidentiality of encrypted messages. One party exchanges the keys to another party where they can then encrypt messages using the key and send back the cipher text. Only the decryption key—in this case, it's the private key—can decrypt that message. At no time during the Diffie-Hellman key exchange is any sensitive information at risk of compromise, as opposed to symmetrical key exchange.

===Identification===
In principle, the only remaining problem was to be sure (or at least confident) that a public key actually belonged to its supposed owner. Because it is possible to '[[Spoofing attack|spoof]]' another's identity in any of several ways, this is not a trivial or easily solved problem, particularly when the two users involved have never met and know nothing about each other.

===Diffie–Hellman key exchange ===
In 1976, Whitfield Diffie and Martin Hellman published a [[cryptographic protocol]] called the [[Diffie–Hellman key exchange]] (D–H) based on concepts developed by Hellman's PhD student [[Ralph Merkle]]. The protocol enables users to securely exchange secret keys even if an opponent is monitoring that communication channel. The D–H key exchange protocol, however, does not by itself address authentication (i.e. the problem of being sure of the actual identity of the person or 'entity' at the other end of the communication channel).  Authentication is crucial when an opponent can both monitor ''and alter'' messages within the communication channel (AKA [[Man-in-the-middle attack|man-in-the-middle]] or MITM attacks) and was addressed in the fourth section of the paper.<ref>{{cite journal|author1=Diffie, Whitfield|author2=Hellman, Martin E.|title=New Directions in Cryptography|journal=IEEE Transactions on Information Theory|date=November 1976|volume=IT-22|issue=6|pages=644–654|doi=10.1109/TIT.1976.1055638|url=https://ee.stanford.edu/%7Ehellman/publications/24.pdf}}</ref>

===Public key infrastructure===
[[Public key infrastructure]]s (PKIs) have been proposed as a workaround for the problem of identity authentication. In their most usual implementation, each user applies to a “[[certificate authority]]” (CA), trusted by all parties, for a [[digital certificate]] which serves for other users as a non-tamperable authentication of identity. The infrastructure is safe, unless the CA itself is compromised. In case it is, though, many PKIs provide a way to revoke certificates so other users will not trust them. Revoked certificates are usually put in [[certificate revocation list]]s which any certificate can be matched against.

Several countries and other jurisdictions have passed [[legislation]] or issued regulations encouraging PKIs by giving (more or less) legal effect to these digital certificates (see [[digital signature]]). Many commercial firms, as well as a few government departments, have established such certificate authorities.

This does nothing to solve the problem though, as the trustworthiness of the CA itself is still not guaranteed for any particular individual. It is a form of [[argument from authority]] fallacy. For actual trustworthiness, personal verification that the certificate belongs to the CA and establishment of trust in the CA are required. This is usually not possible.

There are known cases where [[Authoritarianism|authoritarian]] governments proposed establishing so-called “national CAs” whose certificates would be mandatory to install on citizens’ devices and, once installed and trusted, could be used for monitoring, intercepting, modifying, or blocking the encrypted internet traffic.<ref>{{Cite news|url=https://slate.com/technology/2015/12/kazakhstan-wants-citizens-to-download-a-mandatory-national-security-certificate.html|title=Kazakhstan's Unsettling New Cybersecurity Plan|last=Wolff|first=Josephine|date=2015-12-14|work=Slate|access-date=2019-01-09}}</ref><ref>{{Cite news|url=http://www.mondaq.com/x/455980/IT+internet/Security+Certificate+Of+The+Republic+Of+Kazakhstan+The+State+Will+Be+Able+To+Control+The+Encrypted+Internet+Traffic+Of+Users|title=Security Certificate Of The Republic Of Kazakhstan: The State Will Be Able To Control The Encrypted Internet Traffic Of Users|last=Shapovalova|first=Natalia|date=2016-01-05|work=Mondaq|access-date=2019-01-09}}</ref><ref>{{Cite news|url=https://meduza.io/en/news/2016/02/15/the-kremlin-reportedly-wants-to-create-a-state-operated-center-for-issuing-ssl-certificates|title=The Kremlin reportedly wants to create a state-operated center for issuing SSL certificates|date=2016-02-15|work=Meduza|access-date=2019-01-09}}</ref>

For those new to such things, these arrangements are best thought of as electronic [[Notary public|notary]] endorsements that “this public key belongs to this user”. As with notary endorsements, there can be mistakes or misunderstandings in such vouchings. Additionally, the notary itself can be untrusted. There have been several high-profile public failures by assorted certificate authorities. <ref>{{Citation|title=CA/Symantec Issues|url=https://wiki.mozilla.org/CA/Symantec_Issues}}</ref><ref>{{Citation|title=Symantec caught once again improperly issuing illegitimate HTTPS certificates|date=23 January 2017 |url=https://www.extremetech.com/internet/243202-symantec-caught-improperly-issuing-illegitimate-https-certificates}}</ref>

===Web of trust===
At the other end of the conceptual range is the [[web of trust]] system, which avoids central Certificate Authorities entirely. Each user is responsible for getting a certificate from another user before using that certificate to communicate with the user. [[Pretty Good Privacy|PGP]] and [[GNU Privacy Guard|GPG]] (an implementation of the [[OpenPGP]] Internet Standard) employ just such a web of trust mechanism.

===Password-authenticated key agreement===
[[Password-authenticated key agreement]] algorithms can perform a cryptographic key exchange utilizing knowledge of a user's [[password]].

=== Quantum key exchange ===
{{main | quantum key distribution }}

[[Quantum key distribution]] exploits certain properties of quantum physics to ensure its security. It relies on the fact that observations (or [[Measurement in quantum mechanics|measurements]]) of a quantum state introduces perturbations in that state. Over many systems, these perturbations are detectable as noise by the receiver, making it possible to detect [[Man-in-the-middle attack|man-in-the-middle attacks]]. Beside the [[Correctness (computer science)|correctness]] and [[Completeness (logic)|completeness]] of quantum mechanics, the protocol assumes the availability of an [[Message authentication|authenticated channel]] between Alice and Bob.

==See also==
* [[Key (cryptography)]]
* [[Key management]]
* [[Diffie–Hellman key exchange]]
* [[Elliptic-curve Diffie–Hellman]]
* [[Forward secrecy]]

==References==
{{Reflist}}
* [https://web.archive.org/web/20141030210530/https://cryptocellar.web.cern.ch/cryptocellar/cesg/possnse.pdf The possibility of Non-Secret digital encryption] J. H. Ellis, January 1970.
* [https://web.archive.org/web/20101116234929/http://www.cesg.gov.uk/publications/media/secenc.pdf Non-Secret Encryption Using a Finite Field] MJ Williamson, January 21, 1974.
* [http://www.fi.muni.cz/usr/matyas/lecture/paper3.pdf Thoughts on Cheaper Non-Secret Encryption] MJ Williamson, August 10, 1976.
* [http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.9720 New Directions in Cryptography] W. Diffie and M. E. Hellman, IEEE Transactions on Information Theory, vol. IT-22, Nov. 1976, pp: 644&ndash;654.
* {{US patent|4200770|Cryptographic apparatus and method}} Martin E. Hellman, Bailey W. Diffie, and Ralph C. Merkle, U.S. Patent #4,200,770, 29 April 1980
* [http://cr.yp.to/bib/1988/diffie.pdf The First Ten Years of Public-Key Cryptography] Whitfield Diffie, Proceedings of the IEEE, vol. 76, no. 5, May 1988, pp: 560&ndash;577 (1.9MB PDF file)
* [[Alfred Menezes|Menezes, Alfred]]; [[Paul van Oorschot|van Oorschot, Paul]]; [[Scott Vanstone|Vanstone, Scott]] (1997).  ''[[Handbook of Applied Cryptography]]'' Boca Raton, Florida: CRC Press. {{ISBN|0-8493-8523-7}}. ([http://www.cacr.math.uwaterloo.ca/hac/ Available online])
* [[Simon Singh|Singh, Simon]] (1999) ''[[The Code Book: the evolution of secrecy from Mary Queen of Scots to quantum cryptography]]'' New York: Doubleday {{ISBN|0-385-49531-5}}[[Cambodia]]

{{DEFAULTSORT:Key Exchange}}
[[Category:Cryptographic primitives]]
[[Category:Cryptographic protocols]]
[[Category:Public-key cryptography]]