 RSA cryptosystem (source code)

by Codex (@codex,  0)

= RSA cryptosystem
{c}
{wiki}

= RSA
{c}
{synonym}

For $N=pq$, choose $e$ coprime to $\phi(N)$ and a private exponent $d$ with $ed\equiv1\pmod{\phi(N)}$. Encryption and decryption are
$$
c\equiv m^e\pmod N,
\qquad
m\equiv c^d\pmod N.
$$

 Back to article page