Explicit isogenies in quadratic time in any characteristic
From MaRDI portal
Publication:2971015
Abstract: Consider two elliptic curves defined over the finite field , and suppose that there exists an isogeny between and . We propose an algorithm that determines from the knowledge of , and of its degree , by using the structure of the -torsion of the curves (where is a prime different from the characteristic of the base field). Our approach is inspired by a previous algorithm due to Couveignes, that involved computations using the -torsion on the curves. The most refined version of that algorithm, due to De Feo, has a complexity of base field operations. On the other hand, the cost of our algorithm is ; this makes it an interesting alternative for the medium- and large-characteristic cases.
Recommendations
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Fast algorithms for computing isogenies between elliptic curves
- A subexponential algorithm for evaluating large degree isogenies
- Fast computation of elliptic curve isogenies in characteristic two
- scientific article; zbMATH DE number 1113839
Cites work
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- An elliptic curve trapdoor system
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Counting points on elliptic curves over finite fields
- Cryptographic hash functions from expander graphs
- Determining the $2$-Sylow subgroup of an elliptic curve over a finite field
- Endomorphisms of Abelian varieties over finite fields
- Fast Decomposition of Polynomials with Known Galois Group
- Fast algorithms for computing isogenies between elliptic curves
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Fast arithmetics in Artin-Schreier towers over finite fields
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Isomorphisms between Artin-Schreier towers
- Modular polynomials via isogeny volcanoes
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- On \(p\)-adic differential equations with separation of variables
- On the distribution of Atkin and Elkies primes
- Pairing the volcano
Cited in
(15)- Quantum lattice enumeration and tweaking discrete pruning
- A subexponential algorithm for evaluating large degree isogenies
- Faster computation of isogenies of large prime degree
- Explicit Isogenies of Prime Degree Over Quadratic Fields
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Fast algorithms for computing isogenies between elliptic curves
- Curves, Jacobians, and cryptography
- Distorting the volcano
- Composite genus one Belyi maps
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Fast computation of elliptic curve isogenies in characteristic two
- Isogeny problems with level structure
- On two problems about isogenies of elliptic curves over finite fields
- Towards practical key exchange from ordinary isogeny graphs
This page was built for publication: Explicit isogenies in quadratic time in any characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971015)