Return to Question

Let's say:

• $x = m^{e-1}\bmod n$
• $y = m^{d-1}\bmod n$

Here $m$ is a message, $e$ is the public exponent, $d$ is a private key and $n$ is the modulus of an RSA key pair.

Now if I know $e$, $x$, $y$, and $n$, can I retrieve the message $m$?

Assume:

• $x = m^{e-1}\bmod n$
• $y = m^{d-1}\bmod n$

Here $m$ is a message, $e$ is the public exponent, $d$ is the private key and $n$ is the modulus of an RSA key pair.

Now if I know $e=65537$, $x$, $y$, and $n$, can I retrieve the message $m$?

Let's say:

• $x = m^{e-1}\bmod n$
• $y = m^{d-1}\bmod n$

Here $m$ is a message, $e$ is public exponent, $d$ is private key and $n$ is the modulus.

Now if I know $e, x, y$, and $n$, can I retrieve the message $m$?

Let's say:

• $x = m^{e-1}\bmod n$
• $y = m^{d-1}\bmod n$

Here $m$ is a message, $e$ is the public exponent, $d$ is a private key and $n$ is the modulus of an RSA key pair.

Now if I know $e$, $x$, $y$, and $n$, can I retrieve the message $m$?

Let's say:
x = m^e-1 % n
y = m^d-1 % n
Here m is message, e is public exponent, d is private key and n is modulus.
Now if I know e, x, y and n, can I retrieve the message m ?

Let's say:

• $x = m^{e-1}\bmod n$
• $y = m^{d-1}\bmod n$

Here $m$ is a message, $e$ is public exponent, $d$ is private key and $n$ is the modulus.

Now if I know $e, x, y$, and $n$, can I retrieve the message $m$?