Assume factorization of $N$ is unknown. What is the best complexity we know to find roots of the equation $$ax^2+bx+c\equiv0\bmod N?$$
Is this problem equivalent to any hardness results?
On roots of quadratics modulo composites
Turbo
- 13.9k
- 1
- 27
- 76