are there any functions for computing a square root of a modulo p (prime)?

Torbjorn Granlund tg at
Thu Apr 11 23:57:59 CEST 2013

Zimmermann Paul <Paul.Zimmermann at> writes:

  indeed, see
  The Tonelli–Shanks algorithm is so useful in many applications, that it
  would make sense to have it implemented in GMP.
I and Niels wrote some Tonelli-Shanks code last autumn, and I suppose it
would make sense to adapt it for GMP inclusion.


More information about the gmp-discuss mailing list