Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Taken from http://en.wikipedia.org/wiki/Homomorphic_encryption,

$\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?

share|improve this question
add comment

1 Answer 1

  • $\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$.
share|improve this answer
    
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
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.