Equivalent computational problems for superspecial abelian surfaces
Mickaël Montessinos
TL;DR
This work establishes a network of polynomial-time reductions (under GRH and KLPT^2 assumptions) among core computational problems for PPSAS: computing the Ibukiyama-Katsura-Oort matrix, obtaining an explicit endomorphism-basis representation, and finding unpolarised isomorphisms between PPSAS. By treating products of supersingular elliptic curves separately from genus 2 Jacobians, it shows that, for products, the three problems are equivalent, while for Jacobians the IKO-matrix problem corresponds to obtaining a good endomorphism representation; in all cases, End(A) computations can be reduced to IKO data and vice versa. A central technical contribution is a pair of reductions: from unpolarised isomorphisms to IKO matrices, and from IKO matrices to endomorphism rings with Rosati-tracking, implemented via chains of $(2,2)$-isogenies and KLPT^2, with explicit handling of orientations to ensure correctness of the induced Rosati involution. The results unify multiple representations of endomorphism data and open pathways to practical, though computationally intensive, procedures for recovering endomorphism rings and isomorphisms of PPSAS in the high-dimensional setting. These equivalences have potential implications for isogeny-based cryptography and the analysis of higher-dimensional endomorphism structures.
Abstract
We show reductions and equivalences between various problems related to the computation of the endomorphism ring of principally polarised superspecial abelian surfaces. Problems considered are the computation of the Ibukiyama-Katsura-Oort matrix and computation of unpolarised isomoprhisms between superspecial abelian surfaces.
