Computing isogenies between jacobians of hyperelliptic curves of arbitrary genus via differential equations
Elie Eid (IRMAR, LFANT)

TL;DR
This paper surveys an algorithm for efficiently computing explicit isogenies between Jacobians of hyperelliptic curves of any genus over p-adic fields, with quasi-linear complexity in the degree and genus.
Contribution
It introduces a quasi-linear complexity algorithm for computing rational representations of isogenies between hyperelliptic Jacobians of arbitrary genus.
Findings
Algorithm has quasi-linear complexity in degree and genus
Applicable over extensions of p-adic fields
Enables explicit isogeny computations for hyperelliptic Jacobians
Abstract
Let be an odd prime number and be an integer coprime to . We survey an algorithm for computing explicit rational representations of -isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an extension of the field of -adic numbers . The algorithm has a quasi-linear complexity in as well as in the genus of the curves.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
