Cryptography, Cybersecurity, Rsa, Encryption.
mathematical ciphering operation of: C=M^e (mod N) and where M is an integer value of the message, e is the exponent, and N is the modulus. This modulus is created by multiplying two random prime numbers (p and q). Our modulus will thus limit the size of M that we can have, as we cannot have a