Compute the square root of x modulo a prime using the Shanks-Tonnelli algorithm
the input x
the prime p
y such that (y*y)%p == x, or -1 if no such integer
See Implementation
Compute the square root of x modulo a prime using the Shanks-Tonnelli algorithm