Cryptography, Cybersecurity, Number Theory, Information Security, Rsa.
numbers large prime p and integer g. Let a be a private key, with corresponding public key A = g^a (mod p). Let k be a random ephemeral key to be private and meant to be used only once. Let m be the message to encrypt, encoded as a number. Note m must be less than p . Encryption involves computing