Modular square root

delta trinity deltatrinity at
Thu May 17 11:56:34 CEST 2007

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

>From: "Steven Beeckman" <steven.beeckman at>
>To: gmp-discuss at
>Subject: Modular square root
>Date: Tue, 15 May 2007 20:03:05 +0200
>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 
>!= 5 mod 8.
>Thanks in advance,

>gmp-discuss mailing list
>gmp-discuss at

More photos, more messages, more storage—get 2GB with Windows Live Hotmail.

More information about the gmp-discuss mailing list