On the feasibility of computing constructive Deuring correspondence
From MaRDI portal
Recommendations
- Implementation report of the Kohel-Lauter-Petit-Tignol algorithm for the constructive Deuring correspondence
- Deuring for the people: supersingular elliptic curves with prescribed endomorphism ring in general characteristic
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing supersingular elliptic curves with a given endomorphism ring
Cites work
- A new isogeny representation and applications to cryptography
- Approximate formulas for some functions of prime numbers
- Faster computation of isogenies of large prime degree
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- Identification protocols and signature schemes based on supersingular isogeny problems
- Implementation report of the Kohel-Lauter-Petit-Tignol algorithm for the constructive Deuring correspondence
- On the quaternion -isogeny path problem
- Quaternion algebras
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Séta: Supersingular Encryption from Torsion Attacks
- The Arithmetic of Elliptic Curves
Cited in
(2)
This page was built for publication: On the feasibility of computing constructive Deuring correspondence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196949)