Computing the number of points on an elliptic curve over a finite field: algorithmic aspects

DOI10.5802/JTNB.143zbMATH Open0843.11030OpenAlexW2067361453MaRDI QIDQ1909876FDOQ1909876

Authors: François Morain 

Publication date: 24 March 1996

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1995__7_1_255_0

Recommendations

• scientific article; zbMATH DE number 799765
• Counting points on elliptic curves over finite fields
• Schoof's point counting algorithm

zbMATH Keywords

elliptic curveprime fieldmodular curvesnumber of rational pointsfactors of division polynomialsSchoof's algorithm

Mathematics Subject Classification ID

Holomorphic modular forms of integral weight (11F11) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05)

Cites Work

• Title not available (Why is that?)
• Formes modulaires de poids $1$
• Modular functions of one variable. IV. Proceedings of the international summer school, University of Antwerp, RUCA, July 17 -- August 3, 1972
• Modular curves and the Eisenstein ideal
• Title not available (Why is that?)
• Les Schémas de Modules de Courbes Elliptiques
• Title not available (Why is that?)
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Title not available (Why is that?)
• Counting points on elliptic curves over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (27)

• Remarks on the Schoof-Elkies-Atkin algorithm
• Modular polynomials via isogeny volcanoes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm and program to determine the order of a point on an elliptic curve
• Towards practical key exchange from ordinary isogeny graphs
• Computing the $\ell $-power torsion of an elliptic curve over a finite field
• ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
• Quantum lattice enumeration and tweaking discrete pruning
• Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm
• Computing modular polynomials in quasi-linear time
• Modular polynomials on Hilbert surfaces
• Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
• Construction of elliptic curves with cyclic groups over prime fields
• Title not available (Why is that?)
• Calculating root numbers of elliptic curves over \(\mathbb{Q}\)
• Title not available (Why is that?)
• Computing integral points on Mordell's elliptic curves
• Modular forms, Schwarzian conditions, and symmetries of differential equations in physics
• Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
• Title not available (Why is that?)
• Schwarzian conditions for linear differential operators with selected differential Galois groups
• Fast algorithms for computing isogenies between elliptic curves
• Title not available (Why is that?)
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Computing the cardinality of CM elliptic curves using torsion points
• Modular equations for hyperelliptic curves

This page was built for publication: Computing the number of points on an elliptic curve over a finite field: algorithmic aspects

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