Families of fast elliptic curves from Q-curves

DOI10.1007/978-3-642-42033-7_4MaRDI QIDQ2867211zbMATH OpenOpenAlexFDO

Authors Benjamin Smith

Publication date 10 December 2013

Published in Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.5400

zbMATH Keywords

\(\mathbb Q\)-curveselliptic curve cryptographyexponentiationGalbraith-Lin-Scott (GLS) endomorphismGallant-Lambert-Vanstone (GLV) endomorphismscalar multiplication

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Abstract: We construct new families of elliptic curves over (FF_{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. Our construction is based on reducing (QQ)-curves-curves over quadratic number fields without complex multiplication, but with isogenies to their Galois conjugates-modulo inert primes. As a first application of the general theory we construct, for every (p > 3), two one-parameter families of elliptic curves over (FF_{p^2}) equipped with endomorphisms that are faster than doubling. Like GLS (which appears as 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. Unlike GLS, we also offer the possibility of constructing twist-secure curves. Among our examples are prime-order curves equipped with fast endomorphisms, with almost-prime-order twists, over (FF_{p^2}) for (p = 2^{127}-1) and (p = 2^{255}-19).

Recommendations

• The Q-curve construction for endomorphism-accelerated elliptic curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Four-dimensional GLV via the Weil restriction
• Some techniques for faster scalar multiplication on GLS curves

Cited in

(6)

• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Some techniques for faster scalar multiplication on GLS curves
• Methods of generation of elliptic curves for hybrid SIDH scheme over large fields
• Ready-made short basis for GLV+GLS on high degree twisted curves
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
• Computing cardinalities of \(\mathbb{Q}\)-curve reductions over finite fields

This page was built for publication: Families of fast elliptic curves from \(\mathbb Q\)-curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867211)