Montgomery reduction requires an odd modulus, and that's the only one that's implemented at present. Even moduli could be handled by having special code for moduli that are powers of 2 (in which case reduction is very fast), together with CRT.
This is lowish priority, since the main case is that of prime moduli, which are all odd.
Montgomery reduction requires an odd modulus, and that's the only one that's implemented at present. Even moduli could be handled by having special code for moduli that are powers of 2 (in which case reduction is very fast), together with CRT.
This is lowish priority, since the main case is that of prime moduli, which are all odd.