Cryptography & Security
Intermediate
Modular Exponentiation
Core operation of RSA encryption — raise a message to a power, modulo n.
Formula
Variables
cCiphertext
mMessage
ePublic exponent
nModulus
Example
m=4, e=3, n=33: c = 64 mod 33 = 31
Did You Know?
Fast exponentiation lets computers raise huge numbers to huge powers in milliseconds — the engine of public-key crypto.
Share this formula
More in Cryptography & Security
View allRSA Decryption
AdvancedRecovers the message using the private exponent d.
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.