Encryption, Cybersecurity.
methods is the Discrete Logarithm Problem, and where we have: Y= g^x (mod p) and where it is difficult to determine x, even if we have Y, g and p (as long as p is a large enough prime number). And so it is used in the Diffie-Hellman method for key exchange. We also use it to sign a message, and