Protocol for two parties to agree on a shared secret over a public channel. Public: prime p, generator g. Each sends g^a mod p, g^b mod p; shared key is g^(ab) mod p. Security relies on hardness of discrete logarithm.. The key formula is K = g^(ab) mod p. This concept is typically introduced in College. Understanding this concept builds a strong foundation for more advanced mathematics.