Computing modular polynomials by deformation
From MaRDI portal
Publication:6653364
Recommendations
Cites work
- scientific article; zbMATH DE number 3252949 (Why is no real title available?)
- scientific article; zbMATH DE number 3353454 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- scientific article; zbMATH DE number 7659953 (Why is no real title available?)
- A direct key recovery attack on SIDH
- A quasi-linear time algorithm for computing modular polynomials in dimension 2
- An efficient key recovery attack on SIDH
- An explicit height bound for the classical modular polynomial
- Breaking SIDH in polynomial time
- Certified Newton schemes for the evaluation of low-genus theta functions
- Computing modular polynomials in quasi-linear time
- Computing parametric geometric resolutions
- Constructing supersingular elliptic curves
- Counting points on elliptic curves over finite fields
- Deformation Theory
- Efficient compression of SIDH public keys
- Efficient computation of \((2^n, 2^n)\)-isogenies
- Fast change of level and applications to isogenies
- Faster computation of isogenies of large prime degree
- Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
- Integer multiplication in time \(O(n\log n)\)
- Les Schémas de Modules de Courbes Elliptiques
- Modular exponentiation via the explicit Chinese remainder theorem
- Modular polynomials via isogeny volcanoes
- Multiradical isogenies
- SQIsignHD: new dimensions in cryptography
- The number of curves of genus two with elliptic differentials.
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
Describes a project that uses
This page was built for publication: Computing modular polynomials by deformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653364)
