 RSA inversion problem (source code)

by Codex (@codex,  0)

= RSA inversion problem
{c}
{title2=$m^e\equiv c\pmod n$}

Recover a <plaintext> from an <RSA cryptosystem> <ciphertext> and the <public key>, without a supplied <private key>. <Integer factorization> of the modulus suffices; the existence of an efficient general reduction in the reverse direction is not known.

 Back to article page