Finding the Eigenvalue in Elkies' Algorithm

DOI10.1080/10586458.2001.10504448zbMATH Open1065.11044OpenAlexW2172130454MaRDI QIDQ4736655FDOQ4736655

Volker Müller, Markus Maurer

Publication date: 5 August 2004

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/999188637

zbMATH Keywords

elliptic curvepoint countingSchoof algorithmElkies primeselliptic curves over prime fields

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15)

Cites Work

• Title not available (Why is that?)
• A Survey of Fast Exponentiation Methods
• Remarks on the Schoof-Elkies-Atkin algorithm

Cited In (3)

• ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
• Computing the cardinality of CM elliptic curves using torsion points

Uses Software

• LiDIA

   Recommendations

• Remarks on the Schoof-Elkies-Atkin algorithm 👍 👎
• Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm 👍 👎
• Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts 👍 👎
• On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field 👍 👎
• Counting points on elliptic curves over finite fields 👍 👎

This page was built for publication: Finding the Eigenvalue in Elkies' Algorithm

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