RFR: 8365581: Optimize Java implementation of P256 arithmetic [v2]

[Ben Perez]

> 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 also saves time. Preliminary tests indicate an improvement between 5-10%.

Ben Perez has updated the pull request incrementally with one additional commit since the last revision:

  Made modulus array @Stable, and removed non-zero hand written modulus values

-------------

Changes:
  - all: https://git.openjdk.org/jdk/pull/26792/files
  - new: https://git.openjdk.org/jdk/pull/26792/files/ea1422e3..46680f9d

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=26792&range=01
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=26792&range=00-01

  Stats: 17 lines in 1 file changed: 5 ins; 0 del; 12 mod
  Patch: https://git.openjdk.org/jdk/pull/26792.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/26792/head:pull/26792

PR: https://git.openjdk.org/jdk/pull/26792