Modular square root

[Steven Beeckman]

Hi,

is there an algorithm (implemented in C or C++ using GMP) available which
calculates the square roots of (a mod p) where p is a prime? I've tried
implementing it using GMP, but I'm lost in the cases where p != 3 mod 4 or p
!= 5 mod 8.

Thanks in advance,

Steven
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://gmplib.org/list-archives/gmp-discuss/attachments/20070515/8a4f9af7/attachment-0001.html