Diffie Hellman, Encryption, Symmetric Encryption, Cryptography, Security.
reality, p would be much larger (i.e. hundreds of digits long). In our silly example, where p = 23, there are only 22 possible shared secret values, so it would be easy to brute force the solution. If p is large, it would take forever to randomly guess the shared secret (since there are so many