On Wed, 4 Mar 2026 10:27:47 GMT, Ferenc Rakoczi <[email protected]> wrote:
>> Shawn Emery has updated the pull request incrementally with one additional >> commit since the last revision: >> >> Fix whitespace errors > > src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java > line 33: > >> 31: private static final int BITS_PER_LIMB = 51; >> 32: private static final int NUM_LIMBS = 5; >> 33: private static final int MAX_ADDS = 1; > > Actually, if you do a carry from c5 through c9 before the "pseudo-Mersenne > reduction", you can set this to 2, I think. Thank you for the insight @ferakocz. I had set the maximum number of additions to 2 and determined that the overall Montgomery ladder algorithm sequence does not perform successive additions for this to be of any affect. The benchmarks had also confirmed this theory with negligible change in performance. ------------- PR Review Comment: https://git.openjdk.org/jdk/pull/29981#discussion_r2887096619
