# Can someone explain how this unpadded RSA formula works?

$\mathcal{E}(x_1) \cdot \mathcal{E}(x_2) = x_1^e x_2^e$
$\bmod\; m = (x_1x_2)^e \;$
$\bmod\; m = \mathcal{E}(x_1 \cdot x_2)$

What is the superscript $^e$ representing in the first expression, and how do we get from the second line, to the third?

-

## 1 Answer

• $\mathcal{E}$ represents encryption, superscript $e$ represents exponentiation. Textbook RSA encryption is defined as $\mathcal{E}(x) = x^e \mod m$ where $e$ is public exponent and $m$ is the modulus.

• $x_1^e\cdot x_2^e = (x_1\cdot x_2)^e$ is a basic property of exponentiation.

• To get from the third line to the second you use the definition of $\mathcal{E}$ on $x_1\cdot x_2$ yielding $(x_1\cdot x_2)^e$.
-
Thanks very much! What do you mean by the definition of $E$, is that the procedure of encryption? –  user7378 Sep 20 '13 at 7:55