I have a question about the RSA signature.
Let's say Alice has $(d,n)$ as the private key and $(e,n)$ as the public key. In order to sign a message $m$, Alice computes $y = m^d \bmod n$ and sends $(m,y)$ to Bob. In order to verify the signature, Bob computes $x = y^e \bmod n$ and accepts the signature if $x = m$.
- My question is to find a message $m$ that lets Eve falsify in an easy way the signature by only knowing the public key.