Diffie-Hellman Beneccyption: Hilter Kilter Encryption Of Information

III. DIFFIE-HELLMAN KEY EXCHANGE ALGORITHM
Hilter kilter Encryption of information requires exchange of cryptographic private key. The most difficult part in this sort of encryption is the exchange of the encryption key from sender to beneficiary without anybody capturing this key in the middle. This exchange or rather era on same cryptographic keys at both sides cryptically was made conceivable by the Diffie-Hellman calculation. The Diffie-Hellman calculation was produced by Whitfield Diffie and Martin Hellman in 1976. This calculation was gadgets not to scramble the information but rather to produce same private cryptographic key at both closures so that there is no compelling reason to exchange this key starting with one correspondence end
That just implies that the whole numbers somewhere around 1 and p−1 are utilized with ordinary increase, exponentiation and division, aside from that after every operation the outcome keeps just the rest of partitioning by p. The two gatherings (Alice and Bob) need to pick two numbers p and g; where p (modulo) is a prime number and the second number g is a primitive foundation of request (p-1) in the gathering called the generator. The two numbers are open and can be sent through the Internet. Figure-2 demonstrates the method of the convention, the strides are as per the
A man in the center may set up two particular Diffie–Hellman key trades, one with Alice and the other with Bob, adequately taking on the appearance of Alice to Bob, and the other way around, permitting the assailant to decode (and read or store) then re-encode the messages went between them. The Diffie-Hellman calculation is vulnerable to two assaults. The Diffie-Hellman algorithm is susceptible to two attacks.
1. The discrete logarithm attack and
2. The man-in-the-middle attack.

1.) Discrete Logarithm attack
An interceptor (Eve) can block u and v. Discover a from (u = ga mod p);Find b from (v = gb mod p); Then she can figure (K = g stomach muscle mod p). The mystery key is not mystery any longer. To make Diffie-Hellman safe from the discrete logarithm assault, the accompanying are prescribed:

The prime number p must be very large (more than 300 digits).
 The generator g must be chosen from the group .
 The numbers a and b must be large random numbers of at least 100 digits long, and used only once (destroyed after being used). Still, no algorithm for the discrete logarithm problem exists with computational complexity O(x r) for any r; all are infeasible.
2.) Man-in-the-middle