RFR: 8295011: EC point multiplication improvement for secp256r1 [v4]

[Xue-Lei Andrew Fan]

On Thu, 3 Nov 2022 16:51:47 GMT, Mark Powers <mpowers at openjdk.org> wrote:

> Is this improvement also derived from the paper by Renes, Costello, and Batina?

Not really.  The idea is an improvement of the traditional double and addition formulas [1] for EC algorithms, by using interleaved multiplication [2].  In the ["Fast Elliptic Curve Cryptography in OpenSSL"](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37376.pdf) paper, there is a short description of the interleaved multiplication (see section 3.3).  This is an improvement so that it could be better fit for P384 and P521.

[1]: Hankerson, Darrel; Vanstone, Scott; Menezes, Alfred (2004). Guide to Elliptic Curve Cryptography. Springer Professional Computing. New York: Springer-Verlag.
[2]: Bodo M¨oller. Algorithms for multi-exponentiation.

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

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