There is a randomized polynomial-time reduction from the factoring problem to the discrete square root problem.

So, if the discrete square root problem is solvable in randomized polynomial time then the factoring problem is solvable in randomized polynomial time.