Diffie Hellman, Encryption, Symmetric Encryption, Cryptography, Security.
must be such a k for each a in the range 1 ≤ a < n (since all those numbers are coprime with n) The modulo operation is distributive This means that ab mod n = [(a mod n)(b mod n)] mod n and (a mod n)ᵇ mod n = [(a mod n)…(a mod n)] mod n = aᵇ mod n Note: here’s a proof. The Real Thing Note: public