Cryptography & Security
Advanced
RSA Decryption
Recovers the message using the private exponent d.
Formula
Variables
mMessage
cCiphertext
dPrivate exponent
nModulus
Example
c=31, d=7, n=33: m = 31^7 mod 33 = 4
Did You Know?
RSA's security rests on the fact that factoring a 2048-bit modulus would take longer than the age of the universe.
Share this formula
More in Cryptography & Security
View allModular Exponentiation
IntermediateCore operation of RSA encryption — raise a message to a power, modulo n.
Euler's Totient
IntermediateCounts integers below n coprime to it, for n = pq — used to make RSA keys.
Shannon Entropy
AdvancedAverage information content — and the theoretical strength of a random source.
Password Entropy
IntermediateBits of security from password length and character-set size.
Key Space Size
IntermediateNumber of possible keys for a b-bit key.
Birthday Bound
AdvancedCollisions become likely after about √ of the hash space.