Computing Isomorphisms between Products of Supersingular Elliptic Curves

The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time, given the endomorphism rings of the curves involved. Our approach leverages the Deuring correspondence, enabling us to reformulate computational isogeny problems into algebraic problems in quaternions. Specifically, we reduce the computation of isomorphisms to solving systems of quadratic and linear equations over the integers derived from norm equations. We develop $\ell$-adic techniques for solving these equations when we have access to a low discriminant subring. Combining these results leads to the description of an efficient probabilistic Las Vegas algorithm for computing the desired isomorphisms. Under GRH, it is proved to run in expected polynomial time.

@article{gaudry2025_2503.21535,
  title={ Computing Isomorphisms between Products of Supersingular Elliptic Curves },
  author={ Pierrick Gaudry and Julien Soumier and Pierre-Jean Spaenlehauer },
  journal={arXiv preprint arXiv:2503.21535},
  year={ 2025 }
}