On Thu, 5 Mar 2026 14:12:49 GMT, Ferenc Rakoczi <[email protected]> wrote:
>> Shawn Emery has updated the pull request incrementally with one additional
>> commit since the last revision:
>>
>> Optimize multByInt() method
>
> src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java
> line 105:
>
>> 103: */
>> 104: @Override
>> 105: protected void multByInt(long[] a, long b) {
>
> Probably we should gain some more speed by special casing b = 2, 3 and 4 (by
> just shifting (+ adding) all limb values before the reduce() call.
I believe that the scalar used by multByInt() will be the `a24` constant
(121665) as the caller will utilize the Montgomery ladder.
-------------
PR Review Comment: https://git.openjdk.org/jdk/pull/29981#discussion_r2892814141
