## Introduction to Diffie Hellman Key Exchange Algorithm

The Diffie Hellman Key Exchange Algorithm is one of the first practical implementations of the public key exchange in the field of cryptography. The Diffie Hellman Key Exchange Algorithm is one of the ways that can generate a shared key and share secrete between two parties in a way that we can be sure that no one will be able to snoop in on the communication. There is one important fact to keep in mind about the Algorithm is that we are not sharing the information in the exchange, instead, we are creating a key that can later be used to exchange information. As this technique allows us to create an encryption key with the other party, we can then start encrypting the ongoing and receiving messages. One established, even if someone records the transmission data, there is no way the data can be decrypted.

### Diffie Hellman Key Exchange Algorithm for Key Generation

The algorithm is based on Elliptic Curve Cryptography which is a method of doing public-key cryptography based on the algebra structure of elliptic curves over finite fields. The DH also uses the trapdoor function just like many other ways to do public-key cryptography. The simple idea of understanding to the DH Algorithm is the following

1. The first party picks two prime numbers g and p and tells them to the second party.

2. The second party then picks a secret number (let’s call it a) and then it computes g^{a }mod p and sends the result back to the first party, let’s call the result A. Keep in mind that the secret number is not sent to anyone, only the result is.

3. Then the first party does the same, it selects a secret number b and calculates the result B similor to the

4. step 2. Then, this result is sent to the second party.

4.6 (3,144 ratings)

View Course

5. The second party takes the received number B and calculates B^{a }mod p

6. The first party takes the received number A and calculates A^{b} mod p

This is where it gets interesting, the answer in step 5 is the same as the answer in step 4. This means both parties will get the same answer no matter the order of exponentiation.

`(g`

^{a} *mod* p)^{b} *mod* p = g^{ab} *mod* p

(g^{b} *mod* p)^{a} *mod* p = g^{ba} *mod* p

The number we came within steps 4 and 5 will be taken as the shared secret key. Now this key can be used to do any encryption of data that will be transmitted such as blowfish, AES, etc.

### Diffie Hellman Algorithm

1. key =(Y_{A})^{XB}mod q -> this is the same as calculated by B

2. Global Public Elements

- q: q is a prime number
- a: a < q and α is the primitive root of q

3. Key generation for user A

- Select a Private key X
_{A}Here, X_{A }<q

Now, Calculation of Public key Y_{A }Y_{A} = a^{XA} mod q

4. Key generation for user B

- Select a Private key X
_{B}Here, X_{B }<q - Now, Calculation of Public key Y
_{B }Y_{B}= a^{Xb}mod q

5. Calculation of Secret Key by A

- key =(Y
_{B})^{XA }mod q

6. Calculation of Secret Key by B

- key =(Y
_{A})^{XB }mod q

** Example**

1. Alice and Bob both use public numbers P = 23, G = 5

2. Alice selected private key a = 4 and Bob selected b = 3 as the private key

3. Both, Alice and bob now calculate the value of x and y as follows:

- Alice: x = (5
^{4}mod 23) = 4 - Bob: y = (5
^{3}mod 23) = 10

4. Now, both Alice and Bob exchange public numbers with each other.

5. Alice and Bob now calculate the symmetric keys

- Alice: k
_{a}= y^{a}mod p = 10^{4}mod 23 = 18 - Bob: k
_{b}= x^{b}mod p = 4^{3}mod 23 = 18

6. 18 is the shared secret key.

### Uses of Diffie Hellman Algorithm

Aside from using the algorithm for generating public keys, there are some other places where DH Algorithm can be used:

**Encryption:**Diffie Hellman key exchange algorithm can be used to do encryption, one of the first schemes to do it was ElGamal encryption. One modern example of it is called Integrated Encryption Scheme which provides security against chosen plain text and chosen clipboard attacks.**Password Authenticated Agreement:**When two parties share a password, a password-authenticated key agreement can be used to prevent the Man in the middle attack. This key Agreement can be in the form of Diffie-Hellman. Secure Remote Password Protocol is a good example that is based on this technique.**Forward Secrecy:**Forward secrecy based protocols can generate new key pairs for each new session, and they can automatically discard them at the end when the session is finished too. In these forward Secrecy protocols, more often than not, the Diffie Hellman key exchange is used.

### Advantages of the Diffie Hellman Algorithm

- The sender and receiver don’t need any prior knowledge of each other.
- Once the keys are exchanged, the communication of data can be done through an insecure channel.
- The sharing of the secret key is safe.

### Disadvantages of the Diffie Hellman Algorithm

- The algorithm can not be sued for any asymmetric key exchange.
- Similarly, it can not be used for signing digital signatures.
- Since it doesn’t authenticate any party in the transmission, the Diffie Hellman key exchange is susceptible to a man-in-the-middle attack.

### Conclusion

Due to its advantages, the Diffie Hellman key Exchange has proved to be a useful key exchange system. While it is really tough for someone snooping the network to decrypt the data and get the keys, it is still possible if the numbers generated are not entirely random. Also, the key exchange system makes it possible to do a man in the middle attack, to avoid it, both parties should be very careful at the beginning of the exchange.

### Recommended Article

This has been a guide to Diffie Hellman Key Exchange Algorithm. Here we discuss the uses, different algorithms, advantages, and disadvantages. You can also go through our other suggested articles to learn more –