arXiv · 1605.07749
Computing cardinalities of Q-curve reductions over finite fields
Abstract
We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree isogeny to its Galois conjugate curve. These curves have interesting cryptographic applications. Our algorithm is a variant of the Schoof--Elkies--Atkin (SEA) algorithm, but with a new, lower-degree endomorphism in place of Frobenius. While it has the same asymptotic asymptotic complexity as SEA, our algorithm is much faster in practice.
Explore related subjects
Keep this discovery
François Morain, Charlotte Scribot, Benjamin Smith. 2016-05-25. Computing cardinalities of Q-curve reductions over finite fields. https://doi.org/10.1112/s1461157016000267
Cite the original work for its findings. Save a collection to share your selection of sources.