# Tag Info

### Would encrypting a message twice with RSA with different keys be more secure that once?

Could someone please explain, mathematically, why I am correct/incorrect? This isn't a mathematical explanation, however I believe it's not a mathematical situation. By performing RSA twice, the ...
• 131k

• 84.5k
1 vote

### |RSA| Is it normal for $\phi(n)$ to work as RSA modulus?

In general a pair of RSA decryption exponents calculated in this way for a modulus $N$ will also work for any modulus $M$ that satisfies $\lambda(M)|\phi(N)$ where $\lambda$ is the Carmichael function....
• 9,576
1 vote

I tried proving that $E(message_{1} + message_{2}) \equiv E(message_{1}) \cdot E(message_{2})$. Does anyone see where I messed up? It is appeared you messed up when you tried to take this paper ...
The author forgot a few $\bmod n$ along the way. In particular, equation 9.2 is wrong, and should be $$E(PU,M_1)\times E(PU,M_2)\bmod n=E(PU,(M_1\times M_2\bmod n))$$ Also, what follows "note ...