[Foxtrot] modular square roots

[Michael Pinna]

Guys,

have any of you, by any chance, found out to compute the modular square
roots needed to choose the polynomial used in mpqs on line 5 of page 359
of Montgomery? I can do the first one (where the modulus is prime),
though actually I've imposed the condition that a = 1 mod 4 to make the
sums easier :) The second one needs a square root computing mod a
squared, and that's harder...

Any handy suggestions?

Mike

-- 
"...like the floating elephant imitating a pen."
      --Anon