David Wilson asks:

 

     Is there a fairly fast algorithm to find the square root of a number

     to a given prime modulus p?

Henri Cohen, ``A Course in Computational Algebraic Number Theory,'' gives several methods.