Understanding Diffie-Hellman with Clocks
8 days ago
- #Cryptography
- #Modular Exponentiation
- #Diffie-Hellman
- Modular exponentiation is visualized using a toy Diffie-Hellman exchange.
- A finite field of prime order 13 is used as a toy example (not secure for real-world use).
- Alice and Bob pick secret numbers (a=3, b=5) and compute public values (g^a mod p=8, g^b mod p=6).
- Both compute the shared secret (6^3 mod 13=10, 8^5 mod 13=10), resulting in the same value.
- Real-world Diffie-Hellman uses primes of at least 2048 bits for security.