Paper 2025/186

Computing Quaternion Embeddings and Endomorphism rings of Supersingular Oriented Elliptic curves

Abstract

In this paper, we investigate several computational problems motivated by post-quantum cryptosystems based on isogenies and ideal class group actions on oriented elliptic curves. Our main technical contribution is an efficient algorithm for embedding the ring of integers of an imaginary quadratic field $K$ into some maximal order of the quaternion algebra $B_{p,\mathrm{\infty }}$ ramified at a prime $p$ and infinity. Assuming the Generalized Riemann Hypothesis (GRH), our algorithm runs in probabilistic polynomial time, improving upon previous results that relied on heuristics or required the factorization of $\text{disc}(K)$. Notably, this algorithm may be of independent interest. Our approach enhances the work of Love and Boneh on computing isogenies between $$-small elliptic curves by eliminating heuristics and improving computational efficiency. Furthermore, given a quadratic order $$ in $$, we show that our algorithm reduces the computational endomorphism ring problem of $$-oriented elliptic curves to the Vectorization problem in probabilistic polynomial time, assuming the conductor of $$ can be efficiently factorized. Previously, the best known result required the full factorization of $$, which may be exponentially large. Additionally, when the conductor of $$ can be efficiently factorized, we establish a polynomial-time equivalence between the Quaternion Order Embedding Problem, which asks to embed a quadratic order $$ into a maximal order in $$, and computing horizontal isogenies between $$-oriented elliptic curves. Leveraging this reduction, we propose a rigorous algorithm, under GRH, that solves the quaternion order embedding problem in time $$, improving upon previous methods that required higher asymptotic time and relied on several heuristics.