Public Key Cryptography

Diffie Hellman Key Exchange

• Diffie-Hellman algorithm is one of the most important algorithms used for establishing a shared secret. At the time of exchanging data over a public network, we can use the shared secret for secret communication. We use an elliptic curve for generating points and getting a secret key using the parameters.
• As the name suggests,
• This algorithm is used to exchange the secret key between the sender and the receiver.
• This algorithm facilitates the exchange of secret key without actually transmitting it.

Diffie Hellman Key Exchange

• Diffie Hellman Key Exchange Algorithm-
•  
• Let-
• Private key of the sender = Xs
• Public key of the sender = Ys
• Private key of the receiver = Xr
• Public key of the receiver = Yr
•  
• Using Diffie Hellman Algorithm, the key is exchanged in the following steps-

Why does DH work?

• Step-01: 
• One of the parties choose two numbers ‘a’ and ‘n’ and exchange with the other party.
• ‘a’ is the primitive root of prime number ‘n’.
• After this exchange, both the parties know the value of ‘a’ and ‘n’.
• tep-02:
•  Both the parties already know their own private key.
• Both the parties calculate the value of their public key and exchange with each other.

Download 0.67 Mb.

Share with your friends: