The Q-curve construction for endomorphism-accelerated elliptic curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Cryptology Year : 2016

The Q-curve construction for endomorphism-accelerated elliptic curves

Abstract

We give a detailed account of the use of $\mathbb{Q}$-curve reductions to construct elliptic curves over $\mathbb{F}_{p^2}$ with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) endomorphisms. Like GLS (which is a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves, and thus finding secure group orders when \(p\) is fixed for efficient implementation. Unlike GLS, we also offer the possibility of constructing twist-secure curves. We construct several one-parameter families of elliptic curves over $\mathbb{F}_{p^2}$ equipped with efficient endomorphisms for every $p > 3$, and exhibit examples of twist-secure curves over $\mathbb{F}_{p^2}$ for the efficient Mersenne prime $p = 2^{127}-1$.
Fichier principal
Vignette du fichier
smith-qcurves.pdf (301.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01064255 , version 1 (15-09-2014)
hal-01064255 , version 2 (24-03-2015)

Licence

Copyright

Identifiers

Cite

Benjamin Smith. The Q-curve construction for endomorphism-accelerated elliptic curves. Journal of Cryptology, 2016, 29 (4), pp.27. ⟨10.1007/s00145-015-9210-8⟩. ⟨hal-01064255v2⟩
958 View
467 Download

Altmetric

Share

Gmail Facebook X LinkedIn More