Computing isogenies between abelian varieties
David Lubicz, Damien Robert

TL;DR
This paper presents an efficient algorithm for computing separable isogenies between abelian varieties using algebraic theta functions, extending elliptic curve isogeny methods to higher dimensions with improved encoding techniques.
Contribution
It introduces a higher-dimensional analog of Vélu's algorithm for abelian varieties, including a compressed point representation and formulas for pairings, enhancing computational efficiency.
Findings
Algorithm complexity is O(log ℓ) for isogeny computation.
Introduces a compressed representation encoding points with fewer coordinates.
Provides formulas for Weil and commutator pairings in theta coordinates.
Abstract
We describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let be an abelian variety of dimension defined over a field of odd characteristic. Our algorithm decomposes in two principal steps. First, given a theta null point for and a subgroup isotropic for the Weil pairing, we explain how to compute the theta null point corresponding to the quotient abelian variety . Then, from the knowledge of a theta null point of , we give an algorithm to obtain a rational expression for an isogeny from to . The algorithm resulting as the combination of these two steps can be viewed as a higher dimensional analog of the well known algorithm of V\'elu to compute isogenies between elliptic curves. In the case that is isomorphic to …
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.
