# YAK … Authenticated Key Exchange

If you’re into Cybersecurity, you should hopefully all know about the magic of the **Diffie-Hellman (DH) method**. Basically, Bob and Alice agree on a generator (g) and a large prime number (p), and then Bob creates a secret (b), and Alice creates her secret (a). Bob then calculates B= g^b (mod p), and Alice calculates A=g^a (mod p). They pass their values, and Bob computes A^b (mod p) and Alice computes B^a (mod p) and they should end…