English

Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication

Cryptography and Security 2011-11-17 v4 Number Theory

Abstract

The GLV method of Gallant, Lambert and Vanstone (CRYPTO 2001) computes any multiple kPkP of a point PP of prime order nn lying on an elliptic curve with a low-degree endomorphism Φ\Phi (called GLV curve) over Fp\mathbb{F}_p as [kP = k_1P + k_2\Phi(P), \quad\text{with} \max{|k_1|,|k_2|}\leq C_1\sqrt n] for some explicit constant C1>0C_1>0. Recently, Galbraith, Lin and Scott (EUROCRYPT 2009) extended this method to all curves over Fp2\mathbb{F}_{p^2} which are twists of curves defined over Fp\mathbb{F}_p. We show in this work how to merge the two approaches in order to get, for twists of any GLV curve over Fp2\mathbb{F}_{p^2}, a four-dimensional decomposition together with fast endomorphisms Φ,Ψ\Phi, \Psi over Fp2\mathbb{F}_{p^2} acting on the group generated by a point PP of prime order nn, resulting in a proved decomposition for any scalar k[1,n]k\in[1,n] kP=k1P+k2Φ(P)+k3Ψ(P)+k4ΨΦ(P)withmaxi(ki)<C2n1/4 kP=k_1P+ k_2\Phi(P)+ k_3\Psi(P) + k_4\Psi\Phi(P)\quad \text{with} \max_i (|k_i|)< C_2\, n^{1/4} for some explicit C2>0C_2>0. Furthermore, taking the best C1,C2C_1, C_2, we get C2/C1<408C_2/C_1<408, independently of the curve, ensuring a constant relative speedup. We also derive new families of GLV curves, corresponding to those curves with degree 3 endomorphisms.

Cite

@article{arxiv.1106.5149,
  title  = {Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication},
  author = {Peter Birkner and Patrick Longa and Francesco Sica},
  journal= {arXiv preprint arXiv:1106.5149},
  year   = {2011}
}

Comments

23 pages, 3 figures. Changes from v3: corrected typo in proof of Lemma 5

R2 v1 2026-06-21T18:27:36.819Z