Remarks on the Schoof-Elkies-Atkin algorithm
From MaRDI portal
Publication:4396461
DOI10.1090/S0025-5718-98-00962-4zbMath0892.11038MaRDI QIDQ4396461
Publication date: 14 June 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05) Arithmetic aspects of modular and Shimura varieties (11G18) Isogeny (14K02)
Related Items (4)
Two kinds of division polynomials for twisted Edwards curves ⋮ Computing the cardinality of CM elliptic curves using torsion points ⋮ A novel maximum distance separable code to generate universal identifiers ⋮ Finding the Eigenvalue in Elkies' Algorithm
Cites Work
- Counting points on elliptic curves over finite fields
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- A new polynomial factorization algorithm and its implementation
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Fast Algorithms for Manipulating Formal Power Series
- Counting Points on Elliptic Curves Over F 2 m
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Remarks on the Schoof-Elkies-Atkin algorithm
