rsaEncrypt
Encrypt a number. For this to work properly, the modulus has to be bigger than the number. The formula for encryption is c = m^e mod n, where e is the public key exponent and n is the modulus.
Encrypt a number. For this to work properly, the modulus has to be bigger than the number. The formula for encryption is c = m^e mod n, where e is the public key exponent and n is the modulus.