Modular square root

Steven Beeckman steven.beeckman at
Tue May 15 20:03:05 CEST 2007


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,

-------------- next part --------------
An HTML attachment was scrubbed...

More information about the gmp-discuss mailing list