On Fri, 15 Aug 2025 01:01:01 GMT, Ben Perez <[email protected]> wrote:
> 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%. This pull request has now been integrated. Changeset: 72e5ad3d Author: Ben Perez <[email protected]> URL: https://git.openjdk.org/jdk/commit/72e5ad3d21effff6a4efae8ab3ed45c4f6bfba76 Stats: 20 lines in 1 file changed: 1 ins; 15 del; 4 mod 8365581: Optimize Java implementation of P256 arithmetic Reviewed-by: jnimeh ------------- PR: https://git.openjdk.org/jdk/pull/26792
