The SEA algorithm for endomorphisms of supersingular elliptic curves
From MaRDI portal
Cites work
- A computational introduction to number theory and algebra
- Computing cardinalities of \(\mathbb{Q}\)-curve reductions over finite fields
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Counting points on elliptic curves over finite fields
- Fast algorithms for computing isogenies between elliptic curves
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 1210367 (Why is no real title available?)
- scientific article; zbMATH DE number 3995866 (Why is no real title available?)
- scientific article; zbMATH DE number 799763 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Mathematics of public key cryptography.
- Modern computer algebra
- Nonsingular plane cubic curves over finite fields
- On the distribution of Atkin and Elkies primes
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- On the evaluation of modular polynomials
- Probabilistic Algorithms in Finite Fields
- Remarks on the Schoof-Elkies-Atkin algorithm
- Supersingular j-invariants as singular moduli mod p
- The Arithmetic of Elliptic Curves
This page was built for publication: The SEA algorithm for endomorphisms of supersingular elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313134)
