ModularSquareRoot can't handle a really big n because of the factorization problem. But I would like to know if there is any other function than can use as parameters the factorization of n.

I already have an algorithm that does that for n=pq with p, q primers, and could generalize it, but I was wondering whether there was a built-in function that does that.