RSA ⇒ PKE

RSA implies PKE.

Statement

Migrated verbatim from rsa-assumption § RSA Assumption:

The RSA assumption states that the RSA function $x\mapsto x^e\mathrm{mod}n$ is hard to invert: given a modulus $n=pq$, a public exponent $e$, and a value $y$, no efficient adversary can find $x$ such that $x^e\equiv y(\mathrm{mod}n)$. It was introduced alongside the RSA cryptosystem — RSA78.

Notes

class: unstated: no citing page says which notion of reduction is meant. Recording a class the wiki does not state would add a claim.

Recorded during migration and not fixed — these are claims about the source text, not changes to it:

• Origin note (“introduced alongside the RSA cryptosystem”) doubling as the RSA ⇒ PKE claim restated at line 46.