I spoke too soon. I found one in nbtheory.h... Integer ModularSquareRoot(const Integer &a, const Integer &p)
Quoting [EMAIL PROTECTED]: > Hi All, > > Is this implemented in Crypto++? I can't seem to find it in nbtheory.h, > modarith.h, or integer.h. > > I guess what I really want is the extended Euclidean algorithm and Square > Roots algorithm modulo prime p. > > Reference Handbook of Applied Cryptography, by Menezes, van Oorschot, > Vanstone, p. 102, Algorithm 3.44. > > Jeff ___________________________________________________________ This mail sent using ToadMail -- Web based e-mail @ ToadNet
