Hello, 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. Andrea