Computing modular polynomials by deformation

DOI10.1007/S40993-024-00596-5MaRDI QIDQ6653364FDOQ6653364

Authors: Sabrina Kunzweiler, Damien Robert 

Publication date: 16 December 2024

Published in: Research in Number Theory (Search for Journal in Brave)

Recommendations

• Modular polynomials via isogeny volcanoes
• Computing modular polynomials in quasi-linear time
• Computing Modular Polynomials
• On the evaluation of modular polynomials
• A quasi-linear time algorithm for computing modular polynomials in dimension 2

Mathematics Subject Classification ID

Abelian varieties of dimension (> 1) (11G10) Elliptic curves over local fields (11G07) Number-theoretic algorithms; complexity (11Y16) Local deformation theory, Artin approximation, etc. (14B12)

Cites Work

• Les Schémas de Modules de Courbes Elliptiques
• Computing parametric geometric resolutions
• Deformation Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing modular polynomials in quasi-linear time
• Counting points on elliptic curves over finite fields
• Modular polynomials via isogeny volcanoes
• The number of curves of genus two with elliptic differentials.
• Title not available (Why is that?)
• A quasi-linear time algorithm for computing modular polynomials in dimension 2
• Integer multiplication in time \(O(n\log n)\)
• Faster computation of isogenies of large prime degree
• An explicit height bound for the classical modular polynomial
• Constructing supersingular elliptic curves
• Modular exponentiation via the explicit Chinese remainder theorem
• Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
• Efficient compression of SIDH public keys
• Multiradical isogenies
• Fast change of level and applications to isogenies
• Breaking SIDH in polynomial time
• An efficient key recovery attack on SIDH
• A direct key recovery attack on SIDH
• Certified Newton schemes for the evaluation of low-genus theta functions
• Title not available (Why is that?)
• Efficient computation of \((2^n, 2^n)\)-isogenies
• \textsf{FESTA}: fast encryption from supersingular torsion attacks
• SQIsignHD: new dimensions in cryptography

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)