On Sun, 17 May 2026 22:58:49 GMT, Shawn Emery <[email protected]> wrote:

>> Curve25519 polynomial arithmetic is performed with intrinsincs implemented 
>> in GPR related instructions for multiplication and squaring operations 
>> (methods mult() and square()).  Benchmark improvements include:
>> 
>> - X25519 encapsulation: +19%
>> - X25519 decapsulation: +19%
>> - X25519-MLKEM encapsulation: +12%
>> - X25519-MLKEM decapsulation: +15%
>> - X22519 key agreement: +19%
>> - X25519 key-pair generation: +19%
>> - X25519-MLKEM key-pair generation: +13%
>> - EdDSA key-pair generation: +20%
>> - EdDSA signing: +19%
>> 
>> ---------
>> - [x] I confirm that I make this contribution in accordance with the 
>> [OpenJDK Interim AI Policy](https://openjdk.org/legal/ai).
>
> Shawn Emery has updated the pull request incrementally with one additional 
> commit since the last revision:
> 
>   Add square() intrinsics

I'm not reviewing the actual multiply generator algorithm but the rest of the 
stub declaration and setup looks good.

I have 2 questions:
1) How has this been tested?
2) Is someone working on an AArch64 implementation?

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

PR Review: https://git.openjdk.org/jdk/pull/31087#pullrequestreview-4372355092

Reply via email to