Abstract
The goal of the Diffie–Hellman key exchange, described in Diffie and Hellman (IEEE Trans Inf Theor 22(6):644–654, 1976, [DH76]), is to create a key for Alice and Bob by sending shared information back and forth a few times. The key is created from several pieces, some of which are public information, and some of which only Alice knows or only Bob knows. The point is that knowing all the public pieces and at least one of the private pieces makes it easy to construct the key, but without knowing any of the private pieces, working out the key is extremely difficult (but possible in some sense). Here is how it works.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Rubinstein-Salzedo, S. (2018). The Diffie–Hellman Key Exchange and the Discrete Logarithm Problem. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-94818-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94817-1
Online ISBN: 978-3-319-94818-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)