Computing cardinalities of -curve reductions over finite fields

DOI10.1112/S1461157016000267zbMath1404.11146arXiv1605.07749OpenAlexW3099564332MaRDI QIDQ2971005

No author found.

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)

Cites Work

• Unnamed Item
• Advances in cryptology -- ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1--5, 2013. Proceedings, Part I
• On the distribution of Atkin and Elkies primes
• Nonsingular plane cubic curves over finite fields
• \(\mathbb{Q}\)-curves over quadratic fields
• Straight-line programs and torsion points on elliptic curves
• Counting points on elliptic curves over finite fields
• Group structures of elementary supersingular abelian varieties over finite fields.
• ``Chinese & Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
• Families of Fast Elliptic Curves from ℚ-curves
• Four-Dimensional GLV via the Weil Restriction
• Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
• Fast algorithms for computing isogenies between elliptic curves
• Subquadratic-time factoring of polynomials over finite fields
• Identifying supersingular elliptic curves
• On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
• Isogenies of polyquadratic \(\mathbb Q\)-curves to their Galois conjugates