# Why Is Diffie-Hellman Referred To As A Key Agreement Protocol Rather Than A Key Exchange Protocol

The Diffie Hellman key exchange was the first public mechanism to solve this problem. The algorithm allows those who have never met before to create a common key safely, even via an uncertain channel that opponents can monitor. The security of the Diffie-Hellman key exchange depends on how it is implemented, as well as the numbers chosen. As we have said above, it has no way of authenticating the other party alone, but in practice other mechanisms are used to ensure that the other party is not an impostor in a context. The Diffie-Hellman key exchange is complex and it can be difficult to get your head around how it works. He uses very large numbers and a lot of mathematics, something that many of us still fear from those long and boring high school classes. Traditionally, secure encrypted communication between two parties required them to first exchange keys with safe physical means. B for example lists of paper keys, which are carried by a trusted delivery driver. The Diffie Hellman key exchange method allows two parties who don`t have prior knowledge to set up a common secret key together via an unsecured channel. This key can then be used to encrypt the next communication with a symmetrical key siffre. The crucial part of the Diffie-Hellman key exchange is that both parties end up having the same result without ever having to send all the common secret through the communication channel. Choosing a common color, their own secret colors, exchanging the mixture, then adding their own color again, gives both parties the opportunity to reach the same common secret, without ever having to send on the whole thing.

The ElGamal algorithm, widely used in PGP, is based on the Diffie-Hellman key exchange, so that every protocol that uses it effectively implements a kind of different hellman. The number field scanning algorithm, which is usually the most effective at solving the discrete logarithmic problem, consists of four computational steps. The first three steps depend only on the order of Group G, not on the number determined by which the final protocol is desired. [12] It turns out that a lot of Internet traffic uses one of a handful of groups that are in the order of 1024 bits or less. [3] By calculating the first three steps of the digital sieve for the most common groups, an attacker only has to perform the last step, which is much less expensive in calculation than the first three steps to obtain a specific logarithm. The Logjam attack took advantage of this vulnerability to compromise a large number of Internet services that allowed the use of groups with a prime order of 512 bits, called the export level. The authors needed several thousand CPU nuclei for a week to pre-calculate the data for a prime number of 512 bits.