Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
From MaRDI portal
(Redirected from Publication:1909876)
Recommendations
Cites work
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3538182 (Why is no real title available?)
- scientific article; zbMATH DE number 1237890 (Why is no real title available?)
- scientific article; zbMATH DE number 3446982 (Why is no real title available?)
- scientific article; zbMATH DE number 799763 (Why is no real title available?)
- scientific article; zbMATH DE number 799765 (Why is no real title available?)
- Counting points on elliptic curves over finite fields
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Formes modulaires de poids $1$
- Les Schémas de Modules de Courbes Elliptiques
- Modular curves and the Eisenstein ideal
- Modular functions of one variable. IV. Proceedings of the international summer school, University of Antwerp, RUCA, July 17 -- August 3, 1972
Cited in
(27)- Modular equations for hyperelliptic curves
- Remarks on the Schoof-Elkies-Atkin algorithm
- Modular polynomials via isogeny volcanoes
- scientific article; zbMATH DE number 1237890 (Why is no real title available?)
- scientific article; zbMATH DE number 592845 (Why is no real title available?)
- 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
- Quantum lattice enumeration and tweaking discrete pruning
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
- 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
- Calculating root numbers of elliptic curves over \(\mathbb{Q}\)
- scientific article; zbMATH DE number 799765 (Why is no real title available?)
- Computing integral points on Mordell's elliptic curves
- scientific article; zbMATH DE number 1860726 (Why is no real title available?)
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
- Modular forms, Schwarzian conditions, and symmetries of differential equations in physics
- scientific article; zbMATH DE number 1273657 (Why is no real title available?)
- Schwarzian conditions for linear differential operators with selected differential Galois groups
- Fast algorithms for computing isogenies between elliptic curves
- scientific article; zbMATH DE number 66919 (Why is no real title available?)
- Computing the cardinality of CM elliptic curves using torsion points
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
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)
