Modular exponentiation mpn_powm and special prime modulus

[Torbjörn Granlund]

Miele Andrea <andrea.miele at epfl.ch> writes:

  I was wondering if modular exponentiation functions like mpn_powm can
  take advantage of a prime modulus p such that p = -1 mod 2^64 or mod
  2^32 which allows to save some (single digit) multiplications in the
  Montgomery multiplication algorithm.
  
GMP does not special case Mersenne numbers (prime or non-prime) in its
modular powering code.

-- 
Torbjörn
Please encrypt, key id 0xC8601622