RSA arithmetic
Factoring, modular inverse, exponentiation, integer root and text ↔ integer conversion.
RSA step by step
Runs locally- 1. Factor n
n = p × q - 2. Euler's totient
φ(n) = (p − 1)(q − 1) - 3. Private exponent
d = e⁻¹ mod φ(n) - 4. Decrypt
m = c^d mod n - 5. Integer → text
m → hex → UTF-8
Integer e-th root
m = ⌊c^(1/e)⌋Useful when e is small and the message short: if m^e < n, the modulo does nothing.