The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves

DOI10.1007/s00145-015-9210-8zbMath1365.94460arXiv1409.4526OpenAlexW1786220217MaRDI QIDQ321311

Mohammad Hasan, M. Dambrine

Publication date: 13 October 2016

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

exponentiationendomorphismelliptic curve cryptography\(\mathbb Q\)-curvesGalbraith-Lin-Scott (GLS) endomorphismGallant-Lambert-Vanstone (GLV) endomorphismscalar decompositionscalar multiplication

Mathematics Subject Classification ID

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

Related Items

Efficiently computable complex multiplication of elliptic curves

Uses Software

• Magma
• NTL
• SageMath
• Echidna
• Curve25519

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• On Lovász' lattice reduction and the nearest lattice point problem
• Elliptic curve cryptosystems over small fields of odd characteristic
• \(\mathbb{Q}\)-curves over quadratic fields
• Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
• Fields of definition of \(\mathbb{Q}\)-curves
• Group structures of elementary supersingular abelian varieties over finite fields.
• One-way permutations on elliptic curves
• Distribution of elliptic twin primes in isogeny and isomorphism classes
• Q-Curves and Abelian Varieties of GL₂ -Type
• Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
• Families of Fast Elliptic Curves from ℚ-curves
• Four-Dimensional GLV via the Weil Restriction
• Mathematics of Public Key Cryptography
• Twisted Edwards Curves
• Twisted Edwards Curves Revisited
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
• Fast Cryptography in Genus 2
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Faster Compact Diffie–Hellman: Endomorphisms on the x-line
• A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
• Public Key Cryptography - PKC 2006
• Public Key Cryptography - PKC 2006
• Public Key Cryptography - PKC 2006
• Algorithmic Number Theory
• Isogenies of polyquadratic \(\mathbb Q\)-curves to their Galois conjugates