Define discrete logarithm. Explain the procedure of sharing the secret key in Diffie Hellman.

Question

Suresh Chand · Accepted Answer

If a is an arbitrary integer relatively prime to a and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., Φ(n) - 1 where Φ(n) is the totient function, exactly one number µ such that a = gµ (mode n) The number µ is then called the discrete logarithm of a with respect to the base g modulo n and is denoted µ = indga (mod n) Figure below shows the procedure of sharing the secret key in Diffie Hellman The steps are as follows: Alice chooses a large random number x such that 0 ≤ x ≤ p - 1 and calculatesR1 = gx mode p Bob chooses a large random number y such that 0 ≤ y ≤ p - 1 and calculatesR2 = gy mode p Alice sends R1 to Bob. Note that Alice doesn't send the value of x; she send only R1 Bob sends R2 to Alice. Again, note that Bob does not send the value of y, he sends only R2 Alice calculate K = (R2 )x mod p Bob calculate K = (R1 )y mod p K is a symmetric key for the session.

Define discrete logarithm. Explain the procedure of sharing the secret key in Diffie Hellman.

Leave your Answer:

Hits Counter

Question

Define discrete logarithm. Explain the procedure of sharing the secret key in Diffie Hellman.

Leave your Answer: