Skip to main navigation Skip to search Skip to main content

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts

  • Georg-August-Universität Göttingen
  • University of Western Ontario

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Schoof-Elkies-Atkin algorithm is the best known method for counting the number of points of an elliptic curve defined over a finite field of large characteristic. We use Abelian properties of division polynomials to design a fast theoretical and practical algorithm for nding the eigenvalue.

Original languageEnglish
Title of host publicationISSAC 2007 - Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation
PublisherAssociation for Computing Machinery
Pages285-292
Number of pages8
ISBN (Print)1595937439, 9781595937438
DOIs
Publication statusPublished - 1 Jan 2007
EventISSAC 2007 - 2007 International Symposium on Symbolic and Algebraic Computation - London, ON, Canada
Duration: 29 Jul 20071 Aug 2007

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

ConferenceISSAC 2007 - 2007 International Symposium on Symbolic and Algebraic Computation
Country/TerritoryCanada
CityLondon, ON
Period29/07/071/08/07

Keywords

  • Elliptic curves
  • Finite fields
  • SEA algorithm

Fingerprint

Dive into the research topics of 'Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts'. Together they form a unique fingerprint.

Cite this