Why not have modsqrt?

[fade2black]

We have modpow and modinv. But wouldn't be it helpful to have something like modsqrt(&self, &Self modulus) -> Option<Self> for BigUint?
This proc would be handy to solve x^2 = n mod P, were P is prime. For now, I implement Tonelli-Shanks manually.