Abstract
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 \(\mathbb{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 \(\mathbb{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 \(\mathbb{F}_{p^2}\).
Chapter PDF
Similar content being viewed by others
References
Bernstein, D., Lange, T.: Explicit-Formulas Database, http://www.hyperelliptic.org/EFD/
Bisson, G.: Endomorphism rings in cryptography. PhD thesis, Institut National Polytechnique de Lorraine (2011)
Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in genus 2. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 194–210. Springer, Heidelberg (2013)
Cheon, J.H.: Security analysis of the strong diffie-hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1–11. Springer, Heidelberg (2006)
Costello, C., Lauter, K.: Group Law Computations on Jacobians of Hyperelliptic Curves. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 92–117. Springer, Heidelberg (2012)
Dewaghe, L.: Un corollaire aux formules de Vélu. Draft (1995)
Doche, C.: Exponentiation. In: Handbook of Elliptic and Hyperelliptic Curve Cryptography, ch. 9, pp. 145–168. Chapman and Hall/CRC, Taylor and Francis Group (2006)
Duursma, I., Kiyavash, N.: The vector decomposition problem for elliptic and hyperelliptic curves. Journal of the Ramanujan Mathematical Society 20(1), 59–76 (2005)
Freeman, D.M., Satoh, T.: Constructing pairing-friendly hyperelliptic curves using Weil restriction. Journal of Number Theory 131(5), 959–983 (2011)
Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518–535. Springer, Heidelberg (2009)
Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190–200. Springer, Heidelberg (2001)
Gaudry, P., Schost, É.: On the invariants of the quotients of the jacobian of a curve of genus 2. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 373–386. Springer, Heidelberg (2001)
Guillevic, A., Vergnaud, D.: Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 234–253. Springer, Heidelberg (2013)
Kohel, D.: Endomorphism rings of elliptic curves over finite fields. Ph.D. thesis, University of California at Berkeley (1996)
Leprévost, F., Morain, F.: Revêtements de courbes elliptiques à multiplication complexe par des courbes hyperelliptiques et sommes de caractères. Journal of Number Theory 64, 165–182 (1997), http://www.lix.polytechnique.fr/Labo/Francois.Morain/Articles/LIX-RR-94-07-revetement.ps.gz
Longa, P., Sica, F.: Four dimensional Gallant-Lambert-Vanstone scalar multiplication. Journal of Cryptology, 1–36 (2013)
Quer, J.: Fields of definition of ℚ-curves. Journal de Théorie des Nombres de Bordeaux 13(1), 275–285 (2001)
Satoh, T.: Generating genus two hyperelliptic curves over large characteristic finite fields. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 536–553. Springer, Heidelberg (2009)
Smith, B.: Families of fast elliptic curves from Q-curves. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 61–78. Springer, Heidelberg (2013), http://eprint.iacr.org/2013/312
Vélu, J.: Isogenies entre courbes elliptiques. Comptes Rendus De l’Académie Des Sciences Paris, Série I-Mathèmatique, Série A 273, 238–241 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillevic, A., Ionica, S. (2013). Four-Dimensional GLV via the Weil Restriction. In: Sako, K., Sarkar, P. (eds) Advances in Cryptology - ASIACRYPT 2013. ASIACRYPT 2013. Lecture Notes in Computer Science, vol 8269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42033-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-42033-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42032-0
Online ISBN: 978-3-642-42033-7
eBook Packages: Computer ScienceComputer Science (R0)