Answers are grounded in this paper and cite their sources.
Algorithm finds efficient scalar-point multiplication in elliptic curves, suggesting improved cryptographic performance.
We introduce LadderPrime, an exception-free scalar-point multiplication algorithm, which works on the Kummer line of an elliptic curve given by the equation B*y^2=x^3+A*x^2+ax+b. LadderPrime operates only on two coordinates and computes the correct output for all input points, all scalars, and all elliptic curves of characteristic > 2. This is achieved by an alternative set of differential-addition formulas which can handle not only generic points but also the problematic point (0 : Z) for Montgomery ladder. The main structure of LadderPrime is analogous to the scalar-point multiplication in Bernstein’s X25519 Diffie-Hellman key exchange (DH) specification. Unlike, X25519 which uses the non-prime order (h = 8) elliptic Curve25519, LadderPrime is able to work with prime order (h = 1) (and non-prime order) elliptic curves. When used with a prime order elliptic curve, LadderPrime does not need the initial raising of base point to a prime order subgroup. In other words, LadderPrime eliminates the need for masking lower bits of the scalar. LadderPrime also eliminates the need for Hamburg’s "Decaf" (CRYPTO 2015) and later refined "Ristretto" methods. Essential cryptographic protocols such as DH and qDSA can be instantiated over LadderPrime.
No takes yet. Share an insight, caveat, or question.
Hışıl et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: