The discrete square root problem is as follows.

Input. Positive integers x and m where m > 1.

Output Either a positive integer y so that y² ≡ x (mod m) or an indication that no such y exists.

For example, 4 is a discrete square root of 2 (mod 7), since 4² = 16 ≡ 2 (mod 7).