Modular square root

[delta trinity]

A very good refference for those algorithm is "A Course in Computational 
Algebraic Number Theory" by Hemri Cohen.

There is an sample of this book at

http://tinyurl.com/2zhwcb


>From: "Steven Beeckman" <steven.beeckman at gmail.com>
>To: gmp-discuss at swox.com
>Subject: Modular square root
>Date: Tue, 15 May 2007 20:03:05 +0200
>
>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


>_______________________________________________
>gmp-discuss mailing list
>gmp-discuss at swox.com
>https://gmplib.org/mailman/listinfo/gmp-discuss

_________________________________________________________________
More photos, more messages, more storage—get 2GB with Windows Live Hotmail. 
http://imagine-windowslive.com/hotmail/?locale=en-us&ocid=TXT_TAGHM_migration_HM_mini_2G_0507