English

Algebraic Modelings of the Supersingular Isogeny Problem

Symbolic Computation 2026-07-06 v1 Cryptography and Security Commutative Algebra

Abstract

We present a new algebraic modeling of the Supersingular Isogeny Problem as a system of multivariate polynomial equations, in the case where the elliptic curves are connected by an isogeny whose degree is a power of 22 or 33. This modeling relies on Renes formulas for elliptic curves in Montgomery form (degree 22) or triangular form (degree 33). We investigate several algebraic properties of these systems: we prove that they are zero-dimensional, compute the dimension of their highest degree part, and show that they are not in generic coordinates. Experimental results show that solving these systems via Gr\"obner basis techniques is significantly faster than solving the algebraic modeling with modular polynomials.

Cite

@article{arxiv.2607.05160,
  title  = {Algebraic Modelings of the Supersingular Isogeny Problem},
  author = {Alessio Caminata and Andrea Sanguineti and Silvia Sconza},
  journal= {arXiv preprint arXiv:2607.05160},
  year   = {2026}
}

Comments

24 pages, 0 figures

R2 v1 2026-07-22T20:24:09.708Z