I`m solving one crypto problem on rsa.
p^e - q^e = C1 (mod n) (p-q)^e = C2 (mod n) n = p*q*r; p,q,r are prime numbers e = 2 * 65537
We have e, n, C1, C2.
It's impossible to find p, q, r from this system of equations, since there are 3 unknowns in the system of 2 equations. But is there any way to reduce the possible options?