There are several places where MontgomeryIntegerPolynomialP256.mult() can be optimized. In particular, since modulus[2] = 0 several multiplications can be removed. Other multiplications can be replaced by shifts, which would also save time. Preliminary tests indicate an improvement between 5-10% is possible. Testing of these changes is covered by MontgomeryPolynomialFuzzTest