The Supersingular l-Isogeny Path and Endomorphism Ring Problems: Tighter Unconditional Reductions
IACR Communications in Cryptology · 03.08.2026 · 3 (2)
DOI: 10.62056/ab0lmpxqi ↗Kurz gefasst
Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 03.08.2026. Verfasst von Maher Mamah. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We prove that the supersingular ℓ -isogeny path problem and the endomorphism ring problem are equivalent via polynomial-time reductions given access to a factoring oracle. Prior work related the endomorphism ring problem to the general isogeny path problem, but the ℓ -isogeny path case remained open unconditionally. We show that a factoring oracle suffices to solve the quaternion path problem of Kohel, Lauter, Petit, and Tignol, replacing previous heuristic or GRH-based assumptions in the core reduction. Combined with Shor's factoring algorithm, this gives quantum polynomial-time equivalences between ℓ -isogeny path and endomorphism ring, with substantially lower polynomial degree, whereas the original reduction incurs a polynomial overhead of impractically high degree.
Zitieren
APA
Mamah, M. (2026). The Supersingular l-Isogeny Path and Endomorphism Ring Problems: Tighter Unconditional Reductions. IACR Communications in Cryptology, 3(2). https://doi.org/10.62056/ab0lmpxqi
Vancouver
Mamah M. The Supersingular l-Isogeny Path and Endomorphism Ring Problems: Tighter Unconditional Reductions. IACR Communications in Cryptology. 2026;3(2). doi:10.62056/ab0lmpxqi
BibTeX
@article{Mamah2026,
author = {Mamah, Maher},
title = {The Supersingular l-Isogeny Path and Endomorphism Ring Problems: Tighter Unconditional Reductions},
journal = {IACR Communications in Cryptology},
year = {2026},
volume = {3},
number = {2},
doi = {10.62056/ab0lmpxqi}
}
EUVIMED