Paper 2013/311

Four-dimensional GLV via the Weil restriction

Aurore Guillevic and Sorina Ionica


The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over $\F_{p}$ which have the property that the corresponding Jacobians are $(2,2)$-isogenous over an extension field to a product of elliptic curves defined over $\F_{p^2}$. We exploit the relationship between the endomorphism rings of isogenous abelian varieties to exhibit efficiently computable endomorphisms on both the genus 2 Jacobian and the elliptic curve. This leads to a four dimensional GLV method on Freeman and Satoh's Jacobians and on two new families of elliptic curves defined over $\F_{p^2}$.

Note: corrected some typos and added explanations about the endomorphism eigenvalues.

Available format(s)
Publication info
A minor revision of an IACR publication in ASIACRYPT 2013
scalar multiplicationelliptic curvesgenus 2isogenies
Contact author(s)
aurore guillevic @ ens fr
2013-11-04: last of 5 revisions
2013-05-28: received
See all versions
Short URL
Creative Commons Attribution


      author = {Aurore Guillevic and Sorina Ionica},
      title = {Four-dimensional GLV via the Weil restriction},
      howpublished = {Cryptology ePrint Archive, Paper 2013/311},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.