Cryptography, Cybersecurity.
where the only output value is 1, 3 and 9. For a safe value, we get: Is g=3 safe for p=17? True x g^x g^x (mod p) 0 1 1 1 3 3 2 9 9 3 27 10 4 81 13 5 243 5 6 729 15 7 2187 11 8 6561 16 9 19683 14 So, how does this work in practice? Well, rather than picking the prime number and then finding a g