Cryptography, Python, Math, Mathematics, Diffie Hellman.
(ℤ/pℤ)* is the smallest positive y such that g^y = 1 (mod p). :  involves the following six steps: Together, PersonA and PersonB choose a very large pseudoprime p with (p-1)/2 also being pseudoprime. Since the prime factorization of (p-1) is 2((p-1)/2), then any generator of (ℤ/pℤ)* will have the