Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
From MaRDI portal
Publication:3296197
Cryptography (94A60) Elliptic curves over global fields (11G05) Quaternion and other division algebras: arithmetic, zeta functions (11R52) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05) Elliptic curves (14H52)
Abstract: We study the problem of generating the endomorphism ring of a supersingular elliptic curve by two cycles in -isogeny graphs. We prove a necessary and sufficient condition for the two endomorphisms corresponding to two cycles to be linearly independent, expanding on the work in Kohel's thesis. We also give a criterion under which the order generated by two cycles is not a maximal order. We give some examples in which we compute cycles which generate the full endomorphism ring. The most difficult part of these computations is the calculation of the trace of these cycles. We show that a generalization of Schoof's algorithm can accomplish this computation efficiently.
Recommendations
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- On isogeny graphs of supersingular elliptic curves over finite fields
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Loops of isogeny graphs of supersingular elliptic curves at \(j=0\)
- Isogeny graphs of superspecial abelian varieties
- Orienting supersingular isogeny graphs
- Explicit connections between supersingular isogeny graphs and Bruhat-Tits trees
- On the cycle‐isomorphism of graphs
Cites work
- scientific article; zbMATH DE number 4006420 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Abelian varieties over finite fields
- An algorithm for computing modular forms on \(\Gamma_0(N)\)
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing supersingular elliptic curves with a given endomorphism ring
- Counting points on elliptic curves over finite fields
- Cryptographic hash functions from expander graphs
- Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Fast algorithms for computing isogenies between elliptic curves
- Finite quaternionic matrix groups
- Identification protocols and signature schemes based on supersingular isogeny problems
- Isogeny volcanoes
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- On the quaternion \(\ell\)-isogeny path problem
- Supersingular elliptic curves and maximal quaternionic orders
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- The Arithmetic of Elliptic Curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(9)- Orienteering with one endomorphism
- On sign changes of cusp forms and the halting of an algorithm to construct a supersingular elliptic curve with a given endomorphism ring
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Orienting supersingular isogeny graphs
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- Orientations and cycles in supersingular isogeny graphs
- Computing endomorphism rings of supersingular elliptic curves by finding cycles in concatenated supersingular isogeny graphs
- Computing a basis of the set of isogenies between two supersingular elliptic curves
- Endomorphism rings of supersingular elliptic curves over \(\mathbb{F}_p\)
This page was built for publication: Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296197)
