0

604views

Explain Deffie-Hellman Algorithm.

written 5.0 years ago by | • modified 5.0 years ago |

**Subject**: Mobile Computing

**Difficulty**: Medium

**Marks**: 4 Marks

ADD COMMENT
EDIT

**1 Answer**

0

604views

Explain Deffie-Hellman Algorithm.

written 5.0 years ago by | • modified 5.0 years ago |

**Subject**: Mobile Computing

**Difficulty**: Medium

**Marks**: 4 Marks

ADD COMMENT
EDIT

0

3views

written 5.0 years ago by | • modified 5.0 years ago |

**Deffie Hellman Algorithm:**

Consider Alice and Bob want to exchange the key

- Firstly, Alice and Bob agree on two large prime numbers, n and g. These two integers need not be kept secret. Alice and Bob can use an insecure channel to agree to them
- Alice chooses another large random number x, and calculates A such that : A =$g^{x}$ mod n
- Alice sends the number A to Bob.
- Bob independently chooses another large random integer y and calculates B such that: B =$g^{y}$ mod n
- Bob sends the number B to Alice.
- A now computers the secret key K1 as follows: K1= $B^{x}$ mod n
- B now computers the secret key K2 as follows: K2= $A^{y}$ mod n

ADD COMMENT
EDIT

Please log in to add an answer.