Programming, Encryption, Cryptography, Cybersecurity.
In discrete logarithms — as used in the Diffie-Hellman and ElGamal methods — we use the form: Y = gˣ (mod p) and where p is a prime number. The values of h will range from 0 to p-1. This is defined as a finite field (ℤp). If we use a prime number of 13, we will get values of 0, 1 … 12. But how can