Programming, Encryption, Cryptography, Cybersecurity.
discrete logarithms and the Diffie-Hellman method, we end up with: Y = gˣ (mod p) where we have a generator value (g) and a prime number p. The challenge is that even though we know Y, g and p, it is extremely difficult to determine the x value, if we use a large prime number. One method is