Re: symbol catenation and montgomery

[phr-2000]

  [Snipped discussion of modexp speeds: GMP is now as fast or faster
   than the OpenSSL modexp library].

I see that the GMP manual "references" section cites Montgomery's
paper on modmult without trial division, so I guess GMP is definitely
using Montgomery reduction for modexp.

By the way, I'm a little depressed now that GPG is so slow.  I was
hoping it could be sped up by simply changing it to use a faster
modexp library instead of GMP.  But it looks like GMP is basically as
fast as anything else out there.  So not much can be done about GPG's
speed without changing the algorithms in it.

I guess GPG should be updated to include RSA cryptography by default,
now that the RSA patent has expired.