RSA Weak key, i.e small modulus

37 Views Asked by At

Let (e,n) be a public key such that 100 < e <200 and 2000 < n < 2500. M is a message and $M^e > n$. I know that if n is small we can factorize it. Is there any method to find M without factoring n?, i.e other attacking method different than factoring for small n.