Diffie-Hellman Key - PDF 3
Diffie-Hellman Key - PDF 3
1 2 3 4 5
Each party selects a Compute public values: Exchange public values
Agree on public values Compute the shared key
private key (a for Alice 1 Alice A = g^a mod p (A and B)
P and g -Alice K = B^a mod p
, b for Bob) 2 Bob B = g^b mod p -Bob K = A^b mod p
2
Practical example
Alice and Bob agree on p= 23 and g= 5
• Alice’s private key: a=6
Alice computes: A=5^6 mod 23=8
• Bob’s private key: B=15 shred key public value private value Party
4
Cryptool application
Importance of CrypTool:
CrypTool simplifies understanding by simulating the Diffie-Hellman key exchange, making
the process easier to grasp.
5
Cryptool application
We will enter the values p, g, a, b and the result K will
appear the same for both sides
6
Real World applications
7
Why is diffie-hellman secure
security principle
The security of Diffie-Hellman relies on the difficulty of
solving the discrete logarithm problem.
Key advantag
Without the private keys, the public data alone
cannot be used to compute the shared key.
Mathematical complexity
This ensures that it is infeasible for external
parties to decrypt the communication.
8
Conclusion
9
Thank you!
10